Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network

  Advanced Search  

Appl. Comput. Harmon. Anal. 21 (2006) 145167 www.elsevier.com/locate/acha

Summary: Appl. Comput. Harmon. Anal. 21 (2006) 145167
Fast and accurate Polar Fourier transform
A. Averbuch a
, R.R. Coifman b
, D.L. Donoho c
, M. Elad d,
, M. Israeli d
a Department of Computer Science, Tel-Aviv University, Tel-Aviv 69978, Israel
b Department of Mathematics, Yale University, New Haven, CT 06520-8283, USA
c Department of Statistics, Stanford University, Stanford, CA 94305-9025, USA
d Department of Computer Science, The Technion, Haifa 32000, Israel
Received 16 August 2005; revised 25 October 2005; accepted 17 November 2005
Available online 27 December 2005
Communicated by Charles K. Chui
In a wide range of applied problems of 2D and 3D imaging a continuous formulation of the problem places great emphasis on
obtaining and manipulating the Fourier transform in Polar coordinates. However, the translation of continuum ideas into practical
work with data sampled on a Cartesian grid is problematic. In this article we develop a fast high accuracy Polar FFT. For a given
two-dimensional signal of size N N, the proposed algorithm's complexity is O(N2 logN), just like in a Cartesian 2D-FFT.


Source: Averbuch, Amir - School of Computer Science, Tel Aviv University
Elad, Michael - Department of Computer Science, Technion, Israel Institute of Technology


Collections: Computer Technologies and Information Sciences