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 …
[KNIHA][B] Regularization methods in Banach spaces
T Schuster, B Kaltenbacher, B Hofmann… - 2012 - books.google.com
Regularization methods aimed at finding stable approximate solutions are a necessary tool
to tackle inverse and ill-posed problems. Inverse problems arise in a large variety of …
to tackle inverse and ill-posed problems. Inverse problems arise in a large variety of …
A guide to the TV zoo
Total variation methods and similar approaches based on regularizations with ℓ 1-type
norms (and seminorms) have become a very popular tool in image processing and inverse …
norms (and seminorms) have become a very popular tool in image processing and inverse …
Robust sparse analysis regularization
This paper investigates the theoretical guarantees of ℓ^1-analysis regularization when
solving linear inverse problems. Most of previous works in the literature have mainly focused …
solving linear inverse problems. Most of previous works in the literature have mainly focused …
Model selection with low complexity priors
Regularization plays a pivotal role when facing the challenge of solving ill-posed inverse
problems, where the number of observations is smaller than the ambient dimension of the …
problems, where the number of observations is smaller than the ambient dimension of the …
Model consistency of partly smooth regularizers
This paper studies least-square regression penalized with partly smooth convex
regularizers. This class of penalty functions is very large and versatile, and allows to …
regularizers. This class of penalty functions is very large and versatile, and allows to …
One condition for solution uniqueness and robustness of both l1-synthesis and l1-analysis minimizations
The ℓ 1-synthesis model and the ℓ 1-analysis model recover structured signals from their
undersampled measurements. The solution of the former is a sparse sum of dictionary …
undersampled measurements. The solution of the former is a sparse sum of dictionary …
Convergence rates in ℓ1-regularization if the sparsity assumption fails
M Burger, J Flemming, B Hofmann - Inverse Problems, 2013 - iopscience.iop.org
Variational sparsity regularization based on ℓ 1-norms and other nonlinear functionals has
gained enormous attention recently, both with respect to its applications and its …
gained enormous attention recently, both with respect to its applications and its …
Guarantees of total variation minimization for signal recovery
In this paper, we consider using total variation (TV) minimization to recover signals whose
gradients have a sparse support, from a small number of measurements. We establish a …
gradients have a sparse support, from a small number of measurements. We establish a …
Deep Learning Versus -Minimization for Compressed Sensing Photoacoustic Tomography
We investigate compressed sensing (CS) techniques for reducing the number of
measurements in photoacoustic tomography (PAT). High resolution imaging from CS data …
measurements in photoacoustic tomography (PAT). High resolution imaging from CS data …