Stability in discrete tomography: Linear programming, additivity and convexity - Archive ouverte HAL Access content directly
Conference Papers Year : 2003

Stability in discrete tomography: Linear programming, additivity and convexity

Abstract

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.
Fichier principal
Vignette du fichier
additivity_short.pdf (180.08 Ko) Télécharger le fichier
Loading...

Dates and versions

hal-00023084 , version 1 (19-04-2006)

Identifiers

Cite

Sara Brunetti, Alain Daurat. Stability in discrete tomography: Linear programming, additivity and convexity. 2003, pp.398-407, ⟨10.1007/b94107⟩. ⟨hal-00023084⟩
47 View
77 Download

Altmetric

Share

Gmail Facebook X LinkedIn More