Abstract
A novel algorithm for fast computation of tomographic image projections is presented. The method comprises a decomposition of an image into sub-images followed by an aggregation of projections computed for the sub-images. 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 but it provides better accuracy and more flexibility.
Original language | English |
---|---|
Pages | 633-636 |
Number of pages | 4 |
State | Published - 2000 |
Event | International Conference on Image Processing (ICIP 2000) - Vancouver, BC, Canada Duration: 10 Sep 2000 → 13 Sep 2000 |
Conference
Conference | International Conference on Image Processing (ICIP 2000) |
---|---|
Country/Territory | Canada |
City | Vancouver, BC |
Period | 10/09/00 → 13/09/00 |