A solvable case of image reconstruction in discrete tomography

DOI10.1016/j.dam.2005.03.006zbMath1077.94004OpenAlexW1991400499MaRDI QIDQ2486067

David Schindl, Dominique de Werra, Marie-Christine Costa, Christophe Picouleau

Publication date: 5 August 2005

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2005.03.006

zbMATH Keywords

Edge coloringDiscrete tomographyPerfect matchingsComplete bipartite graph

Mathematics Subject Classification ID

Biomedical imaging and signal processing (92C55) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Coloring of graphs and hypergraphs (05C15)

Related Items (13)

New sufficient conditions on the degree sequences of uniform hypergraphs ⋮ Colour degree matrices of graphs with at most one cycle ⋮ Reconstructing binary matrices with timetabling constraints ⋮ Realizing disjoint degree sequences of span at most two: a tractable discrete tomography problem ⋮ A reconstruction algorithm for a subclass of instances of the 2-color problem ⋮ A formulation of the wide partition conjecture using the atom problem in discrete tomography ⋮ Solving the Two Color Problem: An Heuristic Algorithm ⋮ Approximating Bicolored Images from Discrete Projections ⋮ Reconstruction of binary matrices under fixed size neighborhood constraints ⋮ On the use of graphs in discrete tomography ⋮ On the use of graphs in discrete tomography ⋮ Solving Some Instances of the 2-Color Problem ⋮ On the Degree Sequence of 3-Uniform Hypergraph: A New Sufficient Condition

Cites Work

• Discrete tomography. Foundations, algorithms, and applications
• Using graphs for some discrete tomography problems
• Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A solvable case of image reconstruction in discrete tomography