arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1705.01362cs.CV
收藏

旋转平均与强对偶

Rotation Averaging and Strong Duality

Queensland University of Technology(昆士兰科技大学);Chalmers University of Technology(查尔姆斯理工大学);Lund University(隆德大学);The University of Adelaide(阿德莱德大学)

Anders Eriksson, Carl Olsson, Fredrik Kahl, Tat-Jun Chin

摘要:

在本文中,我们探讨的作用,对偶原则的旋转平均,在广泛的计算机视觉应用的基本任务的问题。在其常规形式中,旋转平均被陈述为在多个旋转约束上的最小化。由于这些约束是非凸的,这个问题通常被认为是具有挑战性的全局解决。我们将展示如何规避这一困难,通过使用拉格朗日对偶。虽然这种方法是众所周知的,但通常不能保证提供紧松弛。基于谱图理论,我们分析证明,在许多情况下,没有对偶间隙,除非噪声水平严重。这使得我们能够在多项式时间内得到一类重要的非凸问题的可证明的全局解。我们还提出了一个有效的,可扩展的算法,优于通用的数值求解器,并能够处理大型问题的情况下,通常发生在运动恢复结构设置。这种方法的潜力被证明了一些不同的问题,包括合成和真实世界的数据。

英文摘要:

In this paper we explore the role of duality principles within the problem of rotation averaging, a fundamental task in a wide range of computer vision applications. In its conventional form, rotation averaging is stated as a minimization over multiple rotation constraints. As these constraints are non-convex, this problem is generally considered challenging to solve globally. We show how to circumvent this difficulty through the use of Lagrangian duality. While such an approach is well-known it is normally not guaranteed to provide a tight relaxation. Based on spectral graph theory, we analytically prove that in many cases there is no duality gap unless the noise levels are severe. This allows us to obtain certifiably global solutions to a class of important non-convex problems in polynomial time. We also propose an efficient, scalable algorithm that out-performs general purpose numerical solvers and is able to handle the large problem instances commonly occurring in structure from motion settings. The potential of this proposed method is demonstrated on a number of different problems, consisting of both synthetic and real-world data.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