An algorithm for reconstructing special lattice sets from their approximate X-rays

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1953 LNCS, Issue , 2000, Pages 111-125

  Brunetti, Sara ^a   Daurat, Alain ^b   Del Lungo, Alberto ^c  

^a UNIVERSITY OF FLORENCE   (Italy)

^b UNIVERSITÉ CLERMONT AUVERGNE   (France)

^c Dipartimento di Matematica   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

GEOMETRY; POLYNOMIAL APPROXIMATION; SET THEORY;

CONVEXITY PROPERTIES; FINITE NUMBER; FINITE SUBSETS; INTEGER LATTICE; LATTICE DIRECTIONS; LATTICE SETS; POLYNOMIAL-TIME ALGORITHMS; Q-CONVEX SETS;

X RAYS; ALGORITHMS;

EID: 84867997175     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44438-6_10     Document Type: Conference Paper

References (15)

1. B. Aspvall, M. F. Plass and R. E. Tarjan, A linear-time algorithm for testing the truth of certain quantified Boolean formulas, Information Processing Letters, 8 3 (1979) 121-123. 114, 120
2. E. Barcucci, A. Del Lungo, M. Nivat and R. Pinzani, Reconstructing convex polyominoes from their horizontal and vertical projections, Theoretical Computer Science, 155 (1996) 321-347. 114, 120
3. Y. Boufkhad, O. Dubois and M. Nivat, Reconstructing (h,v)-convex bidimensional patterns of objects from approximate horizontal and vertical projections, preprint. 114, 120
4. S. Brunetti, A. Daurat, Reconstruction of Discrete Sets From Two or More Projections in Any Direction, Proc. of the Seventh International Workshop on Combinatorial Image Analysis (IWCIA 2000), Caen, (2000) 241-258. 114, 121
5. M. Chrobak, C. Dürr, Reconstructing hv-Convex Polyominoes from Orthogonal Projections, Information Processing Letters, 69 6 (1999) 283-289. 114, 120
6. A. Daurat, Uniqueness of the reconstruction of Q-convex from their projections, preprint. 114, 124
7. A. Daurat, A. Del Lungo and M. Nivat, The medians of discrete sets according to some linear metrics, Discrete & Computational Geometry, 23 (2000) 465-483. 116
8. R. J. Gardner and P. Gritzmann, Discrete tomography: determination of finite sets by X-rays, Trans. Amer. Math. Soc., 349 (1997) 2271-2295. 114
9. R. J. Gardner, P. Gritzmann and D. Prangenberg, On the computational complexity of reconstructing lattice sets from their X-rays, Discrete Mathematics, 202 (1999) 45-71. 113
10. A. Kuba and G. T. Herman, Discrete Tomography: A Historical Overview, in Discrete Tomography: Foundations, Algorithms and Applications, editors G. T. Herman and A. Kuba, Birkhauser, Boston, MA, USA, (1999) 3-34. 113
11. L. Mirski, Combinatorial theorems and integral matrices, Journal of Combinatorial Theory, 5 (1968) 30-44. 121
12. R. W. Irving and M. R. Jerrum, Three-dimensional statistical data security problems, SIAM Journal of Computing, 23 (1994) 170-184. 113
13. C. Kisielowski, P. Schwander, F. H. Baumann, M. Seibt, Y. Kim and A. Ourmazd, An approach to quantitative high-resolution transmission electron microscopy of crystalline materials, Ultramicroscopy, 58 (1995) 131-155. 113
14. G. P. M. Prause and D. G. W. Onnasch, Binary reconstruction of the heart chambers from biplane angiographic image sequence, IEEE Transactions Medical Imaging, 15 (1996) 532-559. 113
15. A. R. Shliferstein and Y. T. Chien, Switching components and the ambiguity problem in the reconstruction of pictures from their projections, Pattern Recognition, 10 (1978) 327-340. 113