Skip to Main content Skip to Navigation
Journal articles

Wavelets on graphs via spectral graph theory

David K. Hammond 1 Pierre Vandergheynst 1 Rémi Gribonval 2
2 METISS - Speech and sound data modeling and processing
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
Abstract : We propose a novel method for constructing wavelet transforms of functions defined on the vertices of an arbitrary finite weighted graph. Our approach is based on defining scaling using the graph analogue of the Fourier domain, namely the spectral decomposition of the discrete graph Laplacian L. Given a wavelet generating kernel g and a scale parameter t, we define the scaled wavelet operator Ttg = g(tL). The spectral graph wavelets are then formed by localizing this operator by applying it to an indicator function. Subject to an admissibility condition on g, this procedure defines an invertible transform. We explore the localization properties of the wavelets in the limit of fine scales. Additionally, we present a fast Chebyshev polynomial approximation algorithm for computing the transform that avoids the need for diagonalizing L. We highlight potential applications of the transform through examples of wavelets on graphs corresponding to a variety of different problem domains.
Complete list of metadata
Contributor : Rémi Gribonval Connect in order to contact the contributor
Submitted on : Sunday, February 6, 2011 - 10:07:32 PM
Last modification on : Tuesday, June 15, 2021 - 4:27:55 PM
Long-term archiving on: : Saturday, May 7, 2011 - 2:23:24 AM


Files produced by the author(s)



David K. Hammond, Pierre Vandergheynst, Rémi Gribonval. Wavelets on graphs via spectral graph theory. Applied and Computational Harmonic Analysis, Elsevier, 2011, 30 (2), pp.129--150. ⟨10.1016/j.acha.2010.04.005⟩. ⟨inria-00541855⟩



Les métriques sont temporairement indisponibles