A graph laplacian matrix learning method for fast implementation of graph fourier transform.
Keng-Shih LuAntonio OrtegaPublished in: ICIP (2017)
Keyphrases
- fourier transform
- laplacian matrix
- adjacency matrix
- graph representation
- graph laplacian
- frequency domain
- graph matching
- weighted graph
- graph structure
- random walk
- pairwise
- computational complexity
- similarity measure
- graph structures
- covariance matrix
- signal processing
- minimum spanning tree
- graph construction
- k means