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

可证明全局最优旋转平均的稀疏有界度平方和优化

Sparse Bounded Degree Sum of Squares Optimization for Certifiably Globally Optimal Rotation Averaging

University of Toronto(多伦多大学)

Matthew Giamou, Filip Maric, Valentin Peretroukhin, Jonathan Kelly

摘要:

从噪声测量中估计未知旋转是SfM和其他3D视觉任务中的重要步骤。通常,容易返回次优局部最小值的局部优化方法用于解决旋转平均问题。利用凸松弛的新一波方法为涉及SO(3)的状态估计技术提供了全局最优性的第一个正式保证。然而,这些保证中的大多数仅适用于由噪声引入的测量误差在取决于问题实例的结构的一定范围内时。在本文中,我们铸造旋转平均作为一个多项式优化问题的单位四元数产生的第一个旋转平均方法,正式保证提供一个可证明的全局最优解的\textit{any}问题的实例。这是通过制定和解决一个稀疏的凸平方和(SOS)松弛的问题。我们提供了我们的算法和实验的开源实现,展示了我们的全局最优方法的好处。

英文摘要:

Estimating unknown rotations from noisy measurements is an important step in SfM and other 3D vision tasks. Typically, local optimization methods susceptible to returning suboptimal local minima are used to solve the rotation averaging problem. A new wave of approaches that leverage convex relaxations have provided the first formal guarantees of global optimality for state estimation techniques involving SO(3). However, most of these guarantees are only applicable when the measurement error introduced by noise is within a certain bound that depends on the problem instance's structure. In this paper, we cast rotation averaging as a polynomial optimization problem over unit quaternions to produce the first rotation averaging method that is formally guaranteed to provide a certifiably globally optimal solution for \textit{any} problem instance. This is achieved by formulating and solving a sparse convex sum of squares (SOS) relaxation of the problem. We provide an open source implementation of our algorithm and experiments, demonstrating the benefits of our globally optimal approach.

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

↑