• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.4C
• /
• pp.397-405
• /
• 2003

In this paper, we propose an efficient motion estimation algorithm which can reduce computational complexity by using characteristics of wavelet coefficient in each subband while keeping about the same image quality as in using MRME(multiresolution motion estimation). In general, because of the high similarity between consecutive frames, we first decide whether the motion exists or not by just comparing MAD(mean absolute difference) between blocks with threshold in the lowest subbands of consecutive two frames. If it turns out that there is no motion in the lowest subband, we can also decide no motion exists in the higher subband. This is due to the characteristics of wavelet transform. Conversely, if we find any motion in the lowest subband, we can reduce computational complexity by estimating high subband motion vectors selectively according to the amount of computational complexity by estimating high subband motion vectors selectively according to the amount of energy in that subband. Experimental results are shown that algorithm suggested in this paper maintains about the same PSNR as MRME. However, the processing time was reduced about 30-50% compared with the MRME.

• The KIPS Transactions:PartB
• /
• v.11B no.2
• /
• pp.177-186
• /
• 2004

It is a weak point of the motion estimation technique for video compression that the predicted video encoding algorithm requires higher-order computational complexity. To reduce the computational complexity of encoding algorithms, researchers introduced techniques such as 3D-WT that don't require motion prediction. One of the weakest points of previous 3D-WT studies is that they require too much memory for encoding and too long delay for decoding. In this paper, we propose a technique called `FS (Fast playable and Scalable) 3D-WT' This technique uses a modified Haar wavelet transform algorithm and employs improved encoding algorithm for lower memory and shorter delay requirement. We have executed some tests to compare performance of FS 3D-WT and 3D-V. FS 3D-WT has exhibited the same high compression rate and the same short processing delay as 3D-V has.

• Proceedings of the KAIS Fall Conference
• /
• 2011.05a
• /
• pp.421-424
• /
• 2011

As the demand of the high-speed transmission between fast moving mobile objects is increasing, more ideas are coming out to improve the channel distortion for such cases. WOFDM(Wavelet-based Orthogonal Frequency Division Multiplexing) is the most brilliant one among them, which combines the advantages of wavelet transform technique and OFDM technique, and it has been implemented into the PLC (Power Line communication) system. In this paper, we are trying to describe a comparative study on COFDM (Fourier-base OFDM) and WOFDM in the conventional T-DMB system. From the simulation results, we can see that the performances of COFDM and WOFDM are nearly same under the AWGN channel. However, WOFDM outperforms COFDM under the time-invariant Rayleigh fading channel.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.2
• /
• pp.87-95
• /
• 2002

In this paper, we proposed a fast multi-resolution motion estimation(MRME) algorithm. This algorithm exploits the half-pixel accuracy motion estimation(HPAME) for exact motion vectors in the baseband and block classification for the reduction of bit amounts and computational loads. Generally, as the motion vector in the baseband are used as initial motion vector in the high frequency subbands, it has crucial effect on quality of the motion compensated image. For this reason, we exploit HPAME in the motion estimation for the baseband. But HPAME requires additional bit and computational loads so that we use block classification for the selective motion estimation in the high frequency subbands to compensate these problems. In result, we could reduce the bit rate and computational load at the similar image quality with conventional MRME. The superiority of the proposed algorithm was confirmed by the computer simulation.

• Journal of Broadcast Engineering
• /
• v.17 no.2
• /
• pp.374-387
• /
• 2012

In this paper, we implement a new hardware for finding the significant coefficients of a digital hologram and ciphering them using discrete wavelet packet transform (DWPT). Discrete wavelet transform (DWT) and packetization of subbands is used, and the adopted ciphering technique can encrypt the subbands with various robustness based on the level of the wavelet transform and the threshold of subband energy. The hologram encryption consists of two parts; the first is to process DWPT, and the second is to encrypt the coefficients. We propose a lifting based hardware architecture for fast DWPT and block ciphering system with multi-mode for the various types of encryption. The unit cell which calculates the repeated arithmetic with the same structure is proposed and then it is expanded to the lifting kernel hardware. The block ciphering system is configured with three block cipher, AES, SEED and 3DES and encrypt and decrypt data with minimal latency time(minimum 128 clocks, maximum 256 clock) in real time. The information of a digital hologram can be hided by encrypting 0.032% data of all. The implemented hardware used about 200K gates in $0.25{\mu}m$ CMOS library and was stably operated with 165MHz clock frequency in timing simulation.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 2001.11a
• /
• pp.464-468
• /
• 2001

In this paper, we propose a robust watermarking technique that accepts time scaling, pitch shift, add noise and a lot of lossy compression such as MP3, AAC, WMA. The technique is developed based on digital filtering. Being designed according to critical band of HAS (human auditory system), the digital filters nearly affect audio quality. Furthermore, before implementing digital filtering, wavelet transform decomposes the audio signal into several signals that is composed of specific frequencies. Designed digital filters scan the decomposed signal. The designed digital filter, band-stop filter, distorts and eliminates specific frequencies of audio signals. Watermarking detection can be accomplished by FFT (Fast Fourier Transform). Firstly, segments of audio signal are transformed by FFT. Then, the obtained amplitude spectrum by FFT is summed repeatedly. Finally the watermark detector can find filters used to watermark encoding based on eliminating frequencies. The suggested technique can embed 4bits/s in a robust manner.

• Proceedings of the KSME Conference
• /
• 2008.11a
• /
• pp.938-942
• /
• 2008

To detect the failures in machine, the signals of current, vibration and acoustic emission are widely used in industry. And unexpected failures of gears are not only extremely damaging but also lead to economic losses. In this paper, to detect the misalignment occurred at between two gears in gearboxes, the signals of current, vibration and AE were measured at gearbox and motor power line. FFT(Fast Fourier Transform) was used for current and vibration signal analysis to find gear failure frequency. Especially, the envelop analysis and wavelet transform were applied for AE signal. Therefore, compared with the results of three kinds of signal, the possibility of earily detection by AE is identified or checked.

• The KSFM Journal of Fluid Machinery
• /
• v.15 no.6
• /
• pp.31-38
• /
• 2012

Rotor of rotating machinery is the highly damaged part. Fault of 7 different types was confirmed as the main causes of rotor damage from the pump failure history data in domestic and U.S. nuclear. For each fault types, simulation testing was performed and fault signals were collected form the sensors. To calculate the statistical parameters of time-domain & frequency-domain, measured signals were analyzed by using the discrete wavelet transform, fast fourier transform, statistical analysis. Total 84 parameters were obtained. And Effectiveness factor were used to evaluate the discrimination capacity of each parameter. From the effectiveness factor, RAW-P4/RAW-P7/WT2-NNL/WT2-EE/WT1-P1 showed high ranking. Finally, these parameters were selected as the feature parameters of intelligent fault diagnostics for rotor.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.11
• /
• pp.1285-1295
• /
• 1999

본 논문은 방대한 크기의 볼륨 데이타를 효율적으로 렌더링하기 위한 셀 기반 웨이브릿 압축 방법을 제시한다. 이 방법은 볼륨을 작은 크기의 셀로 나누고, 셀 단위로 웨이브릿 변환을 한 다음 복원 순서에 따른 런-길이(run-length) 인코딩을 수행하여 높은 압축율과 빠른 복원을 제공한다. 또한 최근 복원 정보를 캐쉬 자료 구조에 효율적으로 저장하여 복원 시간을 단축시키고, 에러 임계치의 정규화로 비정규화된 웨이브릿 압축보다 빠른 속도로 정규화된 압축과 같은 고화질의 이미지를 생성하였다. 본 연구의 성능을 평가하기 위하여 {{}} 해상도의 볼륨 데이타를 압축하여 쉬어-？ 분해(shear-warp factorization) 알고리즘에 적용한 결과, 손상이 거의 없는 상태로 약 27:1의 압축율이 얻어졌고, 약 3초의 렌더링 시간이 걸렸다.Abstract This paper presents an efficient cell-based wavelet compression method of large volume data. Volume data is divided into individual cell of {{}} voxels, and then wavelet transform is applied to each cell. The transformed cell is run-length encoded according to the reconstruction order resulting in a fairly good compression ratio and fast reconstruction. A cache structure is used to speed up the process of reconstruction and a threshold normalization scheme is presented to produce a higher quality rendered image. We have combined our compression method with shear-warp factorization, which is an accelerated volume rendering algorithm. Experimental results show the space requirement to be about 27:1 and the rendering time to be about 3 seconds for {{}} data sets while preserving the quality of an image as like as using original data.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.4
• /
• pp.335-343
• /
• 2001

The conventional wavelet-based fractal image coding has the disadvantage that the encoding takes a long time, since each range block finds the best domain in the image. In this Paper, we propose wavelet-based fractal image coding using SAS(Self Affine System) method and multi-scale factor. It consists of the range and domain blocks in DWT(discrete wavelet transform) region. Using SAS method, the proposed method is that the searching process of the domain block is not required, and the range block selects the domain which is relatively located the same position in the upper level. The proposed method can perform a fast encoding by reducing the computational complexity in the encoding process. In order to improve the disadvantage of SAS method which is reduced image qualify, the proposed method is improved image qualify using the different scale factors for each level. As a result, there is not influence on an image quality, the proposed method is enhanced the encoding time and compression ratio, and it is able to the progressive transmission.