Binary tomography by iterating linear programs from noisy projections

Authors:
Stefan Weber;Thomas Schüle;Joachim Hornegger;Christoph Schnörr
Affiliations:
Dept. M&CS, CVGPR-Group, University of Mannheim, Mannheim, Germany;Dept. M&CS, CVGPR-Group, University of Mannheim, Mannheim, Germany;Erlangen-Nürnberg Dept. CS, Friedrich-Alexander University, Erlangen, Germany;Dept. M&CS, CVGPR-Group, University of Mannheim, Mannheim, Germany
Venue:
IWCIA'04 Proceedings of the 10th international conference on Combinatorial Image Analysis
Year:
2004

Citing 4
Cited 7

The discrete Radon transform and its approximate inversion via linear programming

Discrete Applied Mathematics
Mathematical methods in image reconstruction

Mathematical methods in image reconstruction
A D. C. Optimization Algorithm for Solving the Trust-Region Subproblem

SIAM Journal on Optimization
Approximating Binary Images from Discrete X-Rays

SIAM Journal on Optimization

A continuous approach for the concave cost supply problem via DC programming and DCA

Discrete Applied Mathematics
A Network Flow Algorithm for Reconstructing Binary Images from Continuous X-rays

Journal of Mathematical Imaging and Vision
On image reconstruction algorithms for binary electromagnetic geotomography

Theoretical Computer Science
Decision Trees in Binary Tomography for Supporting the Reconstruction of hv-Convex Connected Images

ACIVS '08 Proceedings of the 10th International Conference on Advanced Concepts for Intelligent Vision Systems
Discrete tomography reconstruction based on the multi-well potential

IWCIA'11 Proceedings of the 14th international conference on Combinatorial image analysis
A network flow algorithm for binary image reconstruction from few projections

DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery
On the non-additive sets of uniqueness in a finite grid

DGCI'13 Proceedings of the 17th IAPR international conference on Discrete Geometry for Computer Imagery

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we improve the behavior of a reconstruction algorithm for binary tomography in the presence of noise. This algorithm which has recently been published is derived from a primal-dual subgradient method leading to a sequence of linear programs. The objective function contains a smoothness prior that favors spatially homogeneous solutions and a concave functional gradually enforcing binary solutions. We complement the objective function with a term to cope with noisy projections and evaluate its performance.