Modern regularization methods for inverse problems

M Benning, M Burger - Acta numerica, 2018 - cambridge.org
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 …

[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 …

A guide to the TV zoo

M Burger, ACG Mennucci, S Osher, M Rumpf… - Level Set and PDE …, 2013 - Springer
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 …

Robust sparse analysis regularization

S Vaiter, G Peyré, C Dossal… - IEEE Transactions on …, 2012 - ieeexplore.ieee.org
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 …

Model selection with low complexity priors

S Vaiter, M Golbabaee, J Fadili… - Information and Inference …, 2015 - academic.oup.com
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 …

Model consistency of partly smooth regularizers

S Vaiter, G Peyré, J Fadili - IEEE Transactions on Information …, 2017 - ieeexplore.ieee.org
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 …

One condition for solution uniqueness and robustness of both l1-synthesis and l1-analysis minimizations

H Zhang, M Yan, W Yin - Advances in Computational Mathematics, 2016 - Springer
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 …

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 …

Guarantees of total variation minimization for signal recovery

JF Cai, W Xu - Information and Inference: A Journal of the IMA, 2015 - academic.oup.com
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 …

Deep Learning Versus -Minimization for Compressed Sensing Photoacoustic Tomography

S Antholzer, J Schwab… - 2018 IEEE International …, 2018 - ieeexplore.ieee.org
We investigate compressed sensing (CS) techniques for reducing the number of
measurements in photoacoustic tomography (PAT). High resolution imaging from CS data …