Convex Joint Graph Matching and Clustering via Semidefinite Relaxations.
Maximilian KrahnFlorian BernardVladislav GolyanikPublished in: CoRR (2021)
Keyphrases
- semidefinite
- graph matching
- convex relaxation
- semidefinite programming
- convex sets
- pattern recognition
- object recognition
- interior point methods
- matching algorithm
- higher dimensional
- sufficient conditions
- point sets
- pairwise
- pattern matching
- convex optimization
- edit distance
- vector space
- globally optimal
- machine learning
- image matching
- multistage
- distance metric
- image registration
- similarity measure