A network flow algorithm for reconstructing binary images from discrete x-rays

被引:26
作者
Batenburg, Kees Joost [1 ]
机构
[1] Leiden Univ, NL-2300 RA Leiden, Netherlands
关键词
discrete tomography; image reconstruction; network flow problems;
D O I
10.1007/s10851-006-9798-2
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We present a new algorithm for reconstructing binary images from their projections along a small number of directions. Our algorithm performs a sequence of related reconstructions, each using only two projections. The algorithm makes extensive use of network flow algorithms for solving the two-projection subproblems. Our experimental results demonstrate that the algorithm can compute highly accurate reconstructions from a small number of projections, even in the presence of noise. Although the effectiveness of the algorithm is based on certain smoothness assumptions about the image, even tiny, non-smooth details are reconstructed exactly. The class of images for which the algorithm is most effective includes images of convex objects, but images of objects that contain holes or consist of multiple components can also be reconstructed very well.
引用
收藏
页码:175 / 191
页数:17
相关论文
共 29 条
[1]  
Ahuja RK, 1993, NETWORK FLOWS THEORY
[2]   THE NETWORK FLOWS APPROACH FOR MATRICES WITH GIVEN ROW AND COLUMN SUMS [J].
ANSTEE, RP .
DISCRETE MATHEMATICS, 1983, 44 (02) :125-138
[3]   Reconstructing convex polyominoes from horizontal and vertical projections [J].
Barcucci, E ;
DelLungo, A ;
Nivat, M ;
Pinzani, R .
THEORETICAL COMPUTER SCIENCE, 1996, 155 (02) :321-347
[4]  
BATENBURG KJ, 2005, ELECT NOTES DISCRETE, V20, P247
[5]   An algorithm reconstructing convex lattice sets [J].
Brunetti, S ;
Daurat, A .
THEORETICAL COMPUTER SCIENCE, 2003, 304 (1-3) :35-57
[6]   Reconstruction of 4-and 8-connected convex discrete sets from row and column projections [J].
Brunetti, S ;
Del Lungo, A ;
Del Ristoro, F ;
Kuba, A ;
Nivat, M .
LINEAR ALGEBRA AND ITS APPLICATIONS, 2001, 339 (1-3) :37-57
[7]   The discrete Radon transform and its approximate inversion via linear programming [J].
Fishburn, P ;
Schwander, P ;
Shepp, L ;
Vanderbei, RJ .
DISCRETE APPLIED MATHEMATICS, 1997, 75 (01) :39-61
[8]   FASTER SCALING ALGORITHMS FOR NETWORK PROBLEMS [J].
GABOW, HN ;
TARJAN, RE .
SIAM JOURNAL ON COMPUTING, 1989, 18 (05) :1013-1036
[9]  
Gale D., 1957, PACIFIC J MATH, V7, P1073, DOI [10.2140/pjm.1957.7.1073, DOI 10.2140/PJM.1957.7.1073]
[10]   On the computational complexity of reconstructing lattice sets from their X-rays [J].
Gardner, RJ ;
Gritzmann, P ;
Prangenberg, D .
DISCRETE MATHEMATICS, 1999, 202 (1-3) :45-71