Fusion Moves for Graph Matching

01/28/2021
by   Lisa Hutschenreiter, et al.
0

We contribute to approximate algorithms for the quadratic assignment problem also known as graph matching. Inspired by the success of the fusion moves technique developed for multilabel discrete Markov random fields, we investigate its applicability to graph matching. In particular, we show how it can be efficiently combined with the dedicated state-of-the-art Lagrange dual methods that have recently shown superior results in computer vision and bio-imaging applications. As our empirical evaluation on a wide variety of graph matching datasets suggests, fusion moves notably improve performance of these methods in terms of speed and quality of the obtained solutions. Hence, this combination results in a state-of-the-art solver for graph matching.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

12/16/2016

A Study of Lagrangean Decompositions and Dual Ascent Solvers for Graph Matching

We study the quadratic assignment problem, in computer vision also known...
08/01/2021

Deep graph matching meets mixed-integer linear programming: Relax at your own risk ?

Graph matching is an important problem that has received widespread atte...
06/17/2008

Learning Graph Matching

As a fundamental problem in pattern recognition, graph matching has appl...
03/28/2016

Continuous 3D Label Stereo Matching using Local Expansion Moves

We present an accurate stereo matching method using local expansion move...
01/05/2022

Deep Probabilistic Graph Matching

Most previous learning-based graph matching algorithms solve the quadrat...
06/04/2021

Stochastic Iterative Graph Matching

Recent works leveraging Graph Neural Networks to approach graph matching...
11/22/2018

Generalized Range Moves

We consider move-making algorithms for energy minimization of multi-labe...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.