BriefGPT.xyz
Nov, 2017
DS*: 二次匹配问题的更紧致的无提升凸松弛
Tighter Lifting-Free Convex Relaxations for Quadratic Matching Problems
HTML
PDF
Florian Bernard, Christian Theobalt, Michael Moeller
TL;DR
本文提出了一种无需转换法的凸松弛方法，用于解决由排列矩阵表示的二次优化问题，该方法在求解图像排列和多图匹配问题等实例中表现出更好的性能。
Abstract
In this work we study convex relaxations of quadratic optimisation problems over
permutation matrices
. While existing
semidefinite programming
approaches can achieve remarkably tight relaxations, they have the st
→