Reconstructing binary images from discrete X-rays

textabstractWe 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 reconstructions which resemble the original images very closely 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 with great accuracy

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

[2]  Andrew V. Goldberg,et al.  An efficient implementation of a scaling minimum-cost flow algorithm , 1993, IPCO.

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

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

[5]  Kees Joost Batenburg,et al.  Splash: Snmp plus a Lightweight Api for Snap Handling (6 Formerly Affiliated with Universiteit Leiden) , 2009 .

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

[7]  Pedro I. Rivera-Vega,et al.  Network flow model for binary tomography on lattices , 1998, Int. J. Imaging Syst. Technol..

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

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

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

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

[12]  A. Kuba.  Reconstruction of measurable plane sets from their two projections taken in arbitrary directions , 1991 .

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

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

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

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

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

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

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

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

[21]  Jerry L. Prince,et al.  Reconstructing Convex Sets from Support Line Measurements , 1990, IEEE Trans. Pattern Anal. Mach. Intell..

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

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

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