Abstract
In this article we describe a non-equispaced fast Fourier transform. It is similar to the algorithms of Dutt and Rokhlin and Beylkin but is based on an exact Fourier series representation. This results in a greatly simplified analysis and increased flexibility. The latter can be used to achieve more efficiency. Accuracy and efficiency of the resulting algorithm are illustrated by numerical examples. In the second part of the article the non-equispaced FFT is applied to the reconstruction problem in Computerized Tomography. This results in a different view of the gridding method of O’Sullivan and in a new ultra fast reconstruction algorithm. The new reconstruction algorithm outperforms the filtered backprojection by a speedup factor of up to 100 on standard hardware while still producing excellent reconstruction quality.
Article PDF
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Eric Quinto.
Rights and permissions
About this article
Cite this article
Fourmont, K. Non-Equispaced Fast Fourier Transforms with Applications to Tomography. J. Fourier Anal. Appl. 9, 431–450 (2003). https://doi.org/10.1007/s00041-003-0021-1
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s00041-003-0021-1