Convex Joint Graph Matching and Clustering via Semidefinite Relaxations

10/21/2021
by   Maximilian Krahn, et al.
0

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 convex semidefinite program relaxations for aligning points in Hilbert spaces and add coupling constraints to model the mutual dependency and exploit synergies between both tasks. We outperform state of the art in challenging cases with non-perfectly matching and noisy graphs, and we show successful applications on real compound scenes with multiple 3D elements. Our source code and data are publicly available.

READ FULL TEXT

page 6

page 8

research
12/14/2020

Articulated Shape Matching Using Laplacian Eigenfunctions and Unsupervised Point Registration

Matching articulated shapes represented by voxel-sets reduces to maximal...
research
01/04/2015

Non-iterative rigid 2D/3D point-set registration using semidefinite programming

We describe a convex programming framework for pose estimation in 2D/3D ...
research
01/16/2014

Seeded Graph Matching Via Joint Optimization of Fidelity and Commensurability

We present a novel approximate graph matching algorithm that incorporate...
research
08/10/2020

Sketching semidefinite programs for faster clustering

Many clustering problems enjoy solutions by semidefinite programming. Th...
research
11/25/2013

Robust Multimodal Graph Matching: Sparse Coding Meets Graph Matching

Graph matching is a challenging problem with very important applications...
research
11/27/2017

Joint Cuts and Matching of Partitions in One Graph

As two fundamental problems, graph cuts and graph matching have been inv...
research
03/14/2020

Universal Function Approximation on Graphs using Multivalued Functions

In this work we produce a framework for constructing universal function ...

Please sign up or login with your details

Forgot password? Click here to reset