• Title/Summary/Keyword: fourier

Search Result 4,993, Processing Time 0.033 seconds

ANALYTIC FOURIER-FEYNMAN TRANSFORM AND CONVOLUTION OF FUNCTIONALS IN A GENERALIZED FRESNEL CLASS

  • Kim, Byoung Soo;Song, Teuk Seob;Yoo, Il
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.22 no.3
    • /
    • pp.481-495
    • /
    • 2009
  • Huffman, Park and Skoug introduced various results for the $L_{p}$ analytic Fourier-Feynman transform and the convolution for functionals on classical Wiener space which belong to some Banach algebra $\mathcal{S}$ introduced by Cameron and Storvick. Also Chang, Kim and Yoo extended the above results to an abstract Wiener space for functionals in the Fresnel class $\mathcal{F}(B)$ which corresponds to $\mathcal{S}$. Moreover they introduced the $L_{p}$ analytic Fourier-Feynman transform for functionals on a product abstract Wiener space and then established the above results for functionals in the generalized Fresnel class $\mathcal{F}_{A1,A2}$ containing $\mathcal{F}(B)$. In this paper, we investigate more generalized relationships, between the Fourier-Feynman transform and the convolution product for functionals in $\mathcal{F}_{A1,A2}$, than the above results.

  • PDF

Design of diffractive pattern elements using two-stage iterative Fourier transform algorithm (2 단계 iterative Fourier transform 알고리즘을 이용한 회절 무늬 소자의 설계에 관한 연구)

  • 정필호;조두진
    • Proceedings of the Optical Society of Korea Conference
    • /
    • 2000.02a
    • /
    • pp.296-297
    • /
    • 2000
  • 프라운호퍼 회절에 의하여 주어진 세기 무늬를 발생시키는 회절광학소자(Diffractive Optical Element, DOE)는 회절무늬소자, 키노폼(kinoform), 컴퓨터 푸리에 홀로그램 (computer-generated Fourier hologram) 등으로 불리우며, 광정보처리, 광연결, 레이저가공에서 중요한 역할을 한다. 이 소자를 설계하는 매우 다양한 방법들이 제안되었는데, iterative Fourier transform 알고리즘(IFTA)과 이를 변형한 알고리즘들이 가장 널리 사용된다. IFTA는 fast Fourier transform(FFT)를 활용하므로 계산시간이 절감되지만 국소 최소점에 고착되는 stagnation문제가 있어 이를 해결하기 위한 많은 변형된 알고리즘들이 제안되었다. 본 연구에서는 최근에 제안한 new Pnoise algorithm with hybrid input-output algorithm(NPA-HIOA)$^{(1)}$ 의 설계 성능을 IFTA, hybrid input-output 알고리즘(HIOA), new Pnoise 알고리즘(NPA)$^{(2)}$ , Nonlinear Least-Square (NLS)$^{(3)}$ 등의 기존의 알고리즘들과 비교하고자 한다. (중략)

  • PDF

GENERALIZED FOURIER-WIENER FUNCTION SPACE TRANSFORMS

  • Chang, Seung-Jun;Chung, Hyun-Soo
    • Journal of the Korean Mathematical Society
    • /
    • v.46 no.2
    • /
    • pp.327-345
    • /
    • 2009
  • In this paper, we define generalized Fourier-Hermite functionals on a function space $C_{a,b}[0,\;T]$ to obtain a complete orthonormal set in $L_2(C_{a,b}[0,\;T])$ where $C_{a,b}[0,\;T]$ is a very general function space. We then proceed to give a necessary and sufficient condition that a functional F in $L_2(C_{a,b}[0,\;T])$ has a generalized Fourier-Wiener function space transform ${\cal{F}}_{\sqrt{2},i}(F)$ also belonging to $L_2(C_{a,b}[0,\;T])$.

A Study of Log-Fourier Deconvolution

  • Ja Yong Koo;Hyun Suk Park
    • Communications for Statistical Applications and Methods
    • /
    • v.4 no.3
    • /
    • pp.833-845
    • /
    • 1997
  • Fourier expansion is considered for the deconvolution problem of estimating a probability density function when the sample observations are contaminated with random noise. In the log-Fourier method of density estimation for data without noise, the logarithm of the unknown density function is approximated by a trigonometric function, the unknown parameters of which are estimated by maximum likelihood. The log-Fourier density estimation method, which has been considered theoretically by Koo and Chung (1997), is studied for the finite-sample case with noise. Numerical examples using simulated data are given to show the performance of the log-Fourier deconvolution.

  • PDF

Improvement of iterative fourier transform algorithm (Iterative Fourier transform algorithm의 개선)

  • 정재완;이승걸
    • Korean Journal of Optics and Photonics
    • /
    • v.9 no.6
    • /
    • pp.390-395
    • /
    • 1998
  • Iterative Fourier transform algorithm (IFTA) was utilized for the phase retrieval problem or the optimal of the IFTA depends strongly on the selection of initial phase value. In this paper, we proposed the modified interactive Fourier transform algorithm in order to improve the convergence speed of error and the stability of convergence. The modified IFTA was reduced number of iteration about 30% than existing IFTA with the image size of 128$\times$128 pixel.

  • PDF

A Comparative Study between Green's Function Method and Fourier Transform Method in Determining Thermal Wave Characteristics (열전도파 특성을 위한 Green's 함수법과 Fourier 변환법의 비교 연구)

  • Park, S.K.;Lee, Y.H.;Lim, J.H.
    • Journal of Power System Engineering
    • /
    • v.4 no.4
    • /
    • pp.16-24
    • /
    • 2000
  • 고체내의 열에너지의 전달을 분석하기 위하여 고전적인 Fourier 열전도 법칙과 에너지 보존식에서 유도되는 열전도 방정식을 사용해 왔다. 이러한 열전도 방정식은 열전도가 무한한 속도로 진행된다는 것을 의미하고 있다. 그러나 극저온상태에서나 매우 급속한 열전도과정 중 매우 짧은 시간의 상태에서 non-Fourier 모델에 기초를 둔 쌍곡선형 열전도 방정식이 도입되었다. 최근의 이에 관한 연구에서 열전도가 파장의 형태로 유한한 전파속도를 갖는다는 것이 실험적으로 증명되었고 이로부터 여러 가지 실험적인 해석과 이론 해석이 전개되었다. 본 논문에서는 열전파 속도의 유한한 성질을 나타내는 수정된 열전도 법칙을 이용하여 1차원 평판에 대하여 공간에 대한 finite Fourier 변환 방법과 Green 함수 방법으로 해석하여 열전도파의 파동 성질, 공진 현상 및 위상차를 고찰하고자 한다. 열전도파가 갖는 모달 주파수에 대해 임계값을 갖으며 이 임계값을 초과할 때 공진 현상과 위상차를 고찰할 수 있었다.

  • PDF

Research on Multiple-image Encryption Scheme Based on Fourier Transform and Ghost Imaging Algorithm

  • Zhang, Leihong;Yuan, Xiao;Zhang, Dawei;Chen, Jian
    • Current Optics and Photonics
    • /
    • v.2 no.4
    • /
    • pp.315-323
    • /
    • 2018
  • A new multiple-image encryption scheme that is based on a compressive ghost imaging concept along with a Fourier transform sampling principle has been proposed. This further improves the security of the scheme. The scheme adopts a Fourier transform to sample the original multiple-image information respectively, utilizing the centrosymmetric conjugation property of the spatial spectrum of the images to obtain each Fourier coefficient in the most abundant spatial frequency band. Based on this sampling principle, the multiple images to be encrypted are grouped into a combined image, and then the compressive ghost imaging algorithm is used to improve the security, which reduces the amount of information transmission and improves the information transmission rate. Due to the presence of the compressive sensing algorithm, the scheme improves the accuracy of image reconstruction.

Time-Frequency Analysis of Electrohysterogram for Classification of Term and Preterm Birth

  • Ryu, Jiwoo;Park, Cheolsoo
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.4 no.2
    • /
    • pp.103-109
    • /
    • 2015
  • In this paper, a novel method for the classification of term and preterm birth is proposed based on time-frequency analysis of electrohysterogram (EHG) using multivariate empirical mode decomposition (MEMD). EHG is a promising study for preterm birth prediction, because it is low-cost and accurate compared to other preterm birth prediction methods, such as tocodynamometry (TOCO). Previous studies on preterm birth prediction applied prefilterings based on Fourier analysis of an EHG, followed by feature extraction and classification, even though Fourier analysis is suboptimal to biomedical signals, such as EHG, because of its nonlinearity and nonstationarity. Therefore, the proposed method applies prefiltering based on MEMD instead of Fourier-based prefilters before extracting the sample entropy feature and classifying the term and preterm birth groups. For the evaluation, the Physionet term-preterm EHG database was used where the proposed method and Fourier prefiltering-based method were adopted for comparative study. The result showed that the area under curve (AUC) of the receiver operating characteristic (ROC) was increased by 0.0351 when MEMD was used instead of the Fourier-based prefilter.

Shape Recognition and Classification Based on Poisson Equation- Fourier-Mellin Moment Descriptor

  • Zou, Jian-Cheng;Ke, Nan-Nan;Lu, Yan
    • International Journal of CAD/CAM
    • /
    • v.8 no.1
    • /
    • pp.69-72
    • /
    • 2009
  • In this paper, we present a new shape descriptor, which is named Poisson equation-Fourier-Mellin moment Descriptor. We solve the Poisson equation in the shape area, and use the solution to get feature function, which are then integrated using Fourier-Mellin moment to represent the shape. This method develops the Poisson equation-geometric moment Descriptor proposed by Lena Gorelick, and keeps both advantages of Poisson equation-geometric moment and Fourier-Mellin moment. It is proved better than Poisson equation-geometric moment Descriptor in shape recognition and classification experiments.

Transient Analysis of Magnetodynamic Systems Using Fourier Transform and Frequency Sensitivity (푸리에 변환과 주파수 민감도를 이용한 시변자장 시스템에서의 과도상태 해석)

  • Choi, Myung-Jun;Kim, Chang-Hyun;Park, Il-Han
    • Proceedings of the KIEE Conference
    • /
    • 1998.07a
    • /
    • pp.64-66
    • /
    • 1998
  • This paper presents a new efficient method for transient analysis in magnetodynamic systems of linear eddy current problems. This mehtod employs the Fourier transform and the high-order frequency sensitivity of harmonic finite element method. By taking into account the time-constant of magnetodynamic system, the Fourier integral of continuous frequency is converted into the Fourier series of discrete frequency. And with the results of Fourier series expansion of converted input wave form, the responses of each sinusoids is superposed to give the total response of the magnetodynamic systems. But, if the frequency band of input wave form is broad, it takes long computational time since all responses for each sinusoids must be calculated. Therefore, the high-order frequency sensitivity method is employed to estimate the response variation to frequency. The proposed algorithm is applied to an induction heating system to validate its numerical efficiency.

  • PDF