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

被引：33
|
作者：
Boag, A [1 ]
Bresler, Y
Michielssen, E
机构：
[1] Tel Aviv Univ, Dept Elect Engn Phys Elect, IL-69978 Tel Aviv, Israel
[2] Univ Illinois, Coordinated Sci Lab, Urbana, IL 61801 USA
[3] Univ Illinois, Dept Elect & Comp Engn, Urbana, IL 61801 USA
来源：
IEEE TRANSACTIONS ON IMAGE PROCESSING | 2000年 / 9卷 / 09期
基金：
美国国家科学基金会;
关键词：
D O I：
10.1109/83.862638
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
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.
引用
收藏
页码：1573 / 1582
页数：10
相关论文
共 50 条
  • [21] An N2 log N back-projection algorithm for SAR image formation
    Xiao, S
    Munson, DC
    Basu, S
    Bresler, Y
    CONFERENCE RECORD OF THE THIRTY-FOURTH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS & COMPUTERS, 2000, : 3 - 7
  • [22] An efficient decomposition of NO into N2 and O2 in a fast discharge flow of NO/He mixtures
    Tsuji, M
    Tanaka, A
    Hamagami, T
    Nakano, K
    Nishimura, Y
    JAPANESE JOURNAL OF APPLIED PHYSICS PART 2-LETTERS, 2000, 39 (9AB): : L933 - L935
  • [23] A New O (n2 log n) Not-First/Not-Last Pruning Algorithm for Cumulative Resource Constraints
    Schutt, Andreas
    Wolf, Armin
    PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING-CP 2010, 2010, 6308 : 445 - +
  • [24] An O(n2) Algorithm for Isotonic Regression
    Burdakov, O
    Sysoev, O
    Grimvall, A
    Hussian, M
    LARGE-SCALE NONLINEAR OPTIMIZATION, 2006, 83 : 25 - +
  • [25] A Local O(n2) Gathering Algorithm
    Degener, Bastian
    Kempkes, Barbara
    auf der Heide, Friedhelm Meyer
    SPAA '10: PROCEEDINGS OF THE TWENTY-SECOND ANNUAL SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, 2010, : 217 - 223
  • [26] An O(n2) algorithm for the bidiagonal SVD
    Grosser, B
    Lang, B
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2003, 358 : 45 - 70
  • [27] An O(n2) algorithm for signed translocation
    Wang, LS
    Zhu, DM
    Liu, XW
    Ma, SH
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2005, 70 (03) : 284 - 299
  • [28] A FAST MULTILEVEL DECOMPOSITION ALGORITHM FOR N-DIMENSIONAL DISCRETE GABOR TRANSFORMS
    ZHU, ZY
    BARBA, J
    JOURNAL OF MICROSCOPY-OXFORD, 1992, 167 : 313 - 322
  • [29] AN O(N LOG N LOG LOG N) PARALLEL MAXIMUM MATCHING ALGORITHM FOR BIPARTITE GRAPHS
    KIM, T
    CHWA, KY
    INFORMATION PROCESSING LETTERS, 1987, 24 (01) : 15 - 17
  • [30] An O(N log N) algorithm for shape modeling
    Malladi, R.
    Sethian, J. A.
    Proceedings of the National Academy of Sciences of the United States of America, 93 (18):
12345