Hierarchical graph Laplacian eigen transforms
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 o...
Gespeichert in:
Veröffentlicht in: | JSIAM Letters 2014, Vol.6, pp.21-24 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | 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. |
---|---|
ISSN: | 1883-0609 1883-0617 |
DOI: | 10.14495/jsiaml.6.21 |