A Linear Programming Relaxation for Binary Tomography with Smoothness Priors

DOI10.1016/S1571-0653(04)00490-1zbMath1173.68872MaRDI QIDQ3438923

Stefan Weber, Joachim Hornegger, Christoph Schnörr

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

regularizationcombinatorial optimizationapproximation algorithmdiscrete tomographyMarkov random fieldsLP-relaxation

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Approximation algorithms (68W25)

Related Items (6)

A network flow algorithm for reconstructing binary images from discrete X-rays ⋮ On image reconstruction algorithms for binary electromagnetic geotomography ⋮ Discrete tomography by convex--concave regularization and D.C. programming ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• The discrete Radon transform and its approximate inversion via linear programming
• Discrete tomography. Foundations, algorithms, and applications
• Approximating Binary Images from Discrete X-Rays
• Mathematical Methods in Image Reconstruction
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
• Component averaging: An efficient iterative parallel algorithm for large and sparse unstructured problems
• Binary steering in discrete tomography reconstruction with sequential and simultaneous iterative algorithms

This page was built for publication: A Linear Programming Relaxation for Binary Tomography with Smoothness Priors