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.






Describes a project that uses

Uses Software






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)