Graph matching: relax or not?

01/29/2014
by   Yonathan Aflalo, et al.
0

We consider the problem of exact and inexact matching of weighted undirected graphs, in which a bijective correspondence is sought to minimize a quadratic weight disagreement. This computationally challenging problem is often relaxed as a convex quadratic program, in which the space of permutations is replaced by the space of doubly-stochastic matrices. However, the applicability of such a relaxation is poorly understood. We define a broad class of friendly graphs characterized by an easily verifiable spectral property. We prove that for friendly graphs, the convex relaxation is guaranteed to find the exact isomorphism or certify its inexistence. This result is further extended to approximately isomorphic graphs, for which we develop an explicit bound on the amount of weight disagreement under which the relaxation is guaranteed to find the globally optimal approximate isomorphism. We also show that in many cases, the graph matching problem can be further harmlessly relaxed to a convex quadratic program with only n separable linear equality constraints, which is substantially more efficient than the standard relaxation involving 2n equality and n^2 inequality constraints. Finally, we show that our results are still valid for unfriendly graphs if additional information in the form of seeds or attributes is allowed, with the latter satisfying an easy to verify spectral characteristic.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/20/2019

Spectral Graph Matching and Regularized Quadratic Relaxations II: Erdős-Rényi Graphs and Universality

We analyze a new spectral graph matching algorithm, GRAph Matching by Pa...
research
05/17/2017

DS++: A flexible, scalable and provably tight relaxation for matching problems

Correspondence problems are often modelled as quadratic optimization pro...
research
01/23/2008

A path following algorithm for the graph matching problem

We propose a convex-concave programming approach for the labeled weighte...
research
12/24/2018

Integrity Constraints Revisited: From Exact to Approximate Implication

Integrity constraints such as functional dependences (FD), and multi-val...
research
07/20/2019

Spectral Graph Matching and Regularized Quadratic Relaxations I: The Gaussian Model

Graph matching aims at finding the vertex correspondence between two unl...
research
07/24/2018

Tractable Graph Matching via Soft Seeding

The graph matching problem aims to discover a latent correspondence betw...
research
05/13/2014

Graph Matching: Relax at Your Own Risk

Graph matching---aligning a pair of graphs to minimize their edge disagr...

Please sign up or login with your details

Forgot password? Click here to reset