In this paper the well-known problem of reconstructing hv-convex polyominoes is considered from a set of noisy data. Differently from the usual approach of Binary Tomography, this leads to a probabilistic evaluation in the reconstruction algorithm, where different pixels assume different probabilities to be part of the reconstructed image. An iterative algorithm is then applied, which, starting from a random choice, leads to an explicit reconstruction matching the noisy data.
Goupy, A., Pagani, S. M. C., Probabilistic Reconstruction of hv-convex Polyominoes from Noisy Projection Data, <<FUNDAMENTA INFORMATICAE>>, 2014; (135): 117-134. [doi:10.3233/FI-2014-1115] [http://hdl.handle.net/10807/79304]
Probabilistic Reconstruction of hv-convex Polyominoes from Noisy Projection Data
Pagani, Silvia Maria Carla
2014
Abstract
In this paper the well-known problem of reconstructing hv-convex polyominoes is considered from a set of noisy data. Differently from the usual approach of Binary Tomography, this leads to a probabilistic evaluation in the reconstruction algorithm, where different pixels assume different probabilities to be part of the reconstructed image. An iterative algorithm is then applied, which, starting from a random choice, leads to an explicit reconstruction matching the noisy data.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.