Shrinkage versus deconvolution
Inverse ProblemsPublished 19 September 2007
Esther Klann, Michael Kühn, Dirk A. Lorenz, Peter Maaß, Herbert Thiele
Citations19
SJR quartileQ1
SJR score0.90
SNIP1.22
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
This paper analyzes the problem of deconvolution, especially for signals with peak-like structures. We present and analyze a so-called 'practical approach', which mainly consists of a wavelet shrinkage. It is shown that this practical approach is indeed a regularization procedure, and furthermore, it leads to a convergence rate that is superior to classical linear regularization theory. Our results are based on modeling signals and operators in Besov spaces, especially exploiting the fact that peaks have higher regularity in Besov spaces than in Sobolev spaces.
Keywords
Computer ScienceMathematics
Elsevier eBooksA Wavelet Tour of Signal Processing
16,401 Citations1999Stéphane Mallat
An introduction to a Transient World and an Approximation Tour of Wavelet Packet and Local Cosine Bases.
Communications on Pure and Applied MathematicsStable signal recovery from incomplete and inaccurate measurements
7,170 Citations2006Emmanuel J. Candès, Justin Romberg +1 more
It is shown that it is possible to recover x0 accurately based on the data y from incomplete and contaminated observations.
Communications on Pure and Applied MathematicsAn iterative thresholding algorithm for linear inverse problems with a sparsity constraint
4,957 Citations2004Ingrid Daubechies, Michel Defrise +1 more
It is proved that replacing the usual quadratic regularizing penalties by weighted 𝓁p‐penalized penalties on the coefficients of such expansions, with 1 ≤ p ≤ 2, still regularizes the problem.
Society for Industrial and Applied Mathematics eBooksImage Processing and Analysis
903 Citations2005Tony F. Chan, Jianhong Shen
The author’s research focused on image modeling and representation, which focused on the representation of black-and-white images through the lens of a discrete-time model.
Image Processing and Analysis
609 Citations1999
Handbook of numerical analysisWavelet methods in numerical analysis
180 Citations2000Albert Cohen
The chapter describes the decomposition and reconstruction algorithms that can be used to compute the coefficients of a function in two elementary wavelet bases and it investigates the way these schemes can be generalized in a natural way to multivariate functions.
SIAM Journal on Scientific ComputingIterated Hard Shrinkage for Minimization Problems with Sparsity Constraints
146 Citations2008Kristian Bredies, Dirk A. Lorenz
It is shown that the hard shrinkage algorithm is a special case of the generalized conditional gradient method with quadratic discrepancy term and strong convergence properties of the iterates with convergence rates $\mathcal{O}(n^{-1/2})$ and $\lambda^n)$ for $p=1$ and $1 < p \leq 2$, respectively.
Computational Optimization and ApplicationsA generalized conditional gradient method and its connection to an iterative shrinkage method
134 Citations2007Kristian Bredies, Dirk A. Lorenz +1 more
It is shown that the iterative shrinkage method can be interpreted as a generalized conditional gradient method, and it is proved the convergence of this generalized method for general class of functionals, which includes non-convex functionals.
Inverse ProblemsRestoration of atmospherically blurred images by symmetric indefinite conjugate gradient techniques
101 Citations1996Martin Hanke, James G. Nagy
SIAM Journal on Numerical AnalysisAdaptive Wavelet Galerkin Methods for Linear Inverse Problems
98 Citations2004Albert Cohen, Marc Hoffmann +1 more
These methods combine the theoretical advantages of the wavelet-vaguelette decomposition (WVD) in terms of optimally adapting to the unknown smoothness of the solution, together with the numerical simplicity of Galerkin methods.
Applied and Computational Harmonic AnalysisMaximal Spaces with Given Rate of Convergence for Thresholding Algorithms
77 Citations2001Albert Cohen, Ronald DeVore +2 more
Inverse ProblemsTikhonov replacement functionals for iteratively solving nonlinear operator equations
61 Citations2005Ronny Ramlau, Gerd Teschke
Journal of Inverse and Ill-Posed ProblemsTwo-step regularization methods for linear inverse problems
43 Citations2006Esther Klann, Peter Maaß +1 more
Inverse ProblemsA non-iterative regularization approach to blind deconvolution
32 Citations2006Lutz A. Justen, Ronny Ramlau
This work proves convergence of the regularized solution to the noise-free minimum norm solution and gives a convergence rate result, which is non-iterative and thus very fast and works robustly for a wide range of images and kernels.
Inverse ProblemsResolution enhancement of spectra using differentiation
28 Citations2005Markus Hegland, Robert Anderssen
Inverse ProblemsOverview of topical issue on inverse problems in astronomy
6 Citations1995J. C. Brown
Signal ProcessingCondition monitoring of linear guideways using a matched wavelet approach
2 Citations2008Ludger Prünte, Peter Maaß +1 more
An analytic approach is developed and analyzed for constructing a family of discrete wavelets that is optimally fitted to a given pattern and applied to detect defects in linear guideways.