Stability in Discrete Tomography: Linear Programming, Additivity and Convexity

The problem of reconstructing finite subsets of the integer lattice from X-rays has been studied in discrete mathematics and applied in several fields like image processing, data security, electron microscopy. In this paper we focus on the stability of the reconstruction problem for some lattice sets. First we show some theoretical bounds for additive sets, and a numerical experiment is made by using linear programming to deal with stability for convex sets.

• Type: Conference
• Year: 2003
• Where: DGCI
• Authors: Sara Brunetti, Alain Daurat
• Keywords: Additive Sets, DGCI 2003, Integer Lattice, Lattice Sets