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 条
  • [41] Catalytic decomposition of N2O4 to N2 and O2 to improve Isp
    Pakdehi, Shahram Ghanbari
    Oshani, Fatemeh
    Rezaei, Sadjad
    THEORY AND PRACTICE OF ENERGETIC MATERIALS, VOL VII, 2007, : 418 - 421
  • [42] An O(log n/log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem
    Asadpour, Arash
    Goemans, Michel X.
    Madry, Aleksander
    Gharan, Shayan Oveis
    Saberi, Amin
    PROCEEDINGS OF THE TWENTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2010, 135 : 379 - +
  • [43] An O (n(log n)2/log log n) algorithm for the single maximum coverage location or the (1, Xp)-medianoid problem on trees
    Spoerhase, J.
    Wirth, H. -C.
    INFORMATION PROCESSING LETTERS, 2009, 109 (08) : 391 - 394
  • [44] A NEW O(N2) SHORTEST CHAIN ALGORITHM
    WAISSI, GR
    APPLIED MATHEMATICS AND COMPUTATION, 1990, 37 (02) : 111 - 120
  • [45] An O(n2) algorithm to color Meyniel graphs
    Roussel, F
    Rusu, I
    DISCRETE MATHEMATICS, 2001, 235 (1-3) : 107 - 123
  • [46] Towards a practical O(n log n) phylogeny algorithm
    Truszkowski, Jakub
    Hao, Yanqi
    Brown, Daniel G.
    ALGORITHMS FOR MOLECULAR BIOLOGY, 2012, 7
  • [47] An O(M(n) log n) Algorithm for the Jacobi Symbol
    Brent, Richard P.
    Zimmermann, Paul
    ALGORITHMIC NUMBER THEORY, 2010, 6197 : 83 - +
  • [48] AN O(N LOG N) SET REFINEMENT ALGORITHM WITH APPLICATIONS
    RAO, NSV
    SRIDHAR, R
    IYENGAR, SS
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1991, 40 (3-4) : 129 - 138
  • [49] An O(n log n) algorithm for finding dissimilar strings
    Abbasi, S
    Sengupta, A
    INFORMATION PROCESSING LETTERS, 1997, 62 (03) : 135 - 139
  • [50] AN O(N LOG N) ALGORITHM FOR A MAXMIN LOCATION PROBLEM
    RANGAN, CP
    GOVINDAN, R
    DISCRETE APPLIED MATHEMATICS, 1992, 36 (02) : 203 - 205
12345