Approximating Binary Images from Discrete X-Rays

DOI10.1137/S105262349935726XzbMath0987.05037MaRDI QIDQ2706341

Markus Wiegelmann, Sven de Vries, Peter Gritzmann

Publication date: 19 March 2001

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

zbMATH Keywords

matchingapproximation algorithmgreedy algorithmworst-case performanceset packingset coveringpolynomial timediscrete tomographyset partitioning

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Combinatorics in computer science (68R05) Combinatorial optimization (90C27) Biomedical imaging and signal processing (92C55) Statistical mechanics of crystals (82D25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of packing and covering (05B40)

Related Items (14)

A network flow algorithm for reconstructing binary images from discrete X-rays ⋮ On image reconstruction algorithms for binary electromagnetic geotomography ⋮ Stability in discrete tomography: some positive results ⋮ On the computational complexity of reconstructing three-dimensional lattice sets from their two-dimensional \(X\)-rays ⋮ An algorithm for discrete tomography ⋮ Reconstructing (0,1)-matrices from projections using integer programming ⋮ Generic iterative subset algorithms for discrete tomography ⋮ Fast binary CT using Fourier null space regularization (FNSR) ⋮ Discrete tomography by convex--concave regularization and D.C. programming ⋮ A Linear Programming Relaxation for Binary Tomography with Smoothness Priors ⋮ Parallel Block-Iterative Reconstruction Algorithms for Binary Tomography ⋮ Adaptive Reconstruction of Discrete-Valued Objects from few Projections ⋮ Application of a discrete tomography algorithm to computerized tomography ⋮ Detection of Subsurface Bubbles with Discrete Electromagnetic Geotomography

This page was built for publication: Approximating Binary Images from Discrete X-Rays