Solution methods for linear discrete ill-posed problems for color image restoration

DOI10.1007/s10543-018-0706-0zbMath1402.65031OpenAlexW2797012988WikidataQ113107274 ScholiaQ113107274MaRDI QIDQ1783374

M. El Guide, Enyinda Onunwor, Abdeslem Hafid Bentbib, Lothar Reichel, Khalide Jbilou

Publication date: 20 September 2018

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10543-018-0706-0

zbMATH Keywords

Tikhonov regularizationill-posed problemmultiple right-hand sidesGolub-Kahan bidiagonalizationcolor image restorationblock Golub-Kahan bidiagonalizationglobal Golub-Kahan bidiagonalization

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 (9)

RBF approximation of three dimensional PDEs using tensor Krylov subspace methods ⋮ Tensor Krylov subspace methods via the Einstein product with applications to image and video processing ⋮ Deflated and restarted Krylov subspace methods for Sylvester tensor equations ⋮ An effective alternating direction method of multipliers for color image restoration ⋮ Tensor extrapolation methods with applications ⋮ Some iterative approaches for Sylvester tensor equations. I: A tensor format of truncated loose simpler GMRES ⋮ Tensorial conditional gradient method for solving multidimensional ill-posed problems ⋮ Unnamed Item ⋮ Color image and video restoration using tensor CP decomposition

Uses Software

• LSQR
• Regularization tools
• blgaussexp
• CRAIG

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Oblique projection methods for linear systems with multiple right-hand sides
• Tikhonov regularization of large linear problems
• A block version of BiCGSTAB for linear systems with multiple right-hand sides
• \(L\)-curve curvature bounds via Lanczos bidiagonalization
• Old and new parameter choice rules for discrete ill-posed problems
• A block \(\mathrm{GCROT}(m, k)\) method for linear systems with multiple right-hand sides
• On Krylov projection methods and Tikhonov regularization
• Convergence analysis of minimization-based noise level-free parameter choice rules for linear ill-posed problems
• Discretization independent convergence rates for noise level-free parameter choice rules for the regularization of ill-conditioned problems
• Regularization tools version \(4.0\) for matlab \(7.3\)
• Global least squares method (Gl-LSQR) for solving general linear systems with several right-hand sides
• Global Golub-Kahan bidiagonalization applied to large discrete ill-posed problems
• GCV for Tikhonov regularization via global Golub–Kahan decomposition
• Deblurring Images
• A Block Lanczos Method for Computing the Singular Values and Corresponding Singular Vectors of a Matrix
• LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
• Rank-Deficient and Discrete Ill-Posed Problems
• Analysis of Projection Methods for Solving Linear Systems with Multiple Right-Hand Sides
• On the Lanczos Method for Solving Symmetric Linear Systems with Several Right-Hand Sides
• Coupled segmentation and denoising/deblurring models for hyperspectral material identification
• Block Gauss and Anti-Gauss Quadrature with Application to Networks
• On the Lanczos and Golub–Kahan reduction methods applied to discrete ill‐posed problems

This page was built for publication: Solution methods for linear discrete ill-posed problems for color image restoration