Using local similarity measures to efficiently address approximate graph matching.
Segla KpodjedoPhilippe GalinierGiuliano AntoniolPublished in: Discret. Appl. Math. (2014)
Keyphrases
- graph matching
- edit distance
- similarity measure
- error tolerant
- graph matching algorithm
- pairwise
- tree matching
- pattern recognition
- matching accuracy
- graph edit distance
- computer vision and machine learning
- point sets
- matching algorithm
- pattern matching
- object recognition
- subgraph isomorphism
- association graph
- adjacency matrix
- replicator dynamics
- tree edit distance
- feature vectors
- bipartite graph matching
- approximate matching
- image processing
- attributed graphs
- image features
- distance measure
- semantic similarity