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

16 December 2016

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

10 / 10 papers shown

Title
Unsupervised Deep Graph Matching Based on Cycle Consistency Siddharth Tourani Carsten Rother M. H. Khan Bogdan Savchynskkyy 24 3 0 18 Jul 2023
Learning Universe Model for Partial Matching Networks over Multiple Graphs Zetian Jiang Jiaxin Lu Tianzhe Wang Junchi Yan 13 2 0 19 Oct 2022
Structured Prediction Problem Archive Paul Swoboda Bjoern Andres Andrea Hornáková Florian Bernard Jannik Irmai Paul Roetzer Bogdan Savchynskyy David Stein Ahmed Abbas 13 7 0 04 Feb 2022
Deep Probabilistic Graph Matching He Liu Tao Wang Yidong Li Congyan Lang Songhe Feng Haibin Ling 10 2 0 05 Jan 2022
MIXER: A Principled Framework for Multimodal, Multiway Data Association Parker C. Lusk Ronak Roy Kaveh Fathian Jonathan P. How 13 0 0 29 Nov 2021
Convex Joint Graph Matching and Clustering via Semidefinite Relaxations Maximilian Krahn Florian Bernard Vladislav Golyanik 13 1 0 21 Oct 2021
Joint Graph Learning and Matching for Semantic Feature Correspondence He Liu Tao Wang Yidong Li Congyan Lang Yi Jin Haibin Ling 13 20 0 01 Sep 2021
Fusion Moves for Graph Matching Lisa Hutschenreiter Stefan Haller Lorenz Feineis Carsten Rother Dagmar Kainmüller Bogdan Savchynskyy 16 15 0 28 Jan 2021
Synchronisation of Partial Multi-Matchings via Non-negative Factorisations Florian Bernard J. Thunberg Jorge M. Gonçalves Christian Theobalt 19 31 0 16 Mar 2018
Efficiently Searching for Frustrated Cycles in MAP Inference David Sontag Do Kook Choe Yitao Li 55 87 0 16 Oct 2012