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

A. Boag; Y. Bresler; E. Michielssen

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

A. Boag, Y. Bresler, E. Michielssen

School of Electrical Engineering

Research output: Contribution to conference › Paper › peer-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 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

Cite this

@conference{9d7cb7f63eb243faaed516e7e36fedc8,

title = "A multilevel domain decomposition algorithm for fast O(N2log 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 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.",

author = "A. Boag and Y. Bresler and E. Michielssen",

year = "2000",

language = "אנגלית",

pages = "633--636",

note = "null ; Conference date: 10-09-2000 Through 13-09-2000",

}

TY - CONF

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

AU - Boag, A.

AU - Bresler, Y.

AU - Michielssen, E.

PY - 2000

Y1 - 2000

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

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

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

M3 - ???researchoutput.researchoutputtypes.contributiontoconference.paper???

AN - SCOPUS:0034442874

SP - 633

EP - 636

Y2 - 10 September 2000 through 13 September 2000

ER -

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

Abstract

Conference

Other files and links

Fingerprint

Cite this