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.
Lingua originale | English |
---|---|
pagine (da-a) | 117-134 |
Numero di pagine | 18 |
Rivista | Fundamenta Informaticae |
DOI | |
Stato di pubblicazione | Pubblicato - 2014 |
Keywords
- hv-convex polyomino
- noisy data
- polyomino
- reconstruction algorithm