A multilevel domain decomposition algorithm for fast O(N2 log N) reprojection of tomographic images

Amir Boag*, Yoram Bresler, Eric Michielssen

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

A novel algorithm for fast computation of tomographic image projections is presented. The method comprises a decomposition of an image into subimages followed by an aggregation of projections computed for the subimages. The multilevel domain decomposition algorithm is formulated as a recursive procedure. The computational cost of the proposed algorithm is comparable to that of FFT-based techniques while it appears to be more flexible than the latter. Numerical results demonstrate the effectiveness of the method.

Original languageEnglish
Pages (from-to)1573-1582
Number of pages10
JournalIEEE Transactions on Image Processing
Volume9
Issue number9
DOIs
StatePublished - Sep 2000

Fingerprint

Dive into the research topics of 'A multilevel domain decomposition algorithm for fast O(N2 log N) reprojection of tomographic images'. Together they form a unique fingerprint.

Cite this