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

Amir Boag; Yoram Bresler; Eric Michielssen

doi:10.1109/83.862638

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

Amir Boag, Yoram Bresler, Eric Michielssen

Research output: Contribution to journal › Article › peer-review

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.

Original language	English (US)
Pages (from-to)	1573-1582
Number of pages	10
Journal	IEEE Transactions on Image Processing
Volume	9
Issue number	9
DOIs	https://doi.org/10.1109/83.862638
State	Published - Sep 2000

ASJC Scopus subject areas

Software
Computer Graphics and Computer-Aided Design

Online availability

10.1109/83.862638

Library availability

Discover UIUC Full Text

Cite this

@article{c025b4fbc3e549a0a781ea3b58176db7,

title = "A multilevel domain decomposition algorithm for fast O(N2 log N) reprojection of tomographic images",

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.",

author = "Amir Boag and Yoram Bresler and Eric Michielssen",

note = "Funding Information: Manuscript received March 24, 1999; revised April 6, 2000. This work was supported in part by grants from AFOSR via the MURI program (F49620-96-1-0025) and by the NSF under Grant 95-02-138. The associate editor coordinating the review of this manuscript and approving it for publication was Prof. Jeffrey A. Fessler.",

year = "2000",

month = sep,

doi = "10.1109/83.862638",

language = "English (US)",

volume = "9",

pages = "1573--1582",

journal = "IEEE Transactions on Image Processing",

issn = "1057-7149",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "9",

}

TY - JOUR

T1 - A multilevel domain decomposition algorithm for fast O(N2 log N) reprojection of tomographic images

AU - Boag, Amir

AU - Bresler, Yoram

AU - Michielssen, Eric

N1 - Funding Information: Manuscript received March 24, 1999; revised April 6, 2000. This work was supported in part by grants from AFOSR via the MURI program (F49620-96-1-0025) and by the NSF under Grant 95-02-138. The associate editor coordinating the review of this manuscript and approving it for publication was Prof. Jeffrey A. Fessler.

PY - 2000/9

Y1 - 2000/9

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0034258769&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0034258769&partnerID=8YFLogxK

U2 - 10.1109/83.862638

DO - 10.1109/83.862638

M3 - Article

C2 - 18262994

AN - SCOPUS:0034258769

SN - 1057-7149

VL - 9

SP - 1573

EP - 1582

JO - IEEE Transactions on Image Processing

JF - IEEE Transactions on Image Processing

IS - 9

ER -