Using graphs for some discrete tomography problems

Authors:
M. -C. Costa;D. de Werra;C. Picouleau
Affiliations:
CEDRIC CNAM, Paris, France;Ecole Polytechnique Fédérale de Lausanne, Switzerland;CEDRIC CNAM, Paris, France
Venue:
Discrete Applied Mathematics
Year:
2006

Citing 4
Cited 2

On the comptational complexity of determining polyatomic structures by X-rays

Theoretical Computer Science
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
Matchings in colored bipartite networks

Discrete Applied Mathematics

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

Quantified Score

Hi-index	0.05

Visualization

Abstract

Given a rectangular array whose entries represent the pixels of a digitalized image, we consider the problem of reconstructing an image from the number of occurrences of each color in every column and in every row. The complexity of this problem is still open when there are just three colors in the image. We study some special cases where the number of occurrences of each color is limited to small values. Formulations in terms of edge coloring in graphs and as timetabling problems are used; complexity results are derived from the model.