Inexact Matching of Large and Sparse Graphs Using Laplacian Eigenvectors.
David KnossowAvinash SharmaDiana MateusRadu HoraudPublished in: GbRPR (2009)
Keyphrases
- inexact matching
- laplacian matrix
- structural descriptions
- graph laplacian
- spectral decomposition
- spectral clustering
- eigenvalue decomposition
- adjacency matrix
- spectral methods
- sparse coding
- heat kernel
- covariance matrix
- weighted graph
- eigenvalues and eigenvectors
- low dimensional
- pseudo inverse
- representation scheme
- graph kernels
- high dimensional
- graph matching
- graph representation
- principal component analysis
- spectral analysis
- neighborhood graph
- directed graph
- pairwise
- graph clustering
- graph partitioning
- graph structure
- shape descriptors
- shape analysis
- sparse representation
- random walk
- graphical models