Convergence and performance of the peeling wavelet denoising algorithm
From MaRDI portal
Abstract: This note is devoted to an analysis of the so-called peeling algorithm in wavelet denoising. Assuming that the wavelet coefficients of the signal can be modeled by generalized Gaussian random variables, we compute a critical thresholding constant for the algorithm, which depends on the shape parameter of the generalized Gaussian distribution. We also quantify the optimal number of steps which have to be performed, and analyze the convergence of the algorithm. Several versions of the obtained algorithm were implemented and tested against classical wavelet denoising procedures on benchmark and simulated biological signals.
Recommendations
Cites work
- A data-driven block thresholding approach to wavelet estimation
- A theory for multiresolution signal decomposition: the wavelet representation
- Analysis of multiresolution image denoising schemes using generalized Gaussian and complexity priors
- scientific article; zbMATH DE number 739533 (Why is no real title available?)
- scientific article; zbMATH DE number 1380579 (Why is no real title available?)
- Ideal spatial adaptation by wavelet shrinkage
- Incorporating information on neighbouring coefficients into wavelet estimation
- Ten Lectures on Wavelets
- Uniform limit theorems for wavelet density estimators
- Wavelet block thresholding for samples with random design: a minimax approach under the \(L^p\) risk
- Weak convergence and empirical processes. With applications to statistics
Cited in
(2)
This page was built for publication: Convergence and performance of the peeling wavelet denoising algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2450856)