Comparison of approaches based on optimization and algebraic iteration for binary tomography
From MaRDI portal
Publication:549001
DOI10.1016/j.cpc.2010.09.004zbMath1219.65041OpenAlexW2026924759MaRDI QIDQ549001
Publication date: 30 June 2011
Published in: Computer Physics Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cpc.2010.09.004
regularizationnumerical examplessimulated annealingdiscrete tomographybinary tomographyalgebraic iterationcomputation efficiency
Ill-posedness and regularization problems in numerical linear algebra (65F22) Combinatorial optimization (90C27)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Applications of critical temperature in minimizing functions of continuous variables with simulated annealing algorithm
- Application of simulated annealing for multispectral tomography
- Generic iterative subset algorithms for discrete tomography
- A randomized Kaczmarz algorithm with exponential convergence
- Discrete tomography. Foundations, algorithms, and applications
- Discrete tomography by convex--concave regularization and D.C. programming
- Reconstruction of a uniform star object from interior x-ray data: uniqueness, stability and algorithm
- Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithm—Corrigenda for this article is available here
- Numerical tools for analysis and solution of Fredholm integral equations of the first kind
- Binary steering in discrete tomography reconstruction with sequential and simultaneous iterative algorithms
This page was built for publication: Comparison of approaches based on optimization and algebraic iteration for binary tomography