Convergence Rates for Inverse Problems with Impulsive Noise
From MaRDI portal
Abstract: We study inverse problems F(f) = g with perturbed right hand side g^{obs} corrupted by so-called impulsive noise, i.e. noise which is concentrated on a small subset of the domain of definition of g. It is well known that Tikhonov-type regularization with an L^1 data fidelity term yields significantly more accurate results than Tikhonov regularization with classical L^2 data fidelity terms for this type of noise. The purpose of this paper is to provide a convergence analysis explaining this remarkable difference in accuracy. Our error estimates significantly improve previous error estimates for Tikhonov regularization with L^1-fidelity term in the case of impulsive noise. We present numerical results which are in good agreement with the predictions of our analysis.
Recommendations
- Convergence rates for exponentially ill-posed inverse problems with impulsive noise
- On the lifting of deterministic convergence rates for inverse problems with stochastic noise
- Convergence Rates for Linear Inverse Problems in the Presence of an Additive Normal Noise
- Convergence rates and structure of solutions of inverse problems with imperfect forward models
- CONVERGENCE RATES FOR ILL-POSED INVERSE PROBLEMS WITH AN UNKNOWN OPERATOR
- Optimal rates of convergence for nonparametric statistical inverse problems
- Convergence rates for regularized solutions of integral equations from discrete noisy data
- Optimal convergence rates results for linear inverse problems in Hilbert spaces
- Convergence analysis of (statistical) inverse problems under conditional stability estimates
Cited in
(22)- Higher order convergence rates for Bregman iterated variational regularization of inverse problems
- Convergence of a spectral regularization of a time-reversed reaction-diffusion problem with high-order Sobolev-Gevrey smoothness
- Error estimates for variational regularization of inverse problems with general noise models for data and operator
- An iteration regularization method with general convex penalty for nonlinear inverse problems in Banach spaces
- On the lifting of deterministic convergence rates for inverse problems with stochastic noise
- Convergence rates for exponentially ill-posed inverse problems with impulsive noise
- CONVERGENCE RATES FOR ILL-POSED INVERSE PROBLEMS WITH AN UNKNOWN OPERATOR
- Levenberg-Marquardt method in Banach spaces with general convex regularization terms
- \(L^{\infty}\) fitting for inverse problems with uniform noise
- Generic half-quadratic optimization for image reconstruction
- Convergence Rates for Linear Inverse Problems in the Presence of an Additive Normal Noise
- A variational Bayesian method to inverse problems with impulsive noise
- Adaptivity and oracle inequalities in linear statistical inverse problems: a (numerical) survey
- Convergence rates and structure of solutions of inverse problems with imperfect forward models
- On the asymptotical regularization for linear inverse problems in presence of white noise
- EM-TV Methods for Inverse Problems with Poisson Noise
- Optimal convergence rates for Tikhonov regularization in Besov spaces
- Optimal convergence rates for sparsity promoting wavelet-regularization in Besov spaces
- Adaptive minimax optimality in statistical inverse problems via SOLIT—Sharp Optimal Lepskiĭ-Inspired Tuning
- Error estimates and converse results for a class of linear regularization methods for inverse problems in Banach spaces
- Maximum a posteriori testing in statistical inverse problems
- Simultaneous reconstruction of birth condition and mortality rate in an age-structured tumor model
This page was built for publication: Convergence Rates for Inverse Problems with Impulsive Noise
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5254134)
