Dense shape correspondences using spectral high-order graph matching.
Dirk SmeetsJeroen HermansDirk VandermeulenPaul SuetensPublished in: CVPR Workshops (2011)
Keyphrases
- high order
- graph matching
- pairwise
- dense correspondence
- higher order
- feature matching
- point to point correspondences
- low order
- graph matching algorithm
- error tolerant
- graph edit distance
- computer vision and machine learning
- pattern recognition
- point sets
- matching algorithm
- edit distance
- similarity measure
- markov random field
- inexact graph matching
- subgraph isomorphism
- image matching
- point correspondences
- stereo correspondence
- shape matching
- object recognition
- low rank
- shape prior
- shape analysis
- pattern matching
- distance function
- viewpoint