Return to Colloquia & Seminar listing
Hierarchical Graph Laplacian Eigen Transforms
Student-Run Research SeminarSpeaker: | Jeff Irion, UC Davis |
Location: | 2112 MSB |
Start time: | Wed, Nov 20 2013, 12:10PM |
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, each of which may be useful in its own right.