2018Unpublished venueRequires access

Numerical Computation of the Discrete 2D Fourier Transform in Polar Coordinates

Xueyang Yao, Natalie Baddour

Open publisher page 1 citations

Abstract

The discrete Fourier transform in Cartesian coordinates has proven to be invaluable in many disciplines. However, in application such as photoacoustics and tomography, a discrete 2D-Fourier transform in polar coordinates is needed. In this paper, a discrete 2D-Fourier transform in polar coordinates is presented. It is shown that numerical implementation is best achieved by interpreting the transform as a 1D-discrete Fourier transform (DFT), a 1D-discrete Hankel transform (DHT) and a 1D-discrete inverse transform (IDFT) in sequence. The transform is tested by numerical simulations with respect to accuracy and precision for computation of the continuous 2D transform at specific discrete points. It was found that both the forward and inverse transform showed good accuracy to approximate the continuous Fourier transform. Moreover, good precision results were obtained, which indicate that the proposed transform itself does not add much error.

About this research paper

What this paper is about

The discrete Fourier transform in Cartesian coordinates has proven to be invaluable in many disciplines. However, in application such as photoacoustics and tomography, a discrete 2D-Fourier transform in polar coordinates is needed. In this paper, a discrete 2D-Fourier transform in polar coordinates is presented. It is shown that numerical implementation is best achieved by interpreting the transform as a 1D-discrete Fourier transform (DFT), a 1D-discrete Hankel transform (DHT) and a 1D-discrete inverse transform (IDFT) in sequence. The transform is tested by numerical simulations with respect to accuracy and precision for computation of the continuous 2D transform at specific discrete points. It was found that both the forward and inverse transform showed good accuracy to approximate the continuous Fourier transform. Moreover, good precision results were obtained, which indicate that the proposed transform itself does not add much error.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The discrete Fourier transform in Cartesian coordinates has proven to be invaluable in many disciplines. However, in application such as photoacoustics and tomography, a discrete 2D-Fourier transform in polar coordinates is needed. In this paper, a discrete 2D-Fourier transform in polar coordinates is presented. It is shown that numerical implementation is best achieved by interpreting the transform as a 1D-discrete Fourier transform (DFT), a 1D-discrete Hankel transform (DHT) and a 1D-discrete inverse transform (IDFT) in sequence. The transform is tested by numerical simulations with respect to accuracy and precision for computation of the continuous 2D transform at specific discrete points. It was found that both the forward and inverse transform showed good accuracy to approximate the continuous Fourier transform. Moreover, good precision results were obtained, which indicate that the proposed transform itself does not add much error.

Key concepts: Discrete Fourier transform (general), Discrete Hartley transform, Discrete sine transform, Fractional Fourier transform, Hartley transform, Non-uniform discrete Fourier transform, Discrete-time Fourier transform, Fourier transform

Related papers

Back to paper searchBrowse research topicsOriginal source
Numerical Computation of the Discrete 2D Fourier Transform in Polar Coordinates — Research Paper | ScholarLens