• Title/Summary/Keyword: Fourier 변환

Search Result 898, Processing Time 0.026 seconds

A Comparison between Abel-Fourier and Digital Linear Filter Methods (Abel-Fourier법과 디지탈 선형필터법과의 비교)

  • Kim, Hee Joon
    • Economic and Environmental Geology
    • /
    • v.20 no.2
    • /
    • pp.119-123
    • /
    • 1987
  • Hankel transform of order 0 can be represented by a combination of Abel transform and Fourier transform. This Abel-Fourier method can offer computational advantages over a conventional digital linear filter method through the uses of a rapid Abel transform with shift variant recursive filter and of a fast Fourier transform. The Abel-Fourier method, however, is generally less accurate than a well-designed digital linear filter method. In geoelectrical applications, the digital linear filter method seems to be more flexible than the Abel-Fourier method.

  • PDF

Note on the generalized Fourier-Feynman transform on function space (함수공간에서의 일반화된 푸리에-파인만 변환에 관한 고찰)

  • Chang, Seung-Jun
    • Journal for History of Mathematics
    • /
    • v.20 no.3
    • /
    • pp.73-90
    • /
    • 2007
  • In this paper, we define a generalized Feynman integral and a generalized Fourier-Feynman transform on function space induced by generalized Brownian motion process. We then give existence theorems and several properties for these concepts. Finally we investigate relationships of the Fourier transform and the generalized Fourier-Feynman transform.

  • PDF

LFM Signal Separation Using Fractional Fourier Transform (Fractional Fourier 변환을 이용한 LFM 신호 분리)

  • Seok, Jongwon;Kim, Taehwan;Bae, Keunsung
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.3
    • /
    • pp.540-545
    • /
    • 2013
  • The Fractional Fourier transform, as a generalization of the classical Fourier Transform, was first introduced in quantum mechanics. Because of its simple and useful properties of Fractional Fourier transform in time-frequency plane, various research results in sonar and radar signal processing have been introduced and shown superior results to conventional method utilizing Fourier transform until now. In this paper, we applied Fractional Fourier transform to sonar signal processing to detect and separate the overlapping linear frequency modulated signals. Experimental results show that received overlapping LFM(Linear Frequency Modulation) signals can be detected and separated effectively in Fractional Fourier transform domain.

Study of robust watermarking method in medical image (의료영상에서의 강인한 워터마킹 기법에 관한 연구)

  • 남기철;박무훈
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2003.05a
    • /
    • pp.255-258
    • /
    • 2003
  • Recently, Digital Watermarking is used to authenticate data and to determine whether the data are distorted or not in medical images which is digitalized. The Fourier Mellin method using the Fourier Transform and the Log-Polar coordinate transform gets an invariant feature for RST distortion in images. But there are several problems in the real materialization. Interpolation of the image value should be considered according to the pixel position and so a watermark loss, original image distortion, numerical approximation is happened. Therefore there should be solved to realization of the Fourier Mellin method. Using the Look up table, there reduce the data loss caused by the conversion between Rectangular and Polar coordinate. After diagnose, medical images are transformed the Polar coordinate and taken the Discrete Fourier transform in the center of ROI region. Maintaining the symmetry in Fourier magnitude coefficient, the gaussian distributed random vectors and binary images are embedded in medical images.

  • PDF

Understanding of Fourier Transformation by Comparison of program results (프로그램의 결과 비교를 통한 푸리에 변환의 이해)

  • Yang, Seung-Yong;Kim, Nohyu;Lee, Jeonghoon
    • The Journal of Korean Institute for Practical Engineering Education
    • /
    • v.2 no.2
    • /
    • pp.36-41
    • /
    • 2010
  • Many references are available in the area of Fourier transformation. But some differences are found in the mathematical expressions provided in the references. These circumstances prohibit beginners from understanding and using Fourier transformation method. In this paper, relating mathematical expressions are epitomized and some numerical results are compared and interpreted to understand Fourier transformation. Fourier transformation results are displayed for representative input signals and some characteristics are summarized.

  • PDF

