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

ARCS:精确旋转和对应搜索

ARCS: Accurate Rotation and Correspondence Search

Johns Hopkins University(约翰斯·霍普金斯大学);ShanghaiTech University(上海科技大学)

Liangzu Peng, Manolis C. Tsakiris, René Vidal

摘要:

本文是关于旧的Wahba问题在其更一般的形式,我们称之为“同时旋转和对应搜索”。在这个推广中,我们需要找到一个旋转,最好地对齐两个部分重叠的$3$ D点集,大小分别为$m$和$n$与$m\geq n$。我们首先提出了一个求解器,$\texttt{ARCS}$,i)假设一般位置的无噪声点集,ii)只需要$2$内点,iii)使用$O(m\log m)$时间和$O(m)$空间,以及iv)甚至可以成功地解决问题,例如,$m,n\approx 10^6$在大约$0.1$秒。接下来,我们将$\texttt{ARCS}$鲁棒到噪声,为此,我们使用鲁棒子空间学习和间隔刺的思想近似地解决共识最大化问题。第三,我们完善了近似发现的共识集的单位四元数的空间上的黎曼次梯度下降方法,我们表明,全球收敛到一个$\varepsilon$ -固定点在$O(\varepsilon^{-4})$迭代,或本地的地面真理在没有噪声的情况下,在一个线性速率。我们结合这些算法到$\texttt{ARCS+}$,同时搜索旋转和对应。实验表明,$\texttt{ARCS+}$实现了国家的最先进的性能在大规模的数据集上超过$10^6$点与$10^4$的时间加速比替代方法。\url{https://github.com/liangzu/ARCS}

英文摘要:

This paper is about the old Wahba problem in its more general form, which we call "simultaneous rotation and correspondence search". In this generalization we need to find a rotation that best aligns two partially overlapping $3$D point sets, of sizes $m$ and $n$ respectively with $m\geq n$. We first propose a solver, $\texttt{ARCS}$, that i) assumes noiseless point sets in general position, ii) requires only $2$ inliers, iii) uses $O(m\log m)$ time and $O(m)$ space, and iv) can successfully solve the problem even with, e.g., $m,n\approx 10^6$ in about $0.1$ seconds. We next robustify $\texttt{ARCS}$ to noise, for which we approximately solve consensus maximization problems using ideas from robust subspace learning and interval stabbing. Thirdly, we refine the approximately found consensus set by a Riemannian subgradient descent approach over the space of unit quaternions, which we show converges globally to an $\varepsilon$-stationary point in $O(\varepsilon^{-4})$ iterations, or locally to the ground-truth at a linear rate in the absence of noise. We combine these algorithms into $\texttt{ARCS+}$, to simultaneously search for rotations and correspondences. Experiments show that $\texttt{ARCS+}$ achieves state-of-the-art performance on large-scale datasets with more than $10^6$ points with a $10^4$ time-speedup over alternative methods. \url{https://github.com/liangzu/ARCS}

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

↑