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

A. Boag, Y. Bresler, E. Michielssen

Research output: Contribution to conferencePaperpeer-review

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
Pages633-636
Number of pages4
StatePublished - 2000
EventInternational Conference on Image Processing (ICIP 2000) - Vancouver, BC, Canada
Duration: 10 Sep 200013 Sep 2000

Conference

ConferenceInternational Conference on Image Processing (ICIP 2000)
Country/TerritoryCanada
CityVancouver, BC
Period10/09/0013/09/00

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