• 한국통신학회논문지
• /
• 제11권3호
• /
• pp.197-203
• /
• 1986

아날로그 映像信號를 디지털 變換하여 마이크로컴퓨터에 入力시킨 다음 變換符號化(trarm coding)를 遂行하였다. 入力 및 處理 時에 遂行時間을 短縮시키는 것을 目的으로 하여 64$\times$64화소로 信號를 滅縮하고 外部메모리를 內部메모리의 番地로 對替시키는 것으로써 빠른 入出力 方法을 채택하였다. Hadamard 直交 變換과 中央에 weight를 준 weighted hadamard變換 그리고 haar 變換을 assembly言語의 高速計算 알고리즘으로 프로그램하여 一秒 이내에 變換終了할 수 있도록 하였으며 各 變換을 比較하였다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 신호처리소사이어티 추계학술대회 논문집
• /
• pp.473-476
• /
• 2003

We suggest 2 dimensional Fast Fourier Transform using Polynomial Transform and integer Fast Fourier Transform. Unlike conventional 2D-FFT using the direct quantization of twiddle factor, the suggested 2D-FFT adopts implemented by the lifting so that the suggested 2D-FFT is power adaptable and reversible. Since the suggested FFT performg integer-to-integer mapping, the transform can be implemented by only bit shifts and auditions without multiplications. In addition. polynomial transform severely reduces the multiplications of 2D-FFT. While preserving the reversibility, complexity of this algorithm is shown to be much lower than that of any other algorithms in terms of the numbers of additions and shifts.

• 전자공학회논문지D
• /
• 제34D권11호
• /
• pp.64-69
• /
• 1997

We have shown that the Hough transform filter can be easily obtained by repeatedly recording one line segment pattern holographically by use of rotational multiplexing. With this filter, one can get resutls of the hough transform in the time of light propagation. To demonstrate our method experimentally, the hough transform filter for 18 different rottion angles was recorded, and experimental transform results were compared with simulated ones for a few input patterns. By introducing a compensation process for the non-uniformity of both the input plane wav eand the diffraction efficiency of each hologram. It is possible to get more precise transform results.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 1997년도 추계학술대회 논문집
• /
• pp.500-503
• /
• 1997

In this paper, a method for recognizing 3-D objects using the 3-D Hough transform and the robust stereo vision is studied. A 3-D object is recognized through two steps; modeling step and matching step. In modeling step, features of the object are extracted by analyzing the IGES file. In matching step, the values of the sensed image are compared with those of the IGES file which is assumed to location and orientation in the 3-D Hough transform domain. Since we use the 3-D Hough transform domain of the input image directly, the sensitivity to the noise and the high computational complexity could be significantly allcv~ated. Also, the cost efficiency is improved using the robust stereo vision for obtaining depth map image which is needed for 3-D Hough transform. In order lo verify the proposed method, real telephone model is recognized. Thc results of the location and orientation of the model are presented.

• 한국마린엔지니어링학회:학술대회논문집
• /
• 한국마린엔지니어링학회 2002년도 춘계학술대회논문집
• /
• pp.219-223
• /
• 2002

Voltage and current signals during impulse tests on transformer are treated as non-stationary signals. A new method incorporating signal-processing method such as Wavelets and courier transform is proposed for failure identification. It is now possible to distinguish failure during impulse tests. The method is experimentally validated on a transformer winding. The wavelet transforms enables the detection of the time of occurrence of switching or failure events. After establishing the time of occurrence, the original waveform is split into two or more sections. The wavelet transform has ability to analysis the failure signal on time domain as well as frequency domain. Therefore, the wavelet transform is superior than courier transform to analysis the failure signal. In this paper, the fact was proved by real data which was achieved.

• 대한기계학회논문집A
• /
• 제24권10호
• /
• pp.2560-2567
• /
• 2000

When spatially dense velocity distribution is measured by a scanning laser Doppler vibrometer, the Fourier transform method provides the real and imaginary parts of the mode shapes in the form of a polynomial. However the Fourier transform method is often impractical because the independent decomposition property of cosine and sine components into real and imaginary parts, respectively, does not hold due to the leakage problem which commonly occurs in the Fourier transform of harmonic signals. To deal with this problem, a Hilbert transform method is newly proposed in this article. The proposed method is free from the leakage problem and relatively robust to the scanning error. A simulation example is provided to verify the effectiveness of this method.

• 한국수학사학회지
• /
• 제20권3호
• /
• pp.73-90
• /
• 2007

본 논문은 일반화된 브라운 확률과정으로 유도된 함수공간에서 정의되는 일반화된 파인만 적분과 일반화된 푸리에-파인만 변환을 소개하고, 이들의 존재정리 및 여러 가지 성질을 설명한다. 그리고 푸리에 변환과 일반화된 해석적 푸리에-파인만 변환의 유사성을 조사한다.

• 한국소음진동공학회:학술대회논문집
• /
• 한국소음진동공학회 2000년도 춘계학술대회논문집
• /
• pp.724-730
• /
• 2000

Although there have been many investigations employing the continuous wavelet transform for the analysis of dispersive waves, they seem to lack theoretical justifications for the effectiveness of the continuous wavelet transform over other time-frequency analysis tools such as the short-time Fourier transform. The goal of this paper is to answer this question by investigating theoretically the performance of the continuous wavelet transform and the short-time Fourier transform in tracing rapidly time-varying flexural waves. As a specific example, the performance of the two transforms is compared in a problem dealing with flexural waves generated by an impact in a solid circular cylinder.

• 제어로봇시스템학회논문지
• /
• 제6권5호
• /
• pp.390-395
• /
• 2000

We present a fingerprint identification algorithm using the wavelet transform and correlation. The wavelet transform is used because of its simple operation to extract fingerprint minutiaes features for fingerprint classification. We perform the rowwise 1-D wavelet transform for a $256\times256$ fingerprint image to get a $1\times256$ column vector using the Haar wavelet and repeat 1-D wavelet transform for a 1$\times$256 column vector to get a $1\times4$ feature vector. Using PNN(Probabilistic Neural Network), we select the possible candidates from the stored feature vectors for fingerprint images. For those candidates, we compute the correlation between the input binary image and the target binary image to find the most similar fingerprint image. The proposed algorithm may be the key to a low cost fingerprint identification system that can be operated on a small computer because it does not need a large memory size and much computation.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2000년도 춘계학술대회논문집A
• /
• pp.420-425
• /
• 2000

When spatially dense velocity distribution is measured by a scanning laser Doppler vibrometer, the Fourier transform method provides the real and imaginary parts of the mode shapes in the form of a polynomial. However the Fourier transform method is often impractical because the independent decomposition property of cosine and sine components into real and imaginary parts, respectively, does not hold due to the leakage problem which commonly occurs in the Fourier transform of harmonic signals. To deal with this problem, a Hilbert transform method is newly proposed in this article. The proposed method is free from the leakage problem and relatively robust to tire scanning error. A simulation example is provided to verify the effectiveness of this method.