arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2207.08592cs.LGcs.CGcs.CVmath.OC
收藏

对称鲁棒Procrustes:常数因子逼近与精确恢复

Symmetrized Robust Procrustes: Constant-Factor Approximation and Exact Recovery

University of North Carolina at Chapel Hill(北卡罗来纳大学教堂山分校)

Tal Amir, Shahar Kovalsky, Nadav Dym

摘要:

经典的$\textit{Procrustes}$问题是找到一个刚性运动(正交变换和平移),最好地对齐两个给定的点集在最小二乘意义。$\textit{Robust Procrustes}$问题是一个重要的变体,其中使用幂1目标而不是最小二乘来提高对离群值的鲁棒性。虽然最小二乘问题的最优解可以很容易地以封闭形式计算,可以追溯到Schönemann(1966),但对于幂1问题没有这样的解。在本文中,我们提出了一个新的凸松弛鲁棒Procrustes问题。我们的放松享有几个理论和实践的优势:理论上,我们证明,我们的方法提供了一个$\sqrt{2}$因子近似的鲁棒Procrustes问题,并在适当的假设下,它完全恢复真正的刚性运动从点对应污染的离群值。在实践中,我们发现在合成和真正的鲁棒Procrustes问题的数值实验,我们的方法执行类似的标准迭代加权最小二乘法(IRLS)。然而,我们的算法的凸允许纳入额外的凸处罚,这是不容易服从IRLS。事实证明,这是一个巨大的优势,导致高维问题的结果得到改善,包括非刚性形状对齐和半监督的语际单词翻译。

英文摘要:

The classical $\textit{Procrustes}$ problem is to find a rigid motion (orthogonal transformation and translation) that best aligns two given point-sets in the least-squares sense. The $\textit{Robust Procrustes}$ problem is an important variant, in which a power-1 objective is used instead of least squares to improve robustness to outliers. While the optimal solution of the least-squares problem can be easily computed in closed form, dating back to Schönemann (1966), no such solution is known for the power-1 problem. In this paper we propose a novel convex relaxation for the Robust Procrustes problem. Our relaxation enjoys several theoretical and practical advantages: Theoretically, we prove that our method provides a $\sqrt{2}$-factor approximation to the Robust Procrustes problem, and that, under appropriate assumptions, it exactly recovers the true rigid motion from point correspondences contaminated by outliers. In practice, we find in numerical experiments on both synthetic and real robust Procrustes problems, that our method performs similarly to the standard Iteratively Reweighted Least Squares (IRLS). However the convexity of our algorithm allows incorporating additional convex penalties, which are not readily amenable to IRLS. This turns out to be a substantial advantage, leading to improved results in high-dimensional problems, including non-rigid shape alignment and semi-supervised interlingual word translation.

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

↑