Probabilistic reconstruction of hv-convex polyominoes from noisy projection data

DOI10.3233/FI-2014-1115MaRDI QIDQ5259278zbMATH OpenFDO

Authors Alexandre Goupy, Silvia M. C. Pagani

Publication date 26 June 2015

Published in Fundamenta Informaticae (Search for Journal in Brave)

zbMATH Keywords

reconstruction algorithmnoisy data\(hv\)-convex polyminopolymino

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies for image processing (68U10) Polyominoes (05B50)

Recommendations

• Reconstructing \(hv\)-convex polyominoes from orthogonal projections
• Approximating hv-Convex Binary Matrices and Images from Discrete Projections
• Reconstruction of convex polyominoes from orthogonal projections of their contours
• Ambiguous reconstructions of hv-convex polyominoes
• Tomographic reconstruction of 2-convex polyominoes using dual Horn clauses

Cited in

(4)

• A rounding theorem for unique binary tomographic reconstruction
• Reconstruction of convex polyominoes with a blocking component
• Error bounds for consistent reconstruction: random polytopes and coverage processes
• A geometrical characterization of regions of uniqueness and applications to discrete tomography

This page was built for publication: Probabilistic reconstruction of \(hv\)-convex polyominoes from noisy projection data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5259278)