Spectral clustering for divide-and-conquer graph matching.
Vince LyzinskiDaniel L. SussmanDonniell E. FishkindHenry PaoLi ChenJoshua T. VogelsteinYoungser ParkCarey E. PriebePublished in: Parallel Comput. (2015)
Keyphrases
- graph matching
- spectral clustering
- pairwise
- data clustering
- graph edit distance
- matching algorithm
- object recognition
- clustering method
- similarity matrix
- pattern recognition
- affinity matrix
- graph matching algorithm
- adjacency matrix
- image segmentation
- eigendecomposition
- edit distance
- pattern matching
- image matching
- similarity measure
- graph laplacian
- clustering algorithm
- inexact graph matching
- normalized cut
- semi supervised
- k means
- graph partitioning
- point sets
- vector space
- distance measure
- neural network