A tensor-based algorithm for high-order graph matching.
Olivier DuchenneFrancis R. BachIn-So KweonJean PoncePublished in: CVPR (2009)
Keyphrases
- high order
- graph matching
- matching algorithm
- higher order
- error tolerant
- objective function
- graph matching algorithm
- tensor analysis
- computational complexity
- arithmetic coding
- pairwise
- markov random field
- closed form
- subgraph isomorphism
- matching accuracy
- dynamic programming
- convex hull
- similarity measure
- image matching
- inexact graph matching