• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.524-527
• /
• 2005

A society has progressed rapidly toward the highly advanced digital information age. However, noise is generated by several causes, when signal is processed. Therefore, methods for eliminating those noises have researched. There were the existing FFT(fast fourier transform) and STFT(short time fourier transform) for removing noise but it's impossible to know information about time and time-frequency localization capabilities have conflictive relationship. Therefore, for overcoming these limits, wavelet-based denoising methods that are capable of multiresolution analysis are applied to the signal processing field. However, existing threshold- and correlation-based denoising methods consider only statistical characteristics for noise, accordingly a lot of noise is acceptable as an edge and are impossible to remove AWGN and impulse noise, at the same time. Hence, in this paper we proposed wavelet-based new denoising algorithm and compared existing methods with it.

• 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.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.7
• /
• pp.1672-1686
• /
• 2013

In this paper, we propose a hybrid super-resolution algorithm robust to cut-change. Existing single-frame based super-resolution algorithms are usually fast, but quantity of information for interpolation is limited. Although the existing multi-frame based super-resolution algorithms generally robust to this problem, the performance of algorithm strongly depends on motions of input video. Furthemore at boundary of cut, applying of the algorithm is limited. In the proposed method, we detect a define boundary of cut using cut-detection algorithm. Then we adaptively apply a single-frame based super-resolution method to detected cut. Additionally, we propose algorithms of normalizing motion vector and analyzing pattern of edge to solve various problems of existing super-resolution algorithms. The experimental results show that the proposed algorithm has better performance than other conventional interpolation methods.

• Journal of Korea Multimedia Society
• /
• v.10 no.10
• /
• pp.1271-1283
• /
• 2007

To detect defect of FPD(flat panel displays) is very difficult due to uneven illumination on FPD panel image. This paper presents a method to detect various types of defects using the approximated image of the uneven illumination by B-spline. To construct a approximated surface, corresponding to uneven illumination background intensity, while reducing random noises and small defect signal, only the lowest smooth subband is used by wavelet decomposition, resulting in reducing the computation time of taking B-spline approximation and enhancing detection accuracy. The approximated image in lowest LL subband is expanded as the same size as original one by wavelet reconstruction, and the difference between original image and reconstructed one becomes a flat image of compensating the uneven illumination background. A simple binary thresholding is then used to separate the defective regions from the subtracted image. Finally, blob analysis as post-processing is carried out to get rid of false defects. For applying in-line system, the wavelet transform by lifting based fast algorithm is implemented to deal with a huge size data such as film and the processing time is highly reduced.

• 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.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.53 no.4
• /
• pp.293-299
• /
• 2004

This paper is about the extraction of basis function for ECG signal processing. In the first step, it is assumed that ECG signal consists of linearly mixed independent source signals. 12 channel ECG signals, which were sampled at 600sps, were used and the basis function, which can separate and detect source signals - QRS complex, P and T waves, - was found by applying the fast fixed point algorithm, which is one of learning algorithms in independent component analysis(ICA). The possibilities of significant point detection and classification of normal and abnormal ECG, using the basis function, were suggested. Finally, the proposed method showed that it could overcome the difficulty in separating specific frequency in ECG signal processing by wavelet transform. And, it was found that independent component analysis(ICA) could be applied to ECG signal processing for detection of significant points and classification of abnormal beats.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10c
• /
• pp.514-516
• /
• 2003

현재 많은 제조 업체들이 장비를 운영하는 중에 장비의 수명이나 이상으로 인한 고장으로 전체 작업 공정이 중단되어 큰 손실은 입은 많은 사례를 가지고 있다. 본 논문에서는 이러한 피해를 조금이나마 줄여 보고자 장비의 상태를 모니터링 및 분석하여 장비의 교체 시기 및 고장 의심 부분을 사용자에게 미리 알려주는 분석 툴을 설계한다. 실제 장비의 적용 대상은 현대중공업 LNG 선박 제조의 크레인 전동기를 대상으로 하였다. 특히, 크레인에서 가장 중요하다고 할 수 있는 전동기의 진동 데이터를 파형(Wavelet)화 하고, 이것을 FFT(Fast Fourier Transform) 변환하여 이 두 형태를 분석해서 전동기의 이상 징후를 발견하는데 초점을 맞추었다. 향후 이러한 적용 사례를 활용하게 되면, 고가 장비의 갑작스러운 고장으로 인한 제조업체의 손실을 조금이라도 줄일 수 있을 것으로 본다.

• IEIE Transactions on Smart Processing and Computing
• /
• v.3 no.2
• /
• pp.41-51
• /
• 2014

This paper describes a method to estimate the noise power using the minimum statistics approach, which was originally proposed for audio processing. The proposed minimum statistics-based method separates a noisy image into multiple frequency bands using the three-level discrete wavelet transform. By assuming that the output of the high-pass filter contains both signal detail and noise, the proposed algorithm extracts the region of pure noise from the high frequency band using an appropriate threshold. The region of pure noise, which is free from the signal detail part and the DC component, is well suited for minimum statistics condition, where the noise power can be extracted easily. The proposed algorithm reduces the computational load significantly through the use of a simple processing architecture without iteration with an estimation accuracy greater than 90% for strong noise at 0 to 40dB SNR of the input image. Furthermore, the well restored image can be obtained using the estimated noise power information in parametric image restoration algorithms, such as the classical parametric Wiener or ForWaRD image restoration filters. The experimental results show that the proposed algorithm can estimate the noise power accurately, and is particularly suitable for fast, low-cost image restoration or enhancement applications.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.12
• /
• pp.2520-2528
• /
• 2009

In this paper, we proposed tracking detection methodology using information granulation-based fuzzy radial basis function neural networks (IG-FRBFNN). According to IEC 60112, tracking device is manufactured and utilized for experiment. We consider 12 features that can be used to decide whether tracking phenomenon happened or not. These features are considered by signal processing methods such as filtering, Fast Fourier Transform(FFT) and Wavelet. Such some effective features are used as the inputs of the IG-FRBFNN, the tracking phenomenon is confirmed by using the IG-FRBFNN. The learning of the premise and the consequent part of rules in the IG-FRBFNN is carried out by Fuzzy C-Means (FCM) clustering algorithm and weighted least squares method (WLSE), respectively. Also, Hierarchical Fair Competition-based Parallel Genetic Algorithm (HFC-PGA) is exploited to optimize the IG-FRBFNN. Effective features to be selected and the number of fuzzy rules, the order of polynomial of fuzzy rules, the fuzzification coefficient used in FCM are optimized by the HFC-PGA. Tracking inference engine is implemented by using the LabVIEW and loaded into embedded system. We show the superb performance and feasibility of the tracking detection system through some experiments.

• Journal of Electrical Engineering and Technology
• /
• v.12 no.3
• /
• pp.1016-1026
• /
• 2017

An adaptive extended Kalman filter based on the maximum likelihood (EKF-ML) is proposed for detecting voltage sag in this paper. Considering that the choice of the process and measurement error covariance matrices affects seriously the performance of the extended Kalman filter (EKF), the EKF-ML method uses the maximum likelihood method to adaptively optimize the error covariance matrices and the initial conditions. This can ensure that the EKF has better accuracy and faster convergence for estimating the voltage amplitude (states). Moreover, without more complexity, the EKF-ML algorithm is almost as simple as the conventional EKF, but it has better anti-disturbance performance and more accuracy in detection of the voltage sag. More importantly, the EKF-ML algorithm is capable of accurately estimating the noise parameters and is robust against various noise levels. Simulation results show that the proposed method performs with a fast dynamic and tracking response, when voltage signals contain harmonics or a pulse and are jointly embedded in an unknown measurement noise.