Reconstruction of hv-convex binary matrices from their absorbed projections

Authors:
Attila Kuba;Antal Nagy;Emese Balogh
Affiliations:
Department of Applied Informatics, University of Szeged, Árpád tér 2, Szeged H-6720, Hungary;Department of Applied Informatics, University of Szeged, Árpád tér 2, Szeged H-6720, Hungary;Department of Applied Informatics, University of Szeged, Árpád tér 2, Szeged H-6720, Hungary
Venue:
Discrete Applied Mathematics - The 2001 international workshop on combinatorial image analysis (IWCIA 2001)
Year:
2004

Citing 1
Cited 5

The reconstruction of polyominoes from their orthogonal projections

Information Processing Letters

On image reconstruction algorithms for binary electromagnetic geotomography

Theoretical Computer Science
A framework for generating some discrete sets with disjoint components by using uniform distributions

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
Generation and empirical investigation of hv-convex discrete sets

SCIA'07 Proceedings of the 15th Scandinavian conference on Image analysis
Two remarks on reconstructing binary vectors from their absorbed projections

DGCI'05 Proceedings of the 12th international conference on Discrete Geometry for Computer Imagery

Quantified Score

Hi-index	0.00

Visualization

Abstract

The reconstruction of hv-convex binary matrices from their absorbed projections is considered. Although this problem is NP-hard if the non-absorbed row and column sums are available, it is proved that such a reconstruction problem can be solved in polynomial time from absorbed projections when the absorption is represented by β = (1 + √5)/2. Also a reconstruction algorithm is given to determine the whole structure of hv-convex binary matrices from such projections.