Constraining by a family of strictly nonexpansive idempotent functions with applications in image reconstruction

DOI10.1007/s10543-012-0414-0zbMath1273.65035OpenAlexW2033558290MaRDI QIDQ2376863

Ioana Pantelimon, Constantin Popa

Publication date: 26 June 2013

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10543-012-0414-0

zbMATH Keywords

projection algorithmimage reconstructionleast squares problemsKaczmarz algorithmJacobi algorithmconstraining strategyCimmino algorithmdiagonal weighting algorithmstrictly nonexpansive functions

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Iterative numerical methods for linear systems (65F10)

Related Items (2)

Randomized Kaczmarz algorithm with averaging and block projection ⋮ Family constraining of iterative algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Block-iterative methods for consistent and inconsistent linear equations
• Projection method for solving a singular system of linear equations and its applications
• A general extending and constraining procedure for linear iterative methods
• Contraining Strategies for Linear Iterative Processes
• Extended and constrained diagonal weighting algorithm with application to inverse problems in image reconstruction

This page was built for publication: Constraining by a family of strictly nonexpansive idempotent functions with applications in image reconstruction