Binary Tomography by Iterating Linear Programs from Noisy Projections

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

Publication Type: Conference contribution

Publication year: 2004

Journal

Lecture Notes in Computer Science Springer Verlag

Publisher: Springer-verlag

Edited Volumes: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

City/Town: Berlin

Pages Range: 38-51

Conference Proceedings Title: Proceedings of International Workshop on Combinatorial Image Analysis (IWCIA)

Event location: Auckland

URI: http://www5.informatik.uni-erlangen.de/Forschung/Publikationen/2004/Weber04-BTB.pdf

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

Joachim Hornegger Lehrstuhl für Informatik 14 (Bild- und Sprachverarbeitung)

Involved external institutions

Universität Mannheim DE Germany (DE)

How to cite

APA:

Weber, S., Schüle, T., Hornegger, J., & Schnörr, C. (2004). Binary Tomography by Iterating Linear Programs from Noisy Projections. In Proceedings of International Workshop on Combinatorial Image Analysis (IWCIA) (pp. 38-51). Auckland: Berlin: Springer-verlag.

MLA:

Weber, Stefan, et al. "Binary Tomography by Iterating Linear Programs from Noisy Projections." Proceedings of the International Workshop on Combinatorial Image Analysis (IWCIA), Auckland Berlin: Springer-verlag, 2004. 38-51.

BibTeX: Download