On the use of graphs in discrete tomography

In this tutorial paper, we consider the basic image reconstruction problem which stems from discrete tomography. We derive a graph theoretical model and we explore some variations and extensions of this model. This allows us to establish connections with scheduling and timetabling applications. The complexity status of these problems is studied and we exhibit some polynomially solvable cases. We show how various classical techniques of operations research like matching, 2-SAT, network flows are applied to derive some of these results.

[1]  Erik Knudsen,et al.  Discrete Tomography for Generating Grain Maps of Polycrystals , 2007 .

[2]  N. Deo,et al.  Techniques for analyzing dynamic random graph models of web‐like networks: An overview , 2008, Networks.

[3]  Michael Jay Schillaci.  Total Tomography [review of Advances in Discrete Tomography and Its Applications (Herman, G.T. and Kuba, A., Eds.; 2007)] , 2009, Computing in Science & Engineering.

[4]  Dominique de Werra,et al.  Graph coloring with cardinality constraints on the neighborhoods , 2009, Discret. Optim..

[5]  Kees Joost Batenburg,et al.  Network Flow Algorithms for Discrete Tomography , 2007 .

[6]  Robert E. Tarjan,et al.  A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas , 1979, Inf. Process. Lett..

[7]  Ian Holyer,et al.  The NP-Completeness of Edge-Coloring , 1981, SIAM J. Comput..

[8]  Vito Di Gesù,et al.  Discrete Applied Mathematics: Preface , 2005 .

[9]  G. Herman,et al.  Advances in discrete tomography and its applications , 2007 .

[10]  Martín Matamala,et al.  Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard , 2009, ESA.

[11]  Alon Itai,et al.  On the Complexity of Timetable and Multicommodity Flow Problems , 1976, SIAM J. Comput..

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

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

[14]  Akira Kaneko,et al.  Reconstruction Algorithm and Switching Graph for Two-Projection Tomography with Prohibited Subregion , 2006, DGCI.

[15]  Marek Chrobak,et al.  Reconstructing Polyatomic Structures from Discrete X-Rays: NP-Completeness Proof for Three Atoms , 1998, MFCS.

[16]  Attila Kuba,et al.  Discrete Tomography Methods for Nondestructive Testing , 2007 .

[17]  Andrea Frosini,et al.  Reconstruction of binary matrices under fixed size neighborhood constraints , 2008, Theor. Comput. Sci..

[18]  Roberto Martinis,et al.  Tomographie ultrasonore pour les arbres sur pied , 2004 .

[19]  Dominique de Werra,et al.  Degree-constrained edge partitioning in graphs arising from discrete tomography , 2009, J. Graph Algorithms Appl..

[20]  Marek Chrobak,et al.  Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms , 2001, Theor. Comput. Sci..

[21]  Dominique de Werra,et al.  On a graph coloring problem arising from discrete tomography , 2008, Networks.

[22]  J. H. Middlemiss,et al.  Tomography and its application to investigations of the spine , 1950 .

[23]  Dominique de Werra,et al.  A solvable case of image reconstruction in discrete tomography , 2005, Discret. Appl. Math..

[24]  Dominique de Werra,et al.  Using graphs for some discrete tomography problems , 2006, Discret. Appl. Math..

[25]  D. de Werra,et al.  Nesticity, DIMACS series , 1997 .

[26]  Anass Nagih,et al.  A MIP flow model for crop rotation planning in a sustainable development context , 2006 .

[27]  Attila Kuba,et al.  Discrete Tomography: A Historical Overview , 1999 .