期刊
APPLIED AND COMPUTATIONAL HARMONIC ANALYSIS
卷 30, 期 2, 页码 129-150出版社
ACADEMIC PRESS INC ELSEVIER SCIENCE
DOI: 10.1016/j.acha.2010.04.005
关键词
Graph theory; Wavelets; Spectral graph theory; Overcomplete wavelet frames
资金
- EU [FP7-ICT-225913-SMALL]
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 T-g(t) = 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. (C) 2010 Elsevier Inc. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据