Relaxation methods for image reconstruction

DOI10.1145/359340.359351zbMath0367.68065OpenAlexW1999751856MaRDI QIDQ4144224

Arnold Lent, Peter H. Lutz, Gabor T. Herman

Publication date: 1978

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/359340.359351

Mathematics Subject Classification ID

Linear programming (90C05) Linear inequalities of matrices (15A39) Pattern recognition, speech recognition (68T10) Algorithms in computer science (68W99)

Related Items (21)

Strong convergence of projection-like methods in Hilbert spaces ⋮ Single projection Kaczmarz extended algorithms ⋮ On some optimization techniques in image reconstruction from projections ⋮ Parallel application of block-iterative methods in medical imaging and radiation therapy ⋮ An iterative row-action method for interval convex programming ⋮ Faster randomized block sparse Kaczmarz by averaging ⋮ On the Convergence of Stochastic Gradient Descent for Nonlinear Ill-Posed Problems ⋮ The extensions of convergence rates of Kaczmarz-type methods ⋮ Iterative algorithms for large partitioned linear systems, with applications to image reconstruction ⋮ Line search acceleration of iterative methods ⋮ Strong underrelaxation in Kaczmarz's method for inconsistent systems ⋮ A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem ⋮ A geometric approach to quadratic optimization: an improved method for solving strongly underdetermined systems in CT ⋮ Convergence properties of ART and SOR algorithms ⋮ Parallel ART for image reconstruction in CT using processor arrays ⋮ A randomized Kaczmarz algorithm with exponential convergence ⋮ A projection method for least-squares solutions to overdetermined systems of linear inequalities ⋮ Randomized Projection Methods for Linear Systems with Arbitrarily Large Sparse Corruptions ⋮ Sampled limited memory methods for massive linear inverse problems ⋮ An analysis of stochastic variance reduced gradient for linear inverse problems ^* ⋮ A relaxed version of Bregman's method for convex programming

This page was built for publication: Relaxation methods for image reconstruction