A Network Flow Algorithm for Reconstructing Binary Images from Discrete X-rays

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.

[1]  K. J. Batenburg,et al.  Prospects for Bright Field and Dark Field Electron Tomography on a Discrete Grid , 2004, Microscopy and Microanalysis.

[2]  Robert E. Tarjan,et al.  Faster Scaling Algorithms for Network Problems , 1989, SIAM J. Comput..

[3]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[4]  Richard P. Anstee,et al.  The network flows approach for matrices with given row and column sums , 1983, Discret. Math..

[5]  Kees Joost Batenburg,et al.  Discrete Tomography of Ga and InGa Particles from HREM Image Simulation and Exit Wave Reconstruction. , 2004 .

[6]  Kees Joost Batenburg.  A new algorithm for 3D binary tomography , 2005, Electron. Notes Discret. Math..

[7]  Sven de Vries,et al.  Approximating Binary Images from Discrete X-Rays , 2000, SIAM J. Optim..

[8]  Christoph Schnörr,et al.  A Linear Programming Relaxation for Binary Tomography with Smoothness Priors , 2003, Electron. Notes Discret. Math..

[9]  Robert J. Vanderbei,et al.  The Discrete Radon Transform and Its Approximate Inversion Via Linear Programming , 1997, Discret. Appl. Math..

[10]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[11]  V G Andrew,et al.  AN EFFICIENT IMPLEMENTATION OF A SCALING MINIMUM-COST FLOW ALGORITHM , 1997 .

[12]  V.,et al.  Discrete Tomography of Ga and InGa Particles from HREM Image Simulation and Exit Wave Reconstruction , 2004 .

[13]  D. Gale.  A theorem on flows in networks , 1957 .

[14]  Peter Gritzmann,et al.  Discrete Tomography: Determination of Finite Sets by X-Rays , 1995, Universität Trier, Mathematik/Informatik, Forschungsbericht.

[15]  Cornelis H. Slump,et al.  A network flow approach to reconstruction of the left ventricle from two projections , 1982, Comput. Graph. Image Process..

[16]  Peter Schwander,et al.  An approach to quantitative high-resolution transmission electron microscopy of crystalline materials , 1995 .

[17]  Sven de Vries,et al.  Success and failure of certain reconstruction and uniqueness algorithms in discrete tomography , 1998, Int. J. Imaging Syst. Technol..

[18]  Fuzhen Zhang,et al.  On the precise number of (0, 1)-matrices in U(R, R) , 1998, Discret. Math..

[19]  Kim,et al.  Mapping projected potential, interfacial roughness, and composition in general crystalline solids by quantitative transmission electron microscopy. , 1993, Physical review letters.

[20]  Maurice Nivat,et al.  Reconstructing Convex Polyominoes from Horizontal and Vertical Projections , 1996, Theor. Comput. Sci..

[21]  Alain Daurat,et al.  An algorithm reconstructing convex lattice sets , 2003, Theor. Comput. Sci..

[22]  Peter Gritzmann,et al.  On the computational complexity of reconstructing lattice sets from their X-rays , 1999, Discret. Math..

[23]  Lajos Hajdu,et al.  An algorithm for discrete tomography , 2001 .

[24]  William J. Cook,et al.  Combinatorial optimization , 1997 .

[25]  G. Herman,et al.  Discrete tomography : foundations, algorithms, and applications , 1999 .

[26]  H. Ryser.  Combinatorial Properties of Matrices of Zeros and Ones , 1957, Canadian Journal of Mathematics.

[27]  P. Gritzmann,et al.  Success and failure of certain reconstruction and uniqueness algorithms in discrete tomography , 1998 .

[28]  Lajos Hajdu,et al.  Algebraic aspects of discrete tomography , 2001 .

[29]  K. Tanabe.  Projection method for solving a singular system of linear equations and its applications , 1971 .

[30]  Attila Kuba,et al.  Reconstruction of 4- and 8-connected convex discrete sets from row and column projections , 2001 .