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}
1-point RANSAC for Circular Motion Estimation in Computed Tomography (CT)
Institute for Information Transmission Problems – IITP RAS(俄罗斯科学院信息传输问题研究所);Moscow Institute of Physics and Technology (National Research University)(莫斯科物理技术学院(国立研究型大学))
ICOS: Efficient and Highly Robust Rotation Search and Point Cloud Registration with Correspondences
East China University of Science and Technology(华东理工大学)
旋转搜索和点云配准是机器人学和计算机视觉中的两个基本问题,其目的分别是估计三维矢量集和点云之间的旋转和变换。由于在实际应用中,在假定的向量或点对应关系中可能存在大量的离群值,鲁棒估计非常重要。在本文中,我们提出了ICOS(Inlier searching using Compatible Structures),一种新颖的,高效的和高度鲁棒的求解器,用于基于对应的旋转搜索和点云配准问题。具体来说,我们(i)提出并构建了一系列兼容的结构,可以建立各种不变量的两个问题,和(ii)设计三个时间效率的框架,第一个旋转搜索,第二个已知规模的注册和第三个未知规模的注册,过滤出离群值和寻找内点的不变量约束随机抽样的基础上提出的兼容结构。通过这种方式,即使有极端的离群值比率,也可以筛选出并收集内点,以有效地解决最佳旋转和变换,从而产生我们强大的求解器ICOS。通过对标准数据集的大量实验,我们证明:(i)我们的求解器ICOS快速,准确,鲁棒性超过95%的离群值,旋转搜索以及已知尺度和未知尺度配准的内点召回率接近100%,优于其他最先进的方法,(ii)ICOS适用于多种现实世界的应用。
Globally Optimal Solution to the Generalized Relative Pose Estimation Problem using Affine Correspondences
College of Aerospace Science and Engineering, National University of Defense Technology(航空科学与工程学院,国防科技大学);Global Navigation Satellite System Research Center, Wuhan University(导航卫星系统研究所,武汉大学)
SHReg: Strictly Rotation-Equivariant Point Cloud Registration via Spherical Harmonics
College of Mathematics and Systems Science, Shandong University of Science and Technology(山东科技大学数学与系统科学学院);School of Artificial Intelligence, Shandong Women’s University(山东女子学院人工智能学院)
RIGA: Rotation-Invariant and Globally-Aware Descriptors for Point Cloud Registration
Technical University of Munich(慕尼黑工业大学);Meta Reality Labs(Meta现实实验室);National University of Defense Technology(国防科技大学);Shanghai Jiao Tong University(上海交通大学);Siemens AG(西门子股份公司)