DocumentCode
1373408
Title
A multilevel domain decomposition algorithm for fast O(N2logN) reprojection of tomographic images
Author
Boag, Amir ; Bresler, Yoram ; Michielssen, Eric
Author_Institution
Dept. of Electr. Eng.-Phys. Electron., Tel Aviv Univ., Israel
Volume
9
Issue
9
fYear
2000
fDate
9/1/2000 12:00:00 AM
Firstpage
1573
Lastpage
1582
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
Keywords
computational complexity; computerised tomography; image reconstruction; interpolation; FFT-based techniques; algorithm; computational cost; fast computation; fast reprojection; image decomposition; interpolation; multilevel domain decomposition algorithm; recursive procedure; subimages; tomographic image projections; Computational efficiency; Computed tomography; Costs; Fourier transforms; Hardware; Helium; Image reconstruction; Iterative algorithms; Positron emission tomography; Reconstruction algorithms;
fLanguage
English
Journal_Title
Image Processing, IEEE Transactions on
Publisher
ieee
ISSN
1057-7149
Type
jour
DOI
10.1109/83.862638
Filename
862638
Link To Document