Convex Joint Graph Matching and Clustering via Semidefinite Relaxations.
Maximilian KrahnFlorian BernardVladislav GolyanikPublished in: 3DV (2021)
Keyphrases
- semidefinite
- graph matching
- convex relaxation
- semidefinite programming
- sufficient conditions
- interior point methods
- object recognition
- pairwise
- pattern recognition
- convex sets
- edit distance
- convex optimization
- higher dimensional
- pattern matching
- matching algorithm
- point sets
- finite dimensional
- vector space
- image matching
- linear programming
- computer vision
- linear program
- machine learning
- dimensionality reduction
- nearest neighbor
- query processing