计算机科学
兰萨克
离群值
点云
人工智能
集成学习
随机森林
一致性(知识库)
修剪
集合(抽象数据类型)
一般化
机器学习
编码(集合论)
特征提取
模式识别(心理学)
数据挖掘
图像(数学)
数学
数学分析
农学
生物
程序设计语言
作者
Mingzhi Yuan,Kexue Fu,Zhihao Li,Yucong Meng,Ao Shen,Manning Wang
标识
DOI:10.1109/tcsvt.2024.3364175
摘要
Learning-based point cloud registration has achieved great success in recent years but is still limited by its generalization. The performance of these methods declines when they are extended to unseen datasets that have inconsistent distributions with the training set. In this paper, we propose a novel random network-based method, which does not require training. Our approach utilizes multiple randomly initialized networks for feature extraction and correspondence building. Furthermore, we also introduce a co-ensemble strategy to prune the outliers in correspondences built upon random networks, which leverages spatial consistency. Through our co-ensemble pruning, a large proportion of outliers can be removed, thereby achieving robust registration in affordable RANSAC iterations. Extensive experiments on 3DMatch and KITTI demonstrate that our method outperforms not only the traditional methods but also the learning-based methods trained on datasets inconsistent with the test set. The code will be released at https://github.com/phdymz/RandPCR.
科研通智能强力驱动
Strongly Powered by AbleSci AI