Wavelets on graphs via spectral graph theory

From MaRDI portal
Publication:629253

DOI10.1016/J.ACHA.2010.04.005zbMATH Open1213.42091arXiv0912.3848OpenAlexW2158787690MaRDI QIDQ629253FDOQ629253


Authors: David K. Hammond, P. Vandergheynst, Rémi Gribonval Edit this on Wikidata


Publication date: 9 March 2011

Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)

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 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 Tgt=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.


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




Recommendations




Cites Work


Cited In (only showing first 100 items - show all)

Uses Software





This page was built for publication: Wavelets on graphs via spectral graph theory

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