Discrete Q-convex sets reconstruction from discrete point X-rays

Authors:
Fatma Abdmouleh;Alain Daurat;Mohamed Tajine
Affiliations:
LSIIT CNRS UMR 7005, Strasbourg University, Illkirch-Graffenstaden, France;LSIIT CNRS UMR 7005, Strasbourg University, Illkirch-Graffenstaden, France;LSIIT CNRS UMR 7005, Strasbourg University, Illkirch-Graffenstaden, France
Venue:
IWCIA'11 Proceedings of the 14th international conference on Combinatorial image analysis
Year:
2011

Citing 7
Cited 1

Reconstructing convex polyominoes from horizontal and vertical projections

Theoretical Computer Science
Reconstruction of Discrete Sets from Three or More X-Rays

CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
An algorithm reconstructing convex lattice sets

Theoretical Computer Science
Discrete Point X-rays

SIAM Journal on Discrete Mathematics
Random generation of Q-convex sets

Theoretical Computer Science
Determination of Q-convex sets by X-rays

Theoretical Computer Science
Stability in Discrete Tomography: some positive results

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

Reconstruction of quantitative properties from x-rays

DGCI'13 Proceedings of the 17th IAPR international conference on Discrete Geometry for Computer Imagery

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of reconstructing sets from their point X-rays is considered. We study the problem for Q-convex sets which are sets having special convexity properties. These properties allow the reconstruction with few projections. In this paper we introduce the filling operations adapted to the considered context and we provide an algorithm for reconstructing Q-convex sets from their point X-rays for two source points. The reconstruction of Q-convex sets would be an intermediate step for reconstructing convex sets from their point X-rays.