Reconstruction of 8-connected but not 4-connected \(hv\)-convex discrete sets

DOI10.1016/j.dam.2004.09.009zbMath1071.65047OpenAlexW2023898014MaRDI QIDQ1775617

Emese Balogh, Attila Kuba, Péter Balázs

Publication date: 4 May 2005

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2004.09.009

zbMATH Keywords

numerical examplesDiscrete tomographyReconstructionalgorithConnected discrete set

Mathematics Subject Classification ID

Biomedical imaging and signal processing (92C55)

Related Items (4)

DISCRETE TOMOGRAPHIC RECONSTRUCTION OF BINARY IMAGES WITH DISJOINT COMPONENTS USING SHAPE INFORMATION ⋮ Complexity results for reconstructing binary images with disjoint components from horizontal and vertical projections ⋮ A benchmark set for the reconstruction of \(hv\)-convex discrete sets ⋮ Reconstruction of Discrete Sets from Four Projections: Strong Decomposability

Cites Work

• Unnamed Item
• Reconstructing convex polyominoes from horizontal and vertical projections
• Matrices of zeros and ones with fixed row and column sum vectors
• Switching components and the ambiguity problem in the reconstruction of pictures from their projections
• Polyominoes defined by two vectors
• Discrete tomography. Foundations, algorithms, and applications
• The reconstruction of polyominoes from their orthogonal projections
• Reconstruction of convex 2D discrete sets in polynomial time
• Reconstructing \(hv\)-convex polyominoes from orthogonal projections
• The number of convex polyominoes reconstructible from their orthogonal projections
• Combinatorial Properties of Matrices of Zeros and Ones
• Discrete Geometry for Computer Imagery
• Comparison of algorithms for reconstructing \(hv\)-convex discrete sets
• Reconstruction of 4- and 8-connected convex discrete sets from row and column projections

This page was built for publication: Reconstruction of 8-connected but not 4-connected \(hv\)-convex discrete sets