Skip to Main content Skip to Navigation
Journal articles

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.
Complete list of metadatas
Contributor : Laboratoire Cedric <>
Submitted on : Friday, March 6, 2015 - 10:54:00 AM
Last modification on : Friday, January 31, 2020 - 9:26:03 AM


  • HAL Id : hal-01124964, version 1



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



Record views