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

Authors:
Péter Balázs;Emese Balogh;Attila Kuba
Affiliations:
Department of Informatics, University of Szeged, H-6720 Szeged, Hungary;Department of Informatics, University of Szeged, H-6720 Szeged, Hungary;Department of Informatics, University of Szeged, H-6720 Szeged, Hungary
Venue:
Discrete Applied Mathematics - Special issue: Advances in discrete geometry and topology (DGCI 2003)
Year:
2005

Citing 8
Cited 3

Polyominoes defined by two vectors

Theoretical Computer Science
Well-composed sets

Computer Vision and Image Understanding
Reconstructing convex polyominoes from horizontal and vertical projections

Theoretical Computer Science
The number of convex polyominoes reconstructible from their orthogonal projections

Proceedings of the 6th conference on Formal power series and algebraic combinatorics
Reconstructing hv-convex polyominoes from orthogonal projections

Information Processing Letters
Algorithm 445: Binary pattern reconstruction from projections

Communications of the ACM
The reconstruction of polyominoes from their orthogonal projections

Information Processing Letters
Reconstruction of convex 2D discrete sets in polynomial time

Theoretical Computer Science

Decision Trees in Binary Tomography for Supporting the Reconstruction of hv-Convex Connected Images

ACIVS '08 Proceedings of the 10th International Conference on Advanced Concepts for Intelligent Vision Systems
On the ambiguity of reconstructing hv-convex binary matrices with decomposable configurations

Acta Cybernetica
A benchmark set for the reconstruction of hv-convex discrete sets

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The reconstruction of 8-connected but not 4-connected hv-convex discrete sets from few projections is considered. An algorithm is given with worst case complexity of O(mn min{m, n}) to reconstruct all sets with given horizontal and vertical projections. Experimental results are also presented. It is shown, that using also the diagonal projections the algorithm can be speeded up having complexity of O(mn) and in this case the solution is uniquely determined. Finally, we consider the possible generalizations of our results to solve the problem in more general classes.