Approximating binary images from discrete X-rays

SIAM Journal on Optimization

Volumn 11, Issue 2, 2000, Pages 522-546

  Gritzmann, Peter ^a   De Vries, Sven ^a   Wiegelmann, Markus ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

Approximation algorithm; Discrete tomography; Greedy algorithm; Matching; Polynomial time; Set covering; Set packing; Set partitioning; Worst case performance

Indexed keywords

EID: 0034353735     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S105262349935726X     Document Type: Article

References (20)

1. S. CHANG, The reconstruction of binary patterns from their projections, Comm. ACM, 14 (1971), pp. 21-25.
2. R. DUH AND M. FÜRER, Approximation of k-set cover by semi-local optimization, in Proceedings, STOC '97, ACM, New York, pp. 256-264.
3. P. FISHBURN, P. SCHWANDER, L. SHEPP, AND R. VANDERBEI, The discrete Radon transform and its approximate inversion via linear programming, Discrete Appl. Math., 75 (1997), pp. 39-61.
4. H. GABOW AND R. TARJAN, Faster scaling algorithms for general graph-matching problems, J. ACM, 38 (1991), pp. 815-853.
5. R. GARDNER, P. GRITZMANN, AND D. PRANGENBERG, On the computational complexity of reconstructing lattice sets from their X-rays, Discrete Math., 202 (1999), pp. 45-71.
6. M. GAREY AND D. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman, San Francisco, CA, 1979.
7. J. GERBRANDS AND C. SLUMP, A network flow approach to reconstruction of the left ventricle from two projections, Comput. Graphics Image Process., 18 (1982), pp. 18-36.
8. O. GOLDSCHMIDT, D. HOCHBAUM, AND G. YU, A modified greedy heuristic for the set covering problem with improved worst case bound, Inform. Process. Lett., 48 (1993), pp. 305-310.
9. P. GRITZMANN, On the reconstruction of finite lattice sets from their X-rays, in Proceedings 7th International Workshop, DGCI '97, Montpellier, France, E. Ahronovitz and C. Fiorio, eds., Lecture Notes in Comput. Sci. 1347, Springer, Berlin, 1997, pp. 19-32.
10. P. GRITZMANN, D. PRANGENBERG, S. DE VRIES, AND M. WIEGELMANN, Success and failure of certain reconstruction and uniqueness algorithms in discrete tomography, Int. J. Imaging Syst. Technol., 9 (1998), pp. 101-109.
11. M. HALLDÓRSSON, Approximating k-set cover and complementary graph coloring, in Proceedings 5th International Integer Programming and Combinatorial Optimization Conference, Lecture Notes in Comput. Sci., Springer-Verlag, Berlin, 1996, pp. 118-131.
12. C. A. J. HURKENS AND A. SCHRIJVER, On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems, SIAM J. Discrete Math., 2 (1989), pp. 68-72.
13. C. KISIELOWSKI, P. SCHWANDER, F. BAUMANN, M. SEIBT, Y. KIM, AND A. OURMAZD, An approach to quantitative high-resolution transmission electron microscopy of crystalline materials, Ultramicroscopy, 58 (1995), pp. 131-155.
14. G. LORENTZ, A problem of plane measure, Amer. J. Math., 71 (1949), pp. 417-426.
15. H. RYSER, Combinatorial properties of matrices of zeros and ones, Canad. J. Math., 9 (1957), pp. 371-377.
16. H. RYSER, Combinatorial Mathematics, Carus Math. Monogr. 14, Mathematical Association of America and John Wiley, New York, 1963, ch. 6, Matrices of zeros and ones, pp. 61-78.
17. A. SCHRIJVER, Theory of Linear and Integer Programming, Wiley, New York, 1986.
18. P. SCHWANDER, C. KISIELOWSKI, F. BAUMANN, Y. KIM, AND A. OURMAZD, Mapping projected potential, interfacial roughness, and composition in general crystalline solids by quantitative transmission electron microscopy, Phys. Rev. Lett., 71 (1993), pp. 4150-4153.
19. S. DE VRIES, Discrete Tomography, Packing and Covering, and Stable Set Problems: Polytopes and Algorithms, Ph.D. thesis, Technische Universität München, München, Germany, 1999.
20. M. WIEGELMANN, Gröbner Bases and Primal Algorithms in Discrete Tomography, Ph.D. thesis, Technische Universität München, München, Germany, 1998.