Reconstruction of Binary Images with Few Disjoint Components from Two Projections

Authors:
Péter Balázs
Affiliations:
Department of Image Processing and Computer Graphics, University of Szeged, Szeged, Hungary H-6720
Venue:
ISVC '08 Proceedings of the 4th International Symposium on Advances in Visual Computing, Part II
Year:
2008

Citing 9
Cited 0

Polyominoes defined by two vectors

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 of convex 2D discrete sets in polynomial time

Theoretical Computer Science
An algorithm reconstructing convex lattice sets

Theoretical Computer Science
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)
On the number of hv-convex discrete sets

IWCIA'08 Proceedings of the 12th international conference on Combinatorial image analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a general framework for reconstructing binary images with few disjoint components from the horizontal and vertical projections. We develop a backtracking algorithm that works for binary images having components from an arbitrary class. Thus, a priori information about the components of the image to be reconstructed can be incorporated into the reconstruction process. In addition, we can keep control over the number of components which can increase the speed and accuracy of the reconstruction. Experimental results are also presented.