• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.2459-2462
• /
• 2003

In this paper, we Propose a wavelet based adaptive algorithm which improves the convergence speed and reduces computational complexity using the fast running FIR filtering efficiently. We compared the performance of the proposed algorithm with time and frequence domain adaptive algorithm using computer simulation of adaptive noise canceler based on synthesis speech.

• Proceedings of the IEEK Conference
• /
• 2002.06d
• /
• pp.179-182
• /
• 2002

In this paper, we propose a wavelet based adaptive algorithm which improves the convergence speed and reduces computational complexity using the fast running FIR filtering efficiently We compared the performance of the proposed algorithm with time and frequence domain adaptive algorithm using computer simulation of adaptive noise canceler based on synthesis speech. As the result, the proposed algorithm is suitable for adaptive signal processing area using speech or acoustic field.

• Proceedings of the IEEK Conference
• /
• 2002.06d
• /
• pp.219-222
• /
• 2002

In this paper, we propose a new blind image watermarking method in wavelet domain. It is necessary to find out watermark insertion location in blind watermark. We use horizontal and vertical difference of LL components to select watermark insertion location, because increment or decrement of successive components is rarely changed in LL band. A pseudo-random sequence is used as a watermark. Experimental results show that the proposed method is robust to various kinds of attacks such as JPEG lossy compression, averaging, median filtering, resizing, histogram equalization, and additive Gaussian noise.

• Progress in Superconductivity
• /
• v.5 no.1
• /
• pp.26-30
• /
• 2003

Magneto-cardiogram(MCG) signals may be highly distorted by the environmental noise, such as power-line interference, broadband white noise, surrounding magnetic noise, and baseline wondering. Several kinds of digital filters and noise cancellation methods have been designed and realized by many researchers, but these methods gave some problems that the original signal may be distorted by digital filter due to the wideband characteristics of background noise. To eliminate noise effectively without distortion of MCG signals, we performed multi-level frequency decomposition using wavelet packets and local adaptive noise cancellation in each local frequency range. In addition to the proposed wavelet filter to eliminate these various non-stationary noise elements, the local adaptive filter using the least mean square(LMS) algorithm and the soft threshold do-noising method are introduced in this paper. The signal to noise ratio(SNR) and the reconstruction square error(RSE) are calculated to evaluate the performance of the proposed method and compared with the results of the conventional wavelet filter and adaptive filter. The experimental results show that the proposed local adaptive filtering method is better than the conventional methods.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.7 no.4
• /
• pp.119-131
• /
• 2011

In this paper, we explore the application of 2-D dual-tree discrete wavelet transform (DDWT), which is a directional and redundant transform, for image coding. DDWT main property is a more computationally efficient approach to shift invariance. Also, the DDWT gives much better directional selectivity when filtering multidimensional signals. The dual-tree DWT of a signal is implemented using two critically-sampled DWTs in parallel on the same data. The transform is 2-times expansive because for an N-point signal it gives 2N DWT coefficients. If the filters are designed is a specific way, then the sub-band signals of the upper DWT can be interpreted as the real part of a complex wavelet transform, and sub-band signals of the lower DWT can be interpreted as the imaginary part. The quincunx lattice is a sampling method in image processing. It treats the different directions more homogeneously than the separable two dimensional schemes. Quincunx lattice yields a non separable 2D-wavelet transform, which is also symmetric in both horizontal and vertical direction. And non-separable wavelet transformation can generate sub-images of multiple degrees rotated versions. Therefore, non-separable image processing using DDWT services good performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.1C
• /
• pp.62-67
• /
• 2008

In this paper, wavelet based blind watermarking using self-reference method is proposed. First, we process wavelet transform of original image. Then, we set all domain except for the low-frequency domain to zero and make self-reference image after wavelet reverse transformation. By choosing specific domain according to the pixel value difference between original image and self-reference image, we make random sequence, use as watermark and embed. The experimental results of the watermark embedding and extraction on various images show that the proposed scheme not only has good image quality, but also has stability on JPEG lossy compression, filtering, sharpening, blurring and noise.

• Journal of the Institute of Convergence Signal Processing
• /
• v.5 no.3
• /
• pp.173-180
• /
• 2004

In this paper we provide a new image restoration method based on the multiscale regularization in the redundant wavelet transform domain. The proposed method uses the redundant wavelet transform to decompose the single-scale image restoration problem to multiscale ones and applies scale dependent regularization to the decomposed restoration problems. The proposed method recovers sharp edges by applying rather less regularization to wavelet related restorations, while suppressing the resulting noise magnification by the wavelet shrinkage algorithm. The improved performance of the proposed method over more traditional Wiener filtering is shown through numerical experiments.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.25-28
• /
• 2001

A theory of binary wavelets has been recently proposed by using two-band perfect reconstruction filter banks over binary field . Binary wavelet transform (BWT) of binary images can be used as an alternative to the real-valued wavelet transform of binary images in image processing applications such as compression, edge detection, and recognition. The BWT, however, requires large amount of computations since its operation is accomplished by matrix multiplication. In this paper, a fast BWT algorithm which utilizes filtering operation instead or matrix multiplication is presented . It is shown that the proposed algorithm can significantly reduce the computational complexity of the BWT. For the decomposition and reconstruction or an N ${\times}$ N image, the proposed algorithm requires only 2LN$^2$ multiplications and 2(L-1)N$^2$addtions when the filter length is L, while the BWT needs 2N$^3$multiplications and 2N(N-1)$^2$additions.

• Journal of Industrial Technology
• /
• v.28 no.B
• /
• pp.143-148
• /
• 2008

A real-time face detection is to find human faces robustly under the cluttered background free from the effect of occlusion by other objects or various lightening conditions. We propose a face detection system for real-time applications using wavelet decomposition method based on Gabor features. Firstly, skin candidate regions are extracted from the given image by skin color filtering and projection method. Then Gabor-feature based template matching is performed to choose face cadidate from the skin candidate regions. The chosen face candidate region is transformed into 2-level wavelet decomposition images, from which feature vectors are extracted for classification. Based on the extracted feature vectors, the face candidate region is finally classified into either face or nonface class by the Levenberg-Marguardt back-propagation neural network.

• Journal of the Korea Society of Computer and Information
• /
• v.7 no.4
• /
• pp.163-167
• /
• 2002

This paper propose the new spatially adaptive wavelet thresholding for image denosing. The method of wavelet thresholding for denosing, has been concentrated on finding the best uniform threshold or best basis. However, not much has been done to make this method adaptive to spatially changing statistics which is typical of a large class of images. Experimental results show that the proposed method outperforms level dependent thresholding techniques and is comparable to spatial Wiener filtering method in matlab.