A decomposition technique for reconstructing discrete sets from four projections

Authors:
Péter Balázs
Affiliations:
Department of Computer Algorithms and Artificial Intelligence, University of Szeged, Árpád tér 2, H-6720 Szeged, Hungary
Venue:
Image and Vision Computing
Year:
2007

Citing 12
Cited 5

Polyominoes defined by two vectors

Theoretical Computer Science
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
The reconstruction of polyominoes from their orthogonal projections

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

Theoretical Computer Science
Random generation of Q-convex sets

Theoretical Computer Science
An evolutionary algorithm for discrete tomography

Discrete Applied Mathematics - Special issue: IWCIA 2003 - Ninth international workshop on combinatorial image analysis
A reconstruction algorithm for L-convex polyominoes

Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Determination of Q-convex sets by X-rays

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)
Reconstruction of decomposable discrete sets from four projections

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

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

Theoretical Computer Science
On the ambiguity of reconstructing hv-convex binary matrices with decomposable configurations

Acta Cybernetica
Generation and empirical investigation of hv-convex discrete sets

SCIA'07 Proceedings of the 15th Scandinavian conference on Image analysis
The number of line-convex directed polyominoes having the same orthogonal projections

DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery
Complexity results for reconstructing binary images with disjoint components from horizontal and vertical projections

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The reconstruction of discrete sets from four projections is in general an NP-hard problem. In this paper we study the class of decomposable discrete sets and give an efficient reconstruction algorithm for this class using four projections. It is also shown that an arbitrary discrete set which is Q-convex along the horizontal and vertical directions and consists of several components is decomposable. As a consequence of decomposability we get that in a subclass of hv-convex discrete sets the reconstruction from four projections can also be solved in polynomial time. Possible extensions of our method are also discussed.