Binary tomography by iterating linear programs from noisy projections

Weber S, Schüle T, Hornegger J, Schnörr C (2004)


Publication Type: Authored book, other

Publication year: 2004

Journal

Original Authors: Weber S., Schule T., Hornegger J., Schnörr C.

Publisher: Springer-verlag

Book Volume: 3322

Pages Range: 38-51

Journal Issue: null

DOI: 10.1007/978-3-540-30503-3_3

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. © Springer-Verlag 2004.

Authors with CRIS profile

Involved external institutions

How to cite

APA:

Weber, S., Schüle, T., Hornegger, J., & Schnörr, C. (2004). Binary tomography by iterating linear programs from noisy projections. Springer-verlag.

MLA:

Weber, Stefan, et al. Binary tomography by iterating linear programs from noisy projections. Springer-verlag, 2004.

BibTeX: Download