Convex Joint Graph Matching and Clustering via Semidefinite Relaxations

  title={Convex Joint Graph Matching and Clustering via Semidefinite Relaxations},
  author={Maximilian Krahn and Florian Bernard and Vladislav Golyanik},
  journal={2021 International Conference on 3D Vision (3DV)},
This paper proposes a new algorithm for simultaneous graph matching and clustering. For the first time in the literature, these two problems are solved jointly and synergetically without relying on any training data, which brings advantages for identifying similar arbitrary objects in compound 3D scenes and matching them. For joint reasoning, we first rephrase graph matching as a rigid point set registration problem operating on spectral graph embeddings. Consequently, we utilise efficient… 

Figures from this paper


Probabilistic Subgraph Matching Based on Convex Relaxation
It is shown that the global minimum of the relaxed convex problem can be interpreted as probability distribution over the original space of matching matrices, providing a basis for efficiently sampling all close-to-optimal combinatorial matchings within the original solution space.
Graduated Assignment for Joint Multi-Graph Matching and Clustering with Application to Unsupervised Graph Matching Network Learning
Experimental results on real-world benchmarks show the graduated assignment procedure for soft matching and clustering over iterations outperforms learning-free algorithms and performs comparatively against two-graph based supervised graph matching approaches.
An Integer Projected Fixed Point Method for Graph Matching and MAP Inference
This paper argues that the stage in which a discrete solution is found is crucial for good performance and proposes an efficient algorithm, with climbing and convergence properties, that optimizes in the discrete domain the quadratic score, and it gives excellent results either by itself or by starting from the solution returned by any graph matching algorithm.
Multiple Graph Matching and Clustering via Decayed Pairwise Matching Composition
Experimental results show the proposed methods achieve excellent trade-off on the traditional multi-graph matching case, and outperform in both matching and clustering accuracy, as well as time efficiency.
A Study of Lagrangean Decompositions and Dual Ascent Solvers for Graph Matching
This work studies the quadratic assignment problem in computer vision and proposes several additional Lagrangean relaxations of the graph matching problem along with corresponding algorithms, which are all based on a common dual ascent framework.
Alternating Direction Graph Matching
Experimental results on widely adopted benchmarks involving synthetic and real examples demonstrate that the proposed solutions outperform existing pairwise graph matching methods, and competitive with the state of the art in higher-order settings.
Graph Matching using Spectral Embedding and Semidefinite Programming
This paper uses semidefinite programming to develop a variant of the Scott and Longuet-Higgins algorithm to find point correspondences and experiment with the resulting algorithm on a number of real-world problems.
Balanced Graph Matching
A new spectral relaxation technique for approximate solutions to matching problems, that naturally incorporates one-to-one or one- to-many constraints within the relaxation scheme is given.
Joint Cuts and Matching of Partitions in One Graph
An optimization algorithm is developed by updating matching and cutting alternatively, provided with theoretical analysis and the efficacy of this algorithm is verified on both synthetic dataset and real-world images containing similar regions or structures.
Tight Relaxation of Quadratic Matching
This work suggests a novel convex relaxation for this NP‐hard problem that builds upon a rank‐one reformulation of the problem in a higher dimension, followed by relaxation into a semidefinite program (SDP).