A solvable case of image reconstruction in discrete tomography

DOI10.1016/J.DAM.2005.03.006MaRDI QIDQ2486067zbMATH OpenOpenAlexFDO

Authors Marie-Christine Costa, Dominique De Werra, David Schindl, 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

Discrete tomographyPerfect matchingsEdge coloringComplete 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)

Recommendations

• scientific article; zbMATH DE number 1551782
• scientific article; zbMATH DE number 2086609
• On the difference between solutions of discrete tomography problems
• Bounds for discrete tomography solutions
• Discrete tomography reconstruction algorithms for images with a blocking component
• An algorithm for discrete tomography
• A New Approach for the Reconstruction of Object-Based Images in Discrete Tomography
• Discrete tomography. Foundations, algorithms, and applications
• On the difference between solutions of discrete tomography problems. II
• DISCRETE TOMOGRAPHIC RECONSTRUCTION OF BINARY IMAGES WITH DISJOINT COMPONENTS USING SHAPE INFORMATION

Cites work

• scientific article; zbMATH DE number 3182201 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3338381 (Why is no real title available?)
• Discrete tomography. Foundations, algorithms, and applications
• Network flows. Theory, algorithms, and applications.
• Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms
• Using graphs for some discrete tomography problems

Cited in

(22)

• Solving the two color problem: an heuristic algorithm
• Degree-constrained edge partitioning in graphs arising from discrete tomography
• New sufficient conditions on the degree sequences of uniform hypergraphs
• scientific article; zbMATH DE number 1551782 (Why is no real title available?)
• Solving some instances of the 2-color problem
• A New Approach for the Reconstruction of Object-Based Images in Discrete Tomography
• A formulation of the wide partition conjecture using the atom problem in discrete tomography
• On the Degree Sequence of 3-Uniform Hypergraph: A New Sufficient Condition
• On a graph coloring problem arising from discrete tomography
• Reduction from three-dimensional discrete tomography to multicommodity flow problem
• Using graphs for some discrete tomography problems
• Colour degree matrices of graphs with at most one cycle
• Realizing disjoint degree sequences of span at most two: a tractable discrete tomography problem
• Approximating Bicolored Images from Discrete Projections
• On the use of graphs in discrete tomography
• Solving multicolor discrete tomography problems by using prior knowledge
• A reconstruction algorithm for a subclass of instances of the 2-color problem
• Reconstructing binary matrices with timetabling constraints
• On the use of graphs in discrete tomography
• Reconstruction of binary matrices under fixed size neighborhood constraints
• DISCRETE TOMOGRAPHIC RECONSTRUCTION OF BINARY IMAGES WITH DISJOINT COMPONENTS USING SHAPE INFORMATION
• Belief-propagation reconstruction for discrete tomography

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2486067)