Modern regularization methods for inverse problems
Regularization methods are a key tool in the solution of inverse problems. They are used to
introduce prior knowledge and allow a robust approximation of ill-posed (pseudo-) inverses …
introduce prior knowledge and allow a robust approximation of ill-posed (pseudo-) inverses …
Linear convergence of iterative soft-thresholding
In this article a unified approach to iterative soft-thresholding algorithms for the solution of
linear operator equations in infinite dimensional Hilbert spaces is presented. We formulate …
linear operator equations in infinite dimensional Hilbert spaces is presented. We formulate …
Sparse regression using mixed norms
M Kowalski - Applied and Computational Harmonic Analysis, 2009 - Elsevier
Mixed norms are used to exploit in an easy way, both structure and sparsity in the framework
of regression problems, and introduce implicitly couplings between regression coefficients …
of regression problems, and introduce implicitly couplings between regression coefficients …
Vector sparse representation of color image using quaternion matrix analysis
Traditional sparse image models treat color image pixel as a scalar, which represents color
channels separately or concatenate color channels as a monochrome image. In this paper …
channels separately or concatenate color channels as a monochrome image. In this paper …
An iterative regularization method for the solution of the split feasibility problem in Banach spaces
F Schöpfer, T Schuster, AK Louis - Inverse problems, 2008 - iopscience.iop.org
The split feasibility problem (SFP) consists of finding a common point in the intersection of
finitely many convex sets, where some of the sets arise by imposing convex constraints in …
finitely many convex sets, where some of the sets arise by imposing convex constraints in …
Sparsity and persistence: mixed norms provide simple signal models with dependent coefficients
M Kowalski, B Torrésani - Signal, image and video processing, 2009 - Springer
Sparse regression often uses ℓ p norm priors (with p< 2). This paper demonstrates that the
introduction of mixed-norms in such contexts allows one to go one step beyond in signal …
introduction of mixed-norms in such contexts allows one to go one step beyond in signal …
Regularization of linear and non-linear geophysical ill-posed problems with joint sparsity constraints
A Gholami, HR Siahkoohi - Geophysical Journal International, 2010 - academic.oup.com
In this paper, we deal with the solution of linear and non-linear geophysical ill-posed
problems by requiring the solution to have sparse representations in two appropriate …
problems by requiring the solution to have sparse representations in two appropriate …
Quaternion-based weighted nuclear norm minimization for color image denoising
Y Yu, Y Zhang, S Yuan - Neurocomputing, 2019 - Elsevier
The quaternion method plays an important role in color image processing, because it
represents the color image as a whole rather than as a separate color space component …
represents the color image as a whole rather than as a separate color space component …
On Tikhonov regularization with non-convex sparsity constraints
CA Zarzer - Inverse Problems, 2009 - iopscience.iop.org
This paper deals with a theoretical analysis of a novel regularization technique for
(nonlinear) inverse problems, in the field of the so-called sparsity promoting regularizations …
(nonlinear) inverse problems, in the field of the so-called sparsity promoting regularizations …
Linear convergence rates for Tikhonov regularization with positively homogeneous functionals
M Grasmair - Inverse Problems, 2011 - iopscience.iop.org
The goal of this paper is the formulation of an abstract setting that can be used for the
derivation of linear convergence rates for a large class of sparsity promoting regularization …
derivation of linear convergence rates for a large class of sparsity promoting regularization …