Geometric Polynomial Constraints in Higher-Order Graph Matching.
Mayank BansalKostas DaniilidisPublished in: CoRR (2014)
Keyphrases
- graph matching
- higher order
- pairwise
- low order
- geometric constraints
- high order
- pattern recognition
- error tolerant
- graph matching algorithm
- inexact graph matching
- object recognition
- edit distance
- tree matching
- matching algorithm
- graph edit distance
- matching accuracy
- point sets
- image matching
- replicator dynamics
- bipartite graph matching
- computer vision
- computer vision and machine learning
- shape descriptors
- object representation
- markov random field