26 September 2013 On the sparsity of wavelet coefficients for signals on graphs
Author Affiliations +
A number of new localized, multiscale transforms have recently been introduced to analyze data residing on weighted graphs. In signal processing tasks such as regularization and compression, much of the power of classical wavelets on the real line is derived from their theoretically and empirically proven ability to sparsely represent piecewise-smooth signals, which appear to be locally polynomial at sufficiently small scales. As of yet in the graph setting, there is little mathematical theory relating the sparsity of localized, multiscale transform coefficients to the structures of graph signals and their underlying graphs. In this paper, we begin to explore notions of global and local regularity of graph signals, and analyze the decay of spectral graph wavelet coefficients for regular graph signals.
© (2013) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Benjamin Ricaud, David I. Shuman, and Pierre Vandergheynst "On the sparsity of wavelet coefficients for signals on graphs", Proc. SPIE 8858, Wavelets and Sparsity XV, 88581L (26 September 2013); doi: 10.1117/12.2022850; https://doi.org/10.1117/12.2022850


Existence of cross terms in the wavelet transform
Proceedings of SPIE (November 30 1991)
Crack detection in beams by wavelet analysis
Proceedings of SPIE (May 28 2002)
Distributed fiber sensor using a wavelet transform
Proceedings of SPIE (February 02 1999)
Supertransients in fluid flow noise
Proceedings of SPIE (August 31 1995)

Back to Top