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"

12 / 12 papers shown

Title
DS++: A flexible, scalable and provably tight relaxation for matching problems Nadav Dym Haggai Maron Y. Lipman 36 17 0 17 May 2017
MoFA: Model-based Deep Convolutional Face Autoencoder for Unsupervised Monocular Reconstruction A. Tewari Michael Zollhöfer Hyeongwoo Kim Pablo Garrido Florian Bernard P. Pérez Christian Theobalt 3DH CVBM 68 549 0 30 Mar 2017
Product Manifold Filter: Non-Rigid Shape Correspondence via Kernel Density Estimation in the Product Space Matthias Vestner R. Litman Emanuele Rodolà A. Bronstein Daniel Cremers 70 130 0 03 Jan 2017
A Study of Lagrangean Decompositions and Dual Ascent Solvers for Graph Matching Paul Swoboda Carsten Rother Hassan Abu Alhaija Dagmar Kainmüller Bogdan Savchynskyy 42 59 0 16 Dec 2016
A Dual Ascent Framework for Lagrangean Decomposition of Combinatorial Problems Paul Swoboda Jan Kuske Bogdan Savchynskyy 38 30 0 16 Dec 2016
Alternating Direction Graph Matching Đ.Khuê Lê-Huu Nikos Paragios 52 50 0 22 Nov 2016
Biconvex Relaxation for Semidefinite Programming in Computer Vision Sohil Shah A. Yadav Carlos D. Castillo David Jacobs Christoph Studer Tom Goldstein 53 24 0 31 May 2016
Large-scale Binary Quadratic Optimization Using Semidefinite Relaxation and Applications Peng Wang Chunhua Shen Anton Van Den Hengel Philip H. S. Torr 65 55 0 27 Nov 2014
A Solution for Multi-Alignment by Transformation Synchronisation Florian Bernard J. Thunberg P. Gemmar F. Hertel A. Husch Jorge M. Gonçalves 57 61 0 30 Oct 2014
Microsoft COCO: Common Objects in Context Nayeon Lee Michael Maire Serge J. Belongie Lubomir Bourdev Ross B. Girshick James Hays Pietro Perona Deva Ramanan C. L. Zitnick Piotr Dollár ObjD 413 43,638 0 01 May 2014
A Fast Semidefinite Approach to Solving Binary Quadratic Problems Peng Wang Chunhua Shen Anton Van Den Hengel 66 32 0 03 Apr 2013
A path following algorithm for the graph matching problem M. Zaslavskiy Francis R. Bach Jean-Philippe Vert 138 422 0 23 Jan 2008