A solvable case of image reconstruction in discrete tomography - Archive ouverte HAL Access content directly
Journal Articles Discrete Applied Mathematics Year : 2005

A solvable case of image reconstruction in discrete tomography

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

Dates and versions

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

Identifiers

  • HAL Id : hal-01124964 , version 1

Cite

Marie-Christine Costa, Dominique de Werra, Christophe Picouleau, D. Schindl. A solvable case of image reconstruction in discrete tomography. Discrete Applied Mathematics, 2005, 148, pp.240-245. ⟨hal-01124964⟩

Collections

CNAM CEDRIC-CNAM
18 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More