A maximum diversity-based path sparsification for geometric graph matching.
Abd Errahmane KioucheHamida SebaKarima AmrouchePublished in: Pattern Recognit. Lett. (2021)
Keyphrases
- graph matching
- graph matching algorithm
- graph edit distance
- pattern recognition
- matching algorithm
- object recognition
- edit distance
- pairwise
- tree matching
- inexact graph matching
- error tolerant
- matching accuracy
- shortest path
- subgraph isomorphism
- point sets
- attributed graphs
- image matching
- pattern matching
- geometric structure
- adjacency matrix
- association graph
- machine learning
- object representation
- bipartite graph matching
- computer vision and machine learning