Fourier Transformations (TEM 관련 이론해설 (2): Fourier 변환)

  • Lee, Hwack-Joo
    • Applied Microscopy
    • /
    • v.32 no.3
    • /
    • pp.195-204
    • /
    • 2002
  • In this review, the fundamental concepts of delta function, convolution integral and Fourier transformation are discussed. The applications of Fourier transformation to slit function, two very narrow slits, two slits of appreciable width, periodic array of narrow slits, arbitary periodic function, diffraction gratings and gaussian functions are also introduced.

A Study of the discrete for Numerical Approximation Functions by Fourier transform (Fourier 변환을 이용한 수치 근사 함수의 이산화에 관한 연구)

  • Song, Eun-Jee
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2003.05a
    • /
    • pp.367-370
    • /
    • 2003
  • 과학자나 공학자들은 빛이나 소리와 같이 주기적인 특성을 갖는 현상을 연구하는 경우가 많다. Fourier 변환은 이러한 주기함수의 근사 함수를 구할 때 유용하게 이용되고 있다. 본 논문에서는 극좌표 표현되는 함수의 근사 함수를 구하는 문제를 다룬다 일반적으로 컴퓨터 상에 구현하기 위해서는 이산형 Fourier 급수전개를 이용하는데 지금까지는 근사 함수를 컴퓨터 상에서 구할 때 이산화 표본수를 경험에 의해 임의로 결정하여 이용하였으나 본 연구에서는 Fourier 변환의 성질을 이용하여 주어진 함수에 따라 필요한 이산화 표본 수를 자동적으로 결정하는 알고리즘을 제안한다.

  • PDF

Study of Radix-3 FFT (Radix-3 FFT에 관한 고찰)

  • Jung, Hae-Seung
    • Aerospace Engineering and Technology
    • /
    • v.9 no.1
    • /
    • pp.98-105
    • /
    • 2010
  • Fast Fourier Transform is the fast implementation of Discrete Fourier Transform, which deletes periodic operation of DFT. According to the definition, radix-2 FFT can be implemented byre cursive call which divides the input signal points into 2 signal points. Because of its time-consuming stack-copy operation, this recursive method is very slow. To overcome this drawback, butterfly operation with signal rearrangement was devised. Based on the ideas of signal rearrangement and butterfly operation, this paper applies the signal rearrangement method to the Radix-3 FFT and checks the validity of this method.

Feature Extraction in 3-Dimensional Object with Closed-surface using Fourier Transform (Fourier Transform을 이용한 3차원 폐곡면 객체의 특징 벡터 추출)

  • 이준복;김문화;장동식
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.4 no.3
    • /
    • pp.21-26
    • /
    • 2003
  • A new method to realize 3-dimensional object pattern recognition system using Fourier-based feature extractor has been proposed. The procedure to obtain the invariant feature vector is as follows ; A closed surface is generated by tracing the surface of object using the 3-dimensional polar coordinate. The centroidal distances between object's geometrical center and each closed surface points are calculated. The distance vector is translation invariant. The distance vector is normalized, so the result is scale invariant. The Fourier spectrum of each normalized distance vector is calculated, and the spectrum is rotation invariant. The Fourier-based feature generating from above procedure completely eliminates the effect of variations in translation, scale, and rotation of 3-dimensional object with closed-surface. The experimental results show that the proposed method has a high accuracy.

  • PDF

Cover song search based on magnitude and phase of the 2D Fourier transform (이차원 퓨리에 변환의 크기와 위상을 이용한 커버곡 검색)

  • Seo, Jin Soo
    • The Journal of the Acoustical Society of Korea
    • /
    • v.37 no.6
    • /
    • pp.518-524
    • /
    • 2018
  • The cover song refers to live recordings or reproduced albums. This paper studies two-dimensional Fourier transform as a feature-dimension reduction method to search cover song fast. The two-dimensional Fourier transform is conducive in feature-dimension reduction for cover song search due to musical-key invariance. This paper extends the previous work, which only utilize the magnitude of the Fourier transform, by introducing an invariant from phase based on the assumption that adjacent frames have the same musical-key change. We compare the cover song retrieval accuracy of the Fourier-transform based methods over two datasets. The experimental results show that the addition of the invariant from phase improves the cover song retrieval accuracy over the previous magnitude-only method.