An iterative algorithm for nonlinear inverse problems with joint sparsity constraints in vector-valued regimes and an application to color image inpainting

DOI10.1088/0266-5611/23/5/005zbMath1131.47055OpenAlexW2062052599MaRDI QIDQ5424711

Ronny Ramlau, Gerd Teschke

Publication date: 6 November 2007

Published in: Inverse Problems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1088/0266-5611/23/5/005

zbMATH Keywords

iterative methodsframenonlinear inverse problemssparse expansioncolor image inpainting recolorization

Mathematics Subject Classification ID

Orthogonal functions and polynomials, general theory of nontrigonometric harmonic analysis (42C05) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Nonlinear ill-posed problems (47J06) Numerical methods for inverse problems for integral equations (65R32) Numerical solution to inverse problems in abstract spaces (65J22)

Related Items

The application of joint sparsity and total variation minimization algorithms to a real-life art restoration problem, Consistency of learning algorithms using Attouch–Wets convergence, Sparse and switching infinite horizon optimal controls with mixed-norm penalizations, Solving a class of nonlinear inverse problems using a feedback control approach, Coorbit theory, multi-\(\alpha \)-modulation frames, and the concept of joint sparsity for medical multichannel data analysis, Sparse regression using mixed norms, Linear convergence of iterative soft-thresholding, Modern regularization methods for inverse problems, Sparsity and persistence: mixed norms provide simple signal models with dependent coefficients, Quasi-linear Compressed Sensing, Locally sparse reconstruction using the \(\ell^{1,\infty}\)-norm