Reconstruction of Canonical hv-Convex Discrete Sets from Horizontal and Vertical Projections

Authors:
Péter Balázs
Affiliations:
Department of Image Processing and Computer Graphics, University of Szeged, Szeged, Hungary H-6720
Venue:
IWCIA '09 Proceedings of the 13th International Workshop on Combinatorial Image Analysis
Year:
2009

Citing 8
Cited 2

Polyominoes defined by two vectors

Theoretical Computer Science
Reconstructing convex polyominoes from horizontal and vertical projections

Theoretical Computer Science
Reconstructing hv-convex polyominoes from orthogonal projections

Information Processing Letters
The reconstruction of polyominoes from their orthogonal projections

Information Processing Letters
Reconstruction in Different Classes of 2D Discrete Sets (Invited Paper)

DCGI '99 Proceedings of the 8th International Conference on Discrete Geometry for Computer Imagery
Advances in Discrete Tomography and Its Applications (Applied and Numerical Harmonic Analysis)

Advances in Discrete Tomography and Its Applications (Applied and Numerical Harmonic Analysis)
A framework for generating some discrete sets with disjoint components by using uniform distributions

Theoretical Computer Science
Reconstruction of 8-connected but not 4-connected hv-convex discrete sets

Discrete Applied Mathematics - Special issue: Advances in discrete geometry and topology (DGCI 2003)

Complexity results for reconstructing binary images with disjoint components from horizontal and vertical projections

Discrete Applied Mathematics
Solving Multicolor Discrete Tomography Problems by Using Prior Knowledge

Fundamenta Informaticae - Strategies for Tomography

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of reconstructing some special hv -convex discrete sets from their two orthogonal projections is considered. In general, the problem is known to be NP-hard, but it is solvable in polynomial time if the discrete set to be reconstructed is also 8-connected. In this paper, we define an intermediate class --- the class of hv -convex canonical discrete sets --- and give a constructive proof that the above problem remains computationally tractable for this class, too. We also discuss some further theoretical consequences and present experimental results as well.