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 (US) |
|---|---|
| Title of host publication | IEEE International Conference on Image Processing |
| Pages | 633-636 |
| Number of pages | 4 |
| Volume | 2 |
| State | Published - 2000 |
| Externally published | Yes |
| Event | International Conference on Image Processing (ICIP 2000) - Vancouver, BC, Canada Duration: Sep 10 2000 → Sep 13 2000 |
Other
| Other | International Conference on Image Processing (ICIP 2000) |
|---|---|
| Country/Territory | Canada |
| City | Vancouver, BC |
| Period | 9/10/00 → 9/13/00 |
ASJC Scopus subject areas
- Computer Vision and Pattern Recognition
- Hardware and Architecture
- Electrical and Electronic Engineering