Note: A solvable case of image reconstruction in discrete tomography

Authors:
M. C. Costa;D. de Werra;C. Picouleau;D. Schindl
Affiliations:
Labo CEDRIC, CNAM, Paris, France;IMA - EPFL, Lausanne, Switzerland;CNAM, Paris, France;GERAD - HEC, Montreal, Canada
Venue:
Discrete Applied Mathematics
Year:
2005

Citing 2
Cited 5

Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms

Theoretical Computer Science
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Solving the two color problem: an heuristic algorithm

IWCIA'11 Proceedings of the 14th international conference on Combinatorial image analysis
Approximating bicolored images from discrete projections

IWCIA'11 Proceedings of the 14th international conference on Combinatorial image analysis
A reconstruction algorithm for a subclass of instances of the 2-color problem

Theoretical Computer Science
A formulation of the wide partition conjecture using the atom problem in discrete tomography

Discrete Applied Mathematics
Solving Multicolor Discrete Tomography Problems by Using Prior Knowledge

Fundamenta Informaticae - Strategies for Tomography

Quantified Score

Hi-index	0.05

Visualization

Abstract

A graph-theoretical model is used to show that a special case of image reconstruction problem (with 3 colors) can be solved in polynomial time. For the general case with 3 colors, the complexity status is open. Here we consider that among the three colors there is one for which the total number of multiple occurrences in a same line (row or column) is bounded by a fixed parameter. There is no assumption on the two remaining colors.