A Message Passing Algorithm for the Minimum Cost Multicut Problem

12/16/2016
by   Paul Swoboda, et al.
0

We propose a dual decomposition and linear program relaxation of the NP -hard minimum cost multicut problem. Unlike other polyhedral relaxations of the multicut polytope, it is amenable to efficient optimization by message passing. Like other polyhedral elaxations, it can be tightened efficiently by cutting planes. We define an algorithm that alternates between message passing and efficient separation of cycle- and odd-wheel inequalities. This algorithm is more efficient than state-of-the-art algorithms based on linear programming, including algorithms written in the framework of leading commercial software, as we show in experiments with large instances of the problem from applications in computer vision, biomedical image analysis and data mining.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/09/2012

MAP Estimation, Message Passing, and Perfect Graphs

Efficiently finding the maximum a posteriori (MAP) configuration of a gr...
research
02/17/2010

Message-Passing Algorithms: Reparameterizations and Splittings

The max-product algorithm, a local message-passing scheme that attempts ...
research
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...
research
06/04/2014

Augmentative Message Passing for Traveling Salesman Problem and Graph Partitioning

The cutting plane method is an augmentative constrained optimization pro...
research
09/04/2021

RAMA: A Rapid Multicut Algorithm on GPU

We propose a highly parallel primal-dual algorithm for the multicut (a.k...
research
05/29/2012

Generalized sequential tree-reweighted message passing

This paper addresses the problem of approximate MAP-MRF inference in gen...
research
11/14/2016

Joint Graph Decomposition and Node Labeling: Problem, Algorithms, Applications

We state a combinatorial optimization problem whose feasible solutions d...

Please sign up or login with your details

Forgot password? Click here to reset