• The Journal of the Acoustical Society of Korea
• /
• v.18 no.1E
• /
• pp.13-19
• /
• 1999

This paper introduces an adaptive wavelet transform based on the lifting scheme, which is applied to signal denoising. The wavelet representation using orthogonal wavelet bases has received widespread attention. Recently the lifting scheme has been developed for the construction of biorthogonal wavelets in the spatial domain. Wavelet transforms are performed through three stages: the first stage or Lazy wavelet splits the data into two subsets, even and odd, the second stage calculates the wavelet coefficients (highpass) as the failure to interpolate or predict the odd set using the even, and the third stage updates the even set using neighboring odd points (wavelet coefficients) to compute the scaling function coefficients (lowpass). In this paper, we adaptively find some of the prediction coefficients for better representation of signals and this customizes wavelet transforms to provide an efficient framework for denoising. Special care has been given to the boundaries, where we design a set of different prediction coefficients to reduce the prediction error.

• Journal of the Korean Society for Precision Engineering
• /
• v.16 no.10
• /
• pp.194-202
• /
• 1999

A method for pattern recognition based on wavelet transform is proposed in this paper. The boundary of the object to be recognized includes shape information for object of machine parts. The contour is first represented using a one-dimensional signal and normalized about translation, rotation and scale, then is used to build the wavelet transform representation of the object. Wavelets allow us to decompose a function into multi-resolution hierarchy of localized frequency bands. The recognition of 2-dimensional object based on the wavelet is described to analyze the shape of analysis technique; the discrete wavelet transform(DWT). The feature vectors obtained using wavelet analysis is classified using a multi-layer neural network. The results show that, compared with the use of fourier descriptors, recognition using wavelet is more stable and efficient representation. And particularly the performance for objects corrupted with noise is better than that of other method.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.10 no.3
• /
• pp.237-247
• /
• 2014

This paper describes a 2D discrete-time wavelet transform for which the Q-factor is easily specified. Hence, the transform can be tuned according to the oscillatory behavior of the image signal to which it is applied. The tunable Q-factor wavelet transform (TQWT) is a fully-discrete wavelet transform for which the Q-factor, Q, of the underlying wavelet and the asymptotic redundancy (over-sampling rate), r, of the transform are easily and independently specified. In particular, the specified parameters Q and r can be real-valued. Therefore, by tuning Q, the oscillatory behavior of the wavelet can be chosen to match the oscillatory behavior of the signal of interest, so as to enhance the sparsity of a sparse signal representation. The TQWT is well suited to fast algorithms for sparsity-based inverse problems because it is a Parseval frame, easily invertible, and can be efficiently implemented. The TQWT can also be used as an easily-invertible discrete approximation of the continuous wavelet transform. The transform is based on a real valued scaling factor (dilation-factor) and is implemented using a perfect reconstruction over-sampled filter bank with real-valued sampling factors. The transform is parameterized by its Q-factor and its oversampling rate (redundancy), with modest oversampling rates (e. g. 3-4 times overcomplete) being sufficient for the analysis/synthesis functions to be well localized. Therefore, This method services good performance in image processing fields.

• Journal of the Korean Data and Information Science Society
• /
• v.19 no.4
• /
• pp.1465-1476
• /
• 2008

In recent years wavelet methods have been focused on block shrinkage or thresholding approaches to accounting for the sparseness of the wavelet representation for an unknown function. The block shrinkage or thresholding methods have been developed in both of classical methods and Bayesian methods. In this paper, we propose a Bayesian approach to selecting wavelet basis functions at each resolution level without MCMC procedure. Simulation study and an application are shown.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.17 no.9 s.112
• /
• pp.895-899
• /
• 2006

A compact representation of Green function is proposed by applying the discrete wavelet concept in the k-domain, which can be used for the acceleration of scattered field calculations in integral equation methods. Since the representation of Green function is very compact in the joint spatio-spectral domain, it can be effectively utilized in the fast computation of radiation integral of electromagnetic problems. A mathematical expression of Green function based on the discrete wavelet concept is derived and its characteristics are discussed.

• Proceedings of the KOSOMBE Conference
• /
• v.1994 no.12
• /
• pp.31-38
• /
• 1994

This paper proposed signal decomposition and multiresolution representation through wavelet transform using wavelet orthonormal basis. And it suggested most appropriate filter for scaling function in multiresoltion representation and compared two compression method, arithmetic coding and Huffman coding. Results are as follows 1. Daub18 coefficient is most appropriate in computing time, energy compaction, image quality. 2. In case of image browsing that should be small in size and good for recognition, it is reasonable to decompose to 3 scale using pyramidal algorithm. 3. For the case of progressive transmittion where requires most grateful image reconstruction from least number of sampls or reconstruction at any target rate, I embedded the data in order of significance after scaling to 5 step. 4. Medical images such as information loss is fatal have to be compressed by lossless method. As a result from compressing 5 scaled data through arithmetic coding and Huffman coding, I obtained that arithmetic coding is better than huffman coding in processing time and compression ratio. And in case of arithmetic coding I could compress to 38% to original image data.

• Journal of the Korean Mathematical Society
• /
• v.33 no.4
• /
• pp.955-982
• /
• 1996

In surface compression applications, one of the main issues is how to efficiently store and calculate the computer representation of certain surfaces. This leads us to consider a nonlinear approximation by box splines with free knots since, for instance, the nonlinear method based on wavelet decomposition gives efficient compression and recovery algorithms for such surfaces (cf. [12]).

• Bulletin of the Korean Mathematical Society
• /
• v.35 no.4
• /
• pp.629-640
• /
• 1998

The original work for representing derivative operators in the wavelet bases was done by Beylkin in [2]. In this paper we present an alternative and easier derivation.

• Communications for Statistical Applications and Methods
• /
• v.8 no.2
• /
• pp.573-579
• /
• 2001

Wavelet thresholding is a method for he reduction of noise in image. Wavelet coefficients of image are correlated in local characterization. Thee correlations also appear in he original pixel representation of the image, and they do not follow from the characterizations of the wavelet transform. In this paper, we compare noise-free distributions of Bayes approach to improve the classical threshold algorithm.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.3
• /
• pp.766-775
• /
• 2000

Representing 3-D objects with LOD requires a set of appropriate meshes according to the detail requirements. We have developed a system for improved geometry model data transmission and management by having only the wavelet coefficienets of the model corresponding to the detail levels, instead of generation all the meshes through wavelet transformation, when generating multiresolution meshes.