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.
Brunetti, S., Daurat, A. (2003). Stability in Discrete Tomography:Linear Programming, Additivity and Convexity. In Discrete Geometry for Computer Imagery (pp.398-407). Berlino : Springer [10.1007/978-3-540-39966-7_38].
Stability in Discrete Tomography:Linear Programming, Additivity and Convexity
Brunetti S.;
2003-01-01
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.
| File | Dimensione | Formato | |
|---|---|---|---|
|
BDDGCI03.pdf
non disponibili
Tipologia:
Post-print
Licenza:
NON PUBBLICO - Accesso privato/ristretto
Dimensione
199.24 kB
Formato
Adobe PDF
|
199.24 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11365/27150
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo