A multilevel domain decomposition algorithm for fast O(N2logN) reprojection of tomographic images.
basic_science · Level V
Where this comes from
- Record sourced from PubMed, PMID 18262994.
- Also identified by DOI 10.1109/83.862638.
- No licence information is recorded for this record.
- Because redistribution is not established, this page shows the abstract only. Follow the links below for the full text.
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.