Using graphs for some discrete tomography problems - Archive ouverte HAL Access content directly
Journal Articles Discrete Applied Mathematics Year : 2006

Using graphs for some discrete tomography problems

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.
No file

Dates and versions

hal-01124922 , version 1 (06-03-2015)

Identifiers

  • HAL Id : hal-01124922 , version 1

Cite

Marie-Christine Costa, Dominique de Werra, Christophe Picouleau. Using graphs for some discrete tomography problems. Discrete Applied Mathematics, 2006, 154, pp.35-46. ⟨hal-01124922⟩

Collections

CNAM CEDRIC-CNAM
24 View
0 Download

Share

Gmail Facebook X LinkedIn More