Graph Matching using Commute Time Spanning Trees.
Huaijun QiuEdwin R. HancockPublished in: ICPR (3) (2006)
Keyphrases
- graph matching
- spanning tree
- random walk
- edge disjoint
- minimum spanning tree
- pattern recognition
- error tolerant
- minimum cost
- object recognition
- pairwise
- inexact graph matching
- minimum weight
- graph matching algorithm
- edit distance
- minimum spanning trees
- graph edit distance
- undirected graph
- point sets
- tree matching
- matching algorithm
- computer vision and machine learning
- attributed graphs
- edge weights
- subgraph isomorphism
- vector space
- bipartite graph matching
- pattern matching
- depth first search
- neural network
- np hard
- objective function