Perturbation‐resilient block‐iterative projection methods with application to image reconstruction from projections
From MaRDI portal
Publication:3563617
DOI10.1111/j.1475-3995.2009.00695.xzbMath1191.94013OpenAlexW2141976257WikidataQ36487853 ScholiaQ36487853MaRDI QIDQ3563617
Gabor T. Herman, Ran Davidi, Yair Censor
Publication date: 31 May 2010
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: http://europepmc.org/articles/pmc3529939
projection methodsimage reconstructionproduct spacesuperiorizationperturbation resilienceconvex feasibilityblock-iterative algorithms
Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Software, source code, etc. for problems pertaining to linear algebra (15-04)
Related Items
Feasibility-based fixed point networks ⋮ A non-interior continuation algorithm for solving the convex feasibility problem ⋮ An accelerated successive orthogonal projections method for solving large-scale linear feasibility problems ⋮ Bounded perturbation resilience of the viscosity algorithm ⋮ A new convergence analysis and perturbation resilience of some accelerated proximal forward–backward algorithms with errors ⋮ A unified treatment of some perturbed fixed point iterative methods with an infinite pool of operators ⋮ Can linear superiorization be useful for linear optimization problems? ⋮ Perturbation resilience and superiorization methodology of averaged mappings ⋮ Bounded perturbation resilience and superiorization techniques for the projected scaled gradient method ⋮ Superiorization-based multi-energy CT image reconstruction ⋮ Superiorization and bounded perturbation resilience of a gradient projection algorithm solving the convex minimization problem ⋮ Convergence and perturbation resilience of dynamic string-averaging projection methods ⋮ Bounded perturbation resilience and superiorization techniques for a modified proximal gradient method ⋮ On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints ⋮ Superiorization of EM algorithm and its application in single-photon emission computed tomography (SPECT) ⋮ Decomposition in derivative-free optimization ⋮ Derivative-free superiorization with component-wise perturbations ⋮ Projected subgradient minimization versus superiorization ⋮ Bounded perturbation resilience of projected scaled gradient methods ⋮ An analysis of the superiorization method via the principle of concentration of measure ⋮ Generalized row-action methods for tomographic imaging ⋮ Convergence of string-averaging method for a class of operators ⋮ New inertial proximal gradient methods for unconstrained convex optimization problems ⋮ Strong convergence of over-relaxed multi-parameter proximal scaled gradient algorithm and superiorization ⋮ A generalized block-iterative projection method for the common fixed point problem induced by cutters ⋮ Multi-channel Potts-based reconstruction for multi-spectral computed tomography ⋮ XCT image reconstruction by a modified superiorized iteration and theoretical analysis ⋮ The superiorization method with restarted perturbations for split minimization problems with an application to radiotherapy treatment planning ⋮ Strict Fejér monotonicity by superiorization of feasibility-seeking projection methods
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonlinear total variation based noise removal algorithms
- Finding common fixed points of a class of paracontractions
- Block-iterative methods for consistent and inconsistent linear equations
- Iterative algorithms for large partitioned linear systems, with applications to image reconstruction
- Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
- The approximation of fixed points of compositions of nonexpansive mappings in Hilbert space
- Block-iterative algorithms for solving convex feasibility problems in Hilbert and in Banach spaces
- How good are projection methods for convex feasibility problems?
- A fast algorithm for solving a linear feasibility problem with application to intensity-modulated radiation therapy
- Image reconstruction from a small number of projections
- Decomposition through formalization in a product space
- On the use of Cimmino's simultaneous projections method for computing a solution of the inverse problem in radiation therapy treatment planning
- Digital image restoration: A survey
- Convergence of String-Averaging Projection Schemes for Inconsistent Convex Feasibility Problems
- On Projection Algorithms for Solving Convex Feasibility Problems
This page was built for publication: Perturbation‐resilient block‐iterative projection methods with application to image reconstruction from projections
