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

v1v2 (latest)

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

16 December 2016

Hassan Abu Alhaija

Dagmar Kainmüller

Bogdan Savchynskyy

ArXiv (abs)PDF HTML

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

6 / 6 papers shown

Title
A Dual Ascent Framework for Lagrangean Decomposition of Combinatorial Problems Paul Swoboda Jan Kuske Bogdan Savchynskyy 45 29 0 16 Dec 2016
A Flexible Tensor Block Coordinate Ascent Scheme for Hypergraph Matching Quynh Nguyen Ngoc A. Gautier Matthias Hein 3DPC 67 69 0 29 Apr 2015
A Comparative Study of Modern Inference Techniques for Structured Discrete Energy Minimization Problems Jörg H. Kappes Björn Andres Fred Hamprecht Christoph Schnörr Sebastian Nowozin ... Thorben Kröger J. Lellmann N. Komodakis Bogdan Savchynskyy Carsten Rother 98 185 0 02 Apr 2014
A new look at reweighted message passing V. Kolmogorov 70 54 0 22 Sep 2013
Efficiently Searching for Frustrated Cycles in MAP Inference David Sontag Do Kook Choe Yitao Li 110 87 0 16 Oct 2012
A path following algorithm for the graph matching problem M. Zaslavskiy Francis R. Bach Jean-Philippe Vert 158 422 0 23 Jan 2008