快速全局最优旋转平均的旋转坐标下降法
Rotation Coordinate Descent for Fast Globally Optimal Rotation Averaging
摘要:
在温和的条件下的测量噪声水平,旋转平均满足强对偶,这使得全球解决方案,通过半定规划(SDP)松弛。然而,SDP的通用求解器在实践中相当慢,即使在中等大小的旋转平均实例上也是如此,因此开发专门的算法至关重要。在本文中,我们提出了一种快速算法,实现全局最优称为旋转坐标下降(RCD)。与通过逐行更新半定矩阵来求解SDP的块坐标下降(BCD)不同,RCD在整个迭代过程中直接维护和更新所有有效的旋转。这避免了存储大型稠密半定矩阵的需要。我们在数学上证明了我们的算法的收敛性,并在经验上显示了其优越的效率,在各种问题配置的国家的最先进的全球性的方法。保持有效的旋转也有助于纳入本地优化例程,以进一步加速。此外,我们的算法是简单的实现;见补充材料的演示程序。
英文摘要:
Under mild conditions on the noise level of the measurements, rotation averaging satisfies strong duality, which enables global solutions to be obtained via semidefinite programming (SDP) relaxation. However, generic solvers for SDP are rather slow in practice, even on rotation averaging instances of moderate size, thus developing specialised algorithms is vital. In this paper, we present a fast algorithm that achieves global optimality called rotation coordinate descent (RCD). Unlike block coordinate descent (BCD) which solves SDP by updating the semidefinite matrix in a row-by-row fashion, RCD directly maintains and updates all valid rotations throughout the iterations. This obviates the need to store a large dense semidefinite matrix. We mathematically prove the convergence of our algorithm and empirically show its superior efficiency over state-of-the-art global methods on a variety of problem configurations. Maintaining valid rotations also facilitates incorporating local optimisation routines for further speed-ups. Moreover, our algorithm is simple to implement; see supplementary material for a demonstration program.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。