JSIAM Letters
Online ISSN : 1883-0617
Print ISSN : 1883-0609
ISSN-L : 1883-0617
Articles
Hierarchical graph Laplacian eigen transforms
Jeff IrionNaoki Saito
Author information
JOURNAL FREE ACCESS

2014 Volume 6 Pages 21-24

Details
Abstract

We describe a new transform that generates a dictionary of bases for handling data on a graph by combining recursive partitioning of the graph and the Laplacian eigenvectors of each subgraph. Similar to the wavelet packet and local cosine dictionaries for regularly sampled signals, this dictionary of bases on the graph allows one to select an orthonormal basis that is most suitable to one's task at hand using a best-basis type algorithm. We also describe a few related transforms including a version of the Haar wavelet transform on a graph, each of which may be useful in its own right.

Related papers from these authors
© 2014, The Japan Society for Industrial and Applied Mathematics
Previous article Next article
feedback
Top