DS*: Tighter Lifting-Free Convex Relaxations for Quadratic Matching Problems

29 November 2017

Papers citing "DS*: Tighter Lifting-Free Convex Relaxations for Quadratic Matching Problems"

8 / 8 papers shown

Title
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 10 7 0 04 Feb 2022
MIXER: A Principled Framework for Multimodal, Multiway Data Association Parker C. Lusk Ronak Roy Kaveh Fathian Jonathan P. How 11 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
Semi-relaxed Gromov-Wasserstein divergence with applications on graphs Cédric Vincent-Cuaz Rémi Flamary Marco Corneli Titouan Vayer Nicolas Courty OT 33 23 0 06 Oct 2021
Q-Match: Iterative Shape Matching via Quantum Annealing Marcel Seelbach Benkner Zorah Lähner Vladislav Golyanik C. Wunderlich Christian Theobalt Michael Moeller 16 34 0 06 May 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