Skip Navigation

IMA Journal of Numerical Analysis 2001 21(3):769-782; doi:10.1093/imanum/21.3.769
© 2001 by Institute of Mathematics and its Applications
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Potts, D.
Right arrow Articles by Steidl, G.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

A new linogram algorithm for computerized tomography

Daniel Potts1 and Gabriele Steidl2

1 Medical University of Lübeck, Institute of Mathematics, Wallstraße 40, D-23560 Lübeck, Germany. Email: potts@math.mu-luebeck.de 2 University of Mannheim, Institute of Computer Science, D-68131 Mannheim, Germany. Email: steidl@math.uni-mannheim.de

We propose a new linogram algorithm for the high quality Fourier reconstruction of digital N x N images from their Radon transform. The algorithm is based on univariate fast Fourier transforms for nonequispaced data in the time domain and in the frequency domain. The algorithm requires only O(N2 logN) arithmetic operations and preserves the good reconstruction quality of the filtered backprojection.

Key Words: fast Fourier transform for nonequispaced data; Radon transform; computerized tomography; gridding; linogram; chirp-; z transform


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.