Improved fast polar Fourier transform algorithm

Mankun Xu; Xijian Ping

doi:10.1117/12.538986

25 September 2003 Improved fast polar Fourier transform algorithm

Mankun Xu, Xijian Ping

Proceedings Volume 5286, Third International Symposium on Multispectral Image Processing and Pattern Recognition; (2003) https://doi.org/10.1117/12.538986
Event: Third International Symposium on Multispectral Image Processing and Pattern Recognition, 2003, Beijing, China

Abstract

The problem of calculating the discrete Fourier tranform (DFT) acquired in polar coordinate system has been given considerably attention in many fields such as antenna, image registration and tomography. This paper proposes an improved fast DPFT algorithm aiming at 2D real data. In this paper, a Conjugated-like property of the conjugated sequences' Chirp-Z transform (CZT) in symmetric frequency section is proved which saves half of the computational complexity in CZT. The algorithm is suitable for real-time applications by only 1D calcuations in which the most steps are 1D FFT. The experimental results show the applicability and good performance of this approach.

Citation Download Citation

Mankun Xu and Xijian Ping "Improved fast polar Fourier transform algorithm", Proc. SPIE 5286, Third International Symposium on Multispectral Image Processing and Pattern Recognition, (25 September 2003); https://doi.org/10.1117/12.538986

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available