On the computational complexity of reconstructing lattice sets from their X-rays

Discrete Mathematics

Volumn 202, Issue 1-3, 1999, Pages 45-71

  Gardner, R J ^a   Gritzmann, P ^b   Prangenberg, D ^c  

^a WESTERN WASHINGTON UNIVERSITY   (United States)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^c UNIVERSITY OF TRIER   (Germany)

Author keywords

hardness; Computational complexity; Data compression; Data security; Discrete tomography; High resolution transmission electron microscopy; Image processing; Lattice; Polynomial time algorithm; Tomography; hardness

Indexed keywords

EID: 0003003948     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(98)00347-1     Document Type: Article

References (26)

1. R. Aharoni, G.T. Herman, A. Kuba, Binary vectors partially determined by linear equation systems, Discrete Math. 171 (1997) 1-16.
2. E. Barcucci, A. Del Lungo, M. Nivat, R. Pinzani, X-rays characterizing some classes of digital pictures, preprint.
3. E. Barcucci, A. Del Lungo, M. Nivat, R. Pinzani, Reconstructing convex polyominoes from their horizontal and vertical projections, Theoret. Comput. Sci. 155 (1996) 321-347.
4. G. Bianchi, M. Longinetti, Reconstructing plane sets from projections, Discrete Comput. Geom. 5 (1990) 223-242.
5. S.-K. Chang, The reconstruction of binary patterns from their projections, Comm. ACM 14 (1971) 21-24.
6. M. Dyer, R. Kannan, J. Mount, Sampling contingency tables, Random Structures Algorithms 10 (1997) 487-506.
7. P.C. Fishburn, J.C. Lagarias, J.A. Reeds, L.A. Shepp, Sets uniquely determined by projections on axes. II. Discrete case, Discrete Math. 91 (1991) 149-159.
8. P.C. Fishburn, P. Schwander, L.A. Shepp, J. Vanderbei, The discrete Radon transform and its approximate inversion via linear programming, Discrete Appl. Math. 75 (1997) 39-62.
9. R.J. Gardner, P. Gritzmann, Discrete tomography: determination of finite sets by X-rays, Trans. Amer. Math. Soc. 349 (1997) 2271-2295.
10. R.J. Gardner, P. Gritzmann, D. Prangenberg, On the reconstruction of binary images from their discrete Radon transforms, Proc. Int. Symp. on Optical Science, Engineering, and Instrumentation, SPIE, 1996, pp. 121-132.
11. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
12. J.J. Gerbrands, C.H. Slump, A network flow approach to reconstruction of the left ventricle from two projections, Comput. Graph. Image Process. 18 (1982) 18-36.
13. R. Gordon, G.T. Herman, Reconstruction of pictures from their projections, Comm. ACM 14 (1971) 759-768.
14. D. Gusfield, A graph theoretic approach to statistical data security, SIAM J. Comput. 17 (1988) 552-571.
15. R.W. Irving, M.R. Jerrum, Three-dimensional statistical data security problems, SIAM J. Comput. 23 (1994) 170-184.
16. D.S. Johnson, A catalog of complexity classes, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, vol. A, Elsevier, Amsterdam, 1990, pp. 67-161.
17. C. Kisielowski, P. Schwander, F.H. Baumann, M. Seibt, Y. Kim, A. Ourmazd, An approach to quantitative high-resolution transmission electron microscopy of crystalline materials, Ultramicroscopy, 58 (1995) 131-155.
18. D. Kölzow, A. Kuba, A. Volčič, An algorithm for reconstructing convex bodies from their projections, Discrete Comput. Geom. 4 (1989) 205-237.
19. A. Kuba, The reconstruction of two-directionally connected binary patterns from their two orthogonal projections, Comput. Vision, Graph. Image Process. 27 (1984) 249-265.
20. F. Natterer, The Mathematics of Computerized Tomography, Wiley and Teubner, Stuttgart, 1986.
21. A. Rényi, On projections of probability distributions, Acta Math. Acad. Sci. Hung. 3 (1952) 131-142.
22. H.J. Ryser, Combinatorial Mathematics, Mathematical Association of America and Quinn & Boden, Rahway, New Jersey, 1963.
23. T.J. Schaefer, The complexity of satisfiability problems, Proc. 10th Ann. ACM Symp. on Theory of Computing, ACM, New York, 1978, pp. 216-226.
24. P. Schwander, C. Kisielowski, M. Seibt, F.H. Baumann, Y. Kim, A. Ourmazd, Mapping projected potential, interfacial roughness, and composition in general crystalline solids by quantitative transmission electron microscopy, Phys. Rev. Lett. 71 (1993) 4150-4153.
25. A. Shliferstein, Y.T. Chien, Switching components and the ambiguity problem in the reconstruction of pictures from their projections, Pattern Recognition 10 (1978) 327-340.
26. L.G. Valiant, The complexity of computing the permanent, Theoret. Comput. Sci. 8 (1979) 189-201.