Weighting algorithm and relaxation strategies of the Landweber method for image reconstruction

DOI10.1155/2018/5674647zbMath1427.94015OpenAlexW2883623617MaRDI QIDQ1721104

Qian Wang, Guanghui Han, Gang-rong Qu

Publication date: 8 February 2019

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2018/5674647

Mathematics Subject Classification ID

Ill-posedness and regularization problems in numerical linear algebra (65F22) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Iterative numerical methods for linear systems (65F10)

Related Items (1)

A preconditioned Landweber iteration-based bundle adjustment for large-scale 3D reconstruction

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convergence results of Landweber iterations for linear systems
• Semi-convergence and relaxation parameters for a class of SIRT algorithms
• Landweber iterative methods for angle-limited image reconstruction
• Inversion of limited-angle tomographic data
• Inversion of limited-angle tomographic data. II
• Semiconvergence and Relaxation Parameters for Projected SIRT Algorithms
• On Diagonally Relaxed Orthogonal Projection Methods
• A study of fourier space methods for “limited angle” image reconstruction^*
• An introduction to the mathematical theory of inverse problems
• Component averaging: An efficient iterative parallel algorithm for large and sparse unstructured problems

This page was built for publication: Weighting algorithm and relaxation strategies of the Landweber method for image reconstruction