Data-driven thresholding in denoising with spectral graph wavelet transform

DOI10.48550/ARXIV.1906.01882MaRDI QIDQ76309zbMATH OpenOpenAlexFDO

Authors Basile de Loynes, Fabien Navarro, Baptiste Olivier, Basile de Loynes, Fabien Navarro, Baptiste Olivier

Publication date 5 June 2019

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1906.01882

zbMATH Keywords

denoisingspectral graph theoryspectral graph wavelet transformStein unbiased risk estimationtight framevariance estimation

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Nontrigonometric harmonic analysis involving wavelets and other special systems (42C40) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Abstract: This paper is devoted to adaptive signal denoising in the context of Graph Signal Processing (GSP) using Spectral Graph Wavelet Transform (SGWT). This issue is addressed emph{via} a data-driven thresholding process in the transformed domain by optimizing the parameters in the sense of the Mean Square Error (MSE) using the Stein's Unbiased Risk Estimator (SURE). The SGWT considered is built upon a partition of unity making the transform semi-orthogonal so that the optimization can be performed in the transformed domain. However, since the SGWT is over-complete, the divergence term in the SURE needs to be computed in the context of correlated noise. Two thresholding strategies called coordinatewise and block thresholding process are investigated. For each of them, the SURE is derived for a whole family of elementary thresholding functions among which the soft threshold and the James-Stein threshold. This multi-scales analysis shows better performance than the most recent methods from the literature. That is illustrated numerically for a series of signals on different graphs.

Recommendations

• Hysteresis thresholding: a graph-based wavelet block denoising algorithm
• Fractional spectral graph wavelets and their applications
• Wavelets on graphs via spectral graph theory
• scientific article; zbMATH DE number 6536240
• Sparse representation on graphs by tight wavelet frames and applications

Cites work

• scientific article; zbMATH DE number 964896 (Why is no real title available?)
• A SURE Approach for Digital Signal/Image Deconvolution Problems
• A wavelet tour of signal processing. The sparse way.
• Adapting to Unknown Smoothness via Wavelet Shrinkage
• Adaptive wavelet estimation: A block thresholding and oracle inequality approach
• Diffusion maps
• Distribution of the Ratio of the Mean Square Successive Difference to the Variance
• Estimation of the mean of a multivariate normal distribution
• Global Image Denoising
• Graph Wavelets for Multiscale Community Mining
• Kernels and regularization on graphs.
• Large networks and graph limits
• Local behavior of sparse analysis regularization: applications to risk estimation
• Multiscale representation of surfaces by tight wavelet frames with applications to denoising
• On total variation minimization and surface evolution using parametric maximum flows
• Recurrence of distributional limits of finite planar graphs
• Siegel's formula via Stein's identities
• Signal-Adapted Tight Frames on Graphs
• Spectrum-Adapted Tight Graph Wavelet and Vertex-Frequency Frames
• The DFS fused Lasso: linear-time denoising over general graphs
• The solution path of the generalized lasso
• Tight Wavelet Frames on Multislice Graphs
• Towards a theoretical foundation for Laplacian-based manifold methods
• Trend filtering on graphs
• Wavelets on graphs via spectral graph theory

Cited in

(3)

• Localized Fourier analysis for graph signal processing
• scientific article; zbMATH DE number 6536240 (Why is no real title available?)
• gasper

This page was built for publication: Data-driven thresholding in denoising with spectral graph wavelet transform

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q76309)