兰萨克
等变映射
点云
旋转(数学)
人工智能
不变(物理)
数学
刚性变换
点集注册
转化(遗传学)
模式识别(心理学)
计算机视觉
计算机科学
束流调整
匹配(统计)
算法
点(几何)
几何学
图像(数学)
纯数学
生物化学
统计
基因
数学物理
化学
作者
Yue Cao,Yujiao Shi,Ziang Cheng,Hongdong Li
标识
DOI:10.1109/iros55552.2023.10342154
摘要
Point cloud registration (PCR) aims to recover the rigid transformation between two noisy, unordered point sets. This task is typically tackled by establishing point-wise correspondences, and solving the rigid transformation between the two sets. Since descriptor-based methods find correspondences by matching the feature space distance, a powerful and rotation-robust point feature extractor is critical to the success of this task. Existing methods assume soft rotation invariance/equivariance through the means of training augmentation, rotational discretization or pre-alignment of patches. In contrast, this paper proposes a new method which generates fully rotation invariant and equivariant descriptors by construction. For each keypoint patch, our network extracts not only a rotation invariant descriptor for establishing corre-spondences, but also a rotation equivariant one. The rotation equivariant descriptor allows relative transformation to be directly recovered from a single correspondence pair, unlike standard methods that require three correspondences. This design significantly reduces iteration number of RANSAC and guarantees high registration recall when the inlier ratio of estimated correspondences is low. Extensive experiments have demonstrated that the proposed method outperforms state-of-art methods in the same category even after much fewer RANSAC iterations.
科研通智能强力驱动
Strongly Powered by AbleSci AI