• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.7
• /
• pp.1487-1504
• /
• 1997

In this paper, the two-stage variable block-size multiresolution motion algorithm is proposed for an interframe coding scheme in the wavelet decomposition. An optimal bit allocagion between motion vectors and the prediction error in sense of minimizing the total bit rate is obtained by the proposed algorithm. The proposed algorithm consists of two stages for motion estimatation and only the first stage can be separated and run on its own. The first stage of the algorithm introduces a new method to give the lower bit rate of the displaced frame difference as well as a smooth motion field. In the second stage of the algorithm, the technique is introduced to have more accurate motion vectors in detailed areas, and to decrease the number of motion vectors in uniform areas. The algorithm aims at minimizin gthe total bit rate which is sum of the motion vectors and the displaced frame difference. The optimal bit allocation between motion vectors and displaced frame difference is accomplished by reducing the number of motion vectors in uniform areas and it is based on a botom-up construction of a quadtree. An entropy criterion aims at the control of merge operation. Simulation resuls show that the algorithm lends itself to the wavelet based image sequence coding and outperforms the conventional scheme by up to the maximum 0.28 bpp.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.9C
• /
• pp.1298-1305
• /
• 2004

Most watermarking techniques embed watermarks in the middle frequency range for robustness and invisibility. In our proposed watermarking algorithms embed the gaussian sequence watermark into low frequency area of the wavelet transform domain because the histogram of low sub-band area is composed by similar coefficients. Also, our proposed scheme doesn't need the original image in extraction procedure The experimental results show good robustness against the Check Mark benchmarking tools.

• Transactions of Materials Processing
• /
• v.12 no.4
• /
• pp.277-283
• /
• 2003

In a closed-die forging process, blocker has been used to fill and distribute metal well in finisher die. Generally, the blocker shape was determined by an expert with many experiences. However, the manual blocker design process takes much time and efforts, so various automatic methods for the blocker design process have been suggested for the last three decades. The method with filtering in FFT (Fast Fourier Transform) for the blocker design provides general solution than other methods. But. due to the properties of FFT in time-frequency domain, this method has some drawbacks such as long calculation time, difficulty of local control and additional boundary process after filtering. In this study. DWT (Discrete Wavelet Transform), which is more flexible and is more wildly used than FFT, is applied to the blocker design. The method with filtering in DWT is very proper to design blocker in both 2-D and 3-D shapes. To verify the efficiency of this method, blockers of some models are designed and the results show that blocker design with DWT is effective for the blocker designs.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1424-1427
• /
• 2002

This paper proposes a novel postprocessing algorithm for reducing the blocking artifacts in low bit rate block-based transform coded images, that use adaptive neural network filter (NNF) in wavelet transform domain. n this algorithm, after performing a 2-level wavelet transform of the decompressed image, the existence of locking artifacts is determined using statistical characteristic of neighborhood blocks. And then a different one-dimensional (1-D) or 2-D NNF is used to reduce the locking artifacts according to the classified regions. That is, for HL and LH subbands regions with the blocking artifacts, a different 1-D NNF is used. And 2-D NNF is used in HH subband. Experimental results show that the proposed algorithm produced better results than those of conventional algorithms both subjectively and objectively.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.45 no.5
• /
• pp.87-94
• /
• 2008

In this paper, we present a directional error concealment technique to compensate a lost block. Generally, the strong edge of an image has the large amounts of the variance because of its large coefficients in the wavelet domain. For estimating edge direction of a lost block, a $X^2$ hypothesis-testing problem is applied using the variance of wavelet coefficients. The lost block is interpolated according to the estimated edge direction. The pixels for interpolation is obtained from the edge direction. The proposed method outperforms the previous methods in objective and subjective qualities.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.15 no.10
• /
• pp.6317-6321
• /
• 2014

Multimedia documents can be transferred quickly and easily across the Internet, and has attracted considerable interest in multimedia security and multimedia copyright protection. This paper proposes an animage watermarking scheme embedding a binary watermark image using Discrete Wavelet Transform (DWT) coefficients. The original image is transformed to the wavelet domain and decomposed in subbands. The binary watermark image, as a sequence of bits, is embedded into the middle frequency subbands. The original image is not needed to detect the watermark image. The proposed method detected fewer watermark bits but produced an approximately 10dB higher PSNR than the max/min method.

• Journal of radiological science and technology
• /
• v.27 no.2
• /
• pp.13-19
• /
• 2004

This study proposes how to insert a strong watermark creating a big change in the areas of edge and texture. While conversion by existing Fourier transformation can acquire information for all ranges of frequency domain from the image, Wavelet transformation can manipulate edge and texture area selectively. Therefore, through wavelet transformation concerned area may be selected and watermarks in copyright formation are inserted. Our proposed algorithm was compared to Xia's watermarking technique using wavelet transformation. Its fidelity and robustness were tested with attack methods used in existing papers and it turns out that the proposed algorithm using HVS properties is more superior to Xia's techniques.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.10 no.4
• /
• pp.13-19
• /
• 2000

With the rapid development of the information communication technology, more and more distribution multimedia data and electronic publishing in the web, has created a need for the copyright protection with authentication of digital information. In this paper, we propose a multi-watermarking adding and adaptive spectral watermark algorithm well adaptive frequency domain of each hierarchical using orthogonal forward wavelet transform(FWT. Numerical test results, created watermarking image robustness not only image transform such as low-pass filtering, bluring, sharpen filtering, wavelet compression but also brightness, contrast gamma correction, histogram equalization, cropping.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.17 no.6
• /
• pp.309-317
• /
• 2022

In this paper, we propose a machine learning-based copy-move forgery detection network with dual branches. Because the rotation or scaling operation is frequently involved in copy-move forger, the conventional convolutional neural network is not effectively applied in detecting copy-move tampering. Therefore, we divide the input into rotation-invariant and scaling-invariant features based on the wavelet coefficients. Each of the features is input to different branches having the same structure, and is fused in the combination module. Each branch comprises feature extraction, correlation, and mask decoder modules. In the proposed network, VGG16 is used for the feature extraction module. To check similarity of features generated by the feature extraction module, the conventional correlation module used. Finally, the mask decoder model is applied to develop a pixel-level localization map. We perform experiments on test dataset and compare the proposed method with state-of-the-art tampering localization methods. The results demonstrate that the proposed scheme outperforms the existing approaches.

• Earthquakes and Structures
• /
• v.27 no.4
• /
• pp.263-283
• /
• 2024

This research introduces a new composite system that utilizes multiple moving masses to identify cracks in structures resembling beams. The process starts by recording displacement time data from a set of these moving masses and converting this information into a relative time history through weighted aggregation. This relative time history then undergoes wavelet transform analysis to precisely locate cracks. Following wavelet examinations, specific points along the beam are determined as potential crack sites. These points, along with locations on the beam susceptible to cracked point due to support conditions, are marked as crack locations within the optimization algorithm's search domain. The model uses equations of motion based on the finite element method for the moving masses on the beam and employs the Runge-Kutta numerical solution within the state space. The proposed system consists of three successive moving masses positioned at even intervals along the beam. To assess its effectiveness, the method is tested on two examples: a simply supported beam and a continuous beam, each having three scenarios to simulate the presence of one or multiple cracks. Additionally, another example investigates the influence of mass speed, spacing between masses, and noise effect. The outcomes showcase the method's effectiveness and efficiency in localizing crack, even in the presence of noise effect in 1%, 5% and 20%.