A Benchmark Evaluation of Large-Scale Optimization Approaches to Binary Tomography

DOI10.1007/11907350_13zbMATH Open1136.68611OpenAlexW1889377317MaRDI QIDQ5386017FDOQ5386017

Authors: Stefan Weber, Antal Nagy, T. Schüle, Christoph Schnörr, Attila Kuba 

Publication date: 17 April 2008

Published in: Discrete Geometry for Computer Imagery (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11907350_13

Recommendations

• Discrete tomography by convex--concave regularization and D.C. programming
• Discrete tomography by convex-concave regularization using linear und quadratic optimization.
• A spectral projected gradient optimization for binary tomography
• Analysis and optimization of an algorithm for discrete tomography
• Variational reconstruction with DC-programming

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited In (7)

• Multi-resolution method for binary tomography
• Generic iterative subset algorithms for discrete tomography
• The ordered subsets mirror descent optimization method with applications to tomography
• Analysis and optimization of an algorithm for discrete tomography
• Discrete tomography by convex-concave regularization using linear und quadratic optimization.
• Discrete tomography reconstruction based on the multi-well potential
• A spectral projected gradient optimization for binary tomography

Uses Software

• SPG

This page was built for publication: A Benchmark Evaluation of Large-Scale Optimization Approaches to Binary Tomography

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5386017)