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

A. Boag, Yoram Bresler, E. Michielssen

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 languageEnglish (US)
Title of host publicationIEEE International Conference on Image Processing
Pages633-636
Number of pages4
Volume2
StatePublished - 2000
Externally publishedYes
EventInternational Conference on Image Processing (ICIP 2000) - Vancouver, BC, Canada
Duration: Sep 10 2000Sep 13 2000

Other

OtherInternational Conference on Image Processing (ICIP 2000)
CountryCanada
CityVancouver, BC
Period9/10/009/13/00

ASJC Scopus subject areas

  • Computer Vision and Pattern Recognition
  • Hardware and Architecture
  • Electrical and Electronic Engineering

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

  • Cite this

    Boag, A., Bresler, Y., & Michielssen, E. (2000). A multilevel domain decomposition algorithm for fast O(N2log N) reprojection of tomographic images. In IEEE International Conference on Image Processing (Vol. 2, pp. 633-636)