• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.9
• /
• pp.30-40
• /
• 2014

As the Hadamard transform can be generalized into the Jacket transform, in this paper, we generalize the Haar transform into the Jacket-Haar transform. The entries of the Jacket-Haar transform are 0 and ${\pm}2^k$. Compared with the original Haar transform, the basis of the Jacket-Haar transform is general and more suitable for signal processing. As an application, we present the DCT-II(discrete cosine transform-II) based on $2{\times}2$ Hadamard matrix and HWT(Haar Wavelete transform) based on $2{\times}2$ Haar matrix, analysis the performances of them and estimate them via the Lenna image simulation.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2000.06a
• /
• pp.269-273
• /
• 2000

This paper describes Active Noise Control (ANC) using Discrete Wavelet Transform (DWT) Domain Least Mean Square (LMS) Method. DWT-LMS is one of the transform domain input decorrelation LMS and improves the convergence speed of adaptive filter especially when the input signal is highly correlated. Conventional transform domain LMS's use Discrete Cosine Transform (DCT) because it offers linear band signal decomposition and fast transform algorithm. Wavelet transform can project the input signal into the several octave band subspace and offers more efficient sliding fast transform algorithm. In this paper, we propose Wavelet transform domain LMS algorithm and shows its performance is similar to DCT LMS in some cases using ANC simulation.

• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.274-275
• /
• 2004

The Hough transform has been used as a tool for line detection. The main idea of the Hough transform is to transform each pixel in the image individually into the parameter domain. In this way, the Hough transform converts a difficult global detection problem in the image domain into a more easily solved local peak detection problem in the parameter domain. In this paper, we show that the discrete Hough transform is identical to the discrete Radon transform. Thus, we can use the generalized Radon transform to handle more general parameterized curve types.

• The Journal of the Acoustical Society of Korea
• /
• v.19 no.8
• /
• pp.54-62
• /
• 2000

Adaptive filtering method is one of signal processing area which is frequently used in the case of statistical characteristic change in time-varing situation. The performance of adaptive filter is usually evaluated with complexity of its structure, convergence speed and misadjustment. The structure of adaptive filter must be simple and its speed of adaptation must be fast for real-time implementation. In this paper, we propose chirp discrete cosine transform (CDCT), which has the characteristics of CZT (chrip z-transform) and DCT (discrete cosine transform), and then CDCTLMS (chirp discrete cosine transform LMS) using the above mentioned algorithm for the improvement of its speed of adaptation. Using loaming curve, we prove that the proposed method is superior to the conventional US (normalized LMS) algorithm and DCTLMS (discrete cosine transform LMS) algorithm. Also, we show the real application for the ultrasonic signal processing.

• Journal of Korea Water Resources Association
• /
• v.38 no.6 s.155
• /
• pp.439-448
• /
• 2005

This paper introduces the wavelet transform that was improved by the fourier transform to assess periodicities and trends, we assessed propriety with examples of two monthly precipitation data, annual precipitation, SOI index and SST index. The wavelet transform can effectively assess the power spectrum corresponding to frequency as maintaining chronological characteristics. The results of the analysis using the wavelet transform showed that the monthly precipitation have the strongest power spectrum near that of 1 year, and the annual precipitation represent the dominated spectrum in the band of 2-8 years. Also, the SOI index and SST index indicate the strongest power spectrum in the band of 2-8 years.

• Journal of the Chungcheong Mathematical Society
• /
• v.31 no.3
• /
• pp.325-331
• /
• 2018

In this paper, we study which transform preserves the k-hyponormality of weighted shifts. For this, we introduce a new transform, the modulus multiplication transform, and then examine various properties of it.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.51 no.12
• /
• pp.549-555
• /
• 2002

While the z-transform method is a basic mathematical tool to relate the imput/output signals only at the sampling instants in analyzing and designing sampled-data control systems, the modified z-transform which is a variation of the z-transform is widely used to represent the details of continuous signals between the sampling instants. To relate the modified z-transform to the corresponding regular z-transform, some properties were established regarding the modified z-transform method. This paper will show that these properties, in their current forms, cause come analytic problems, when they are applied to the signals with discontinuities at the sampling instants, which accordingly limit their applications significantly. In this paper, those analytic problems will be investigated, and the theorems of the modified z-transform will be revised by adopting new notations on the z-transform so that those can be correctly interpreted and used without any analytic problems. Also some additional useful schemes of applying the modified z-transform will be developed.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.498-503
• /
• 2009

As for Hadamard Transform, because the calculation time of this transform is slower than Discrete Cosine Transform (DCT) and Fast Fourier Transform (FFT), the effectiveness and the practicality are insufficient. Then, the computational complexity can be decreased by using the butterfly operation as well as FFT. We composed calculation time of FFT with that of Fast Complex Hadamard Transform by constructing the algorithm of Fast Complex Hadamard Transform. They are indirect conversions using program of complex number calculation, and immediate calculations. We compared calculation time of them with that of FFT. As a result, the reducing the calculation time of the Complex Hadamard Transform is achieved. As for the computational complexity and calculation time, the result that quadrinomial Fast Complex Hadamard Transform that don't use program of complex number calculation decrease more than FFT was obtained.

• Journal of the Semiconductor & Display Technology
• /
• v.6 no.3
• /
• pp.55-59
• /
• 2007

Wavelet Transform is amenable to efficient algorithms. So wavelet transform was adopted many signal processing and communication applications. For example, the wavelet transform was adopted as the transform for JPEG2000. However, Wavelet has weakness about smoothness along the contours and limited directional information. Hence, recently, some new transforms have been introduced to take advantage of this property. So we use to other transform, called contourlet transform in compression. In this paper, we propose a new method for image compression based on the contourlet transform, which has been recently introduced. Contourlet transform has a good result about images with smooth contours. Moreover, Contourlet is feasible multiresolution and multidirection expansion using non-separable filter bank. This treatise shows a good image representation after compressing using contourlet transform.

• The Pure and Applied Mathematics
• /
• v.31 no.2
• /
• pp.179-187
• /
• 2024

In image and signal processing, the wavelet transform is frequently employed. However, it has the drawback of having weak directionality, which has limited its use in many applications. A recent addition to the wavelet transform, the curvelet transform attempts to address crossing phenomena that occur along curved edges in 2-D images. As an extension of the wavelet transform, we discuss various curvelet transform features in this paper. There are numerous uses for the curvelet and wavelet transforms in image and signal processing.