论文信息 - Reconstruction of discrete sets from two absorbed projections: an algorithm

Reconstruction of discrete sets from two absorbed projections: an algorithm

Abstract Two left and right horizontal absorbed projections along a single direction uniquely determine a row of a binary matrix. After proving this result we give a polynomial time algorithm which reconstructs such a row and we analyze its performances by determining the worst case complexity.

Andrea Frosini | Elena Barcucci | Simone Rinaldi

[1] Attila Kuba,et al. A sufficient condition for non-uniqueness in binary tomography with absorption , 2005, Theor. Comput. Sci..

[2] Attila Kuba,et al. The reconstruction of two-directionally connected binary patterns from their two orthogonal projections , 1983 .

[3] Attila Kuba,et al. Reconstruction of Discrete Sets with Absorption , 2000, DGCI.

[4] Attila Kuba,et al. Reconstruction of Binary Matrices from Absorbed Projections , 2002, DGCI.

[5] R. Gardner. Geometric Tomography: Parallel X-rays of planar convex bodies , 2006 .

[6] G. Herman,et al. Discrete tomography : foundations, algorithms, and applications , 1999 .