Second-order Spatial Measures Low Overlap Rate Point Cloud Registration Algorithm Based On FPFH Features1

Zewei Lian, Xiaogang Wang, Junjie Lin, Liuhong Zhang, Mingming Tang
{"title":"Second-order Spatial Measures Low Overlap Rate Point Cloud Registration Algorithm Based On FPFH Features1","authors":"Zewei Lian, Xiaogang Wang, Junjie Lin, Liuhong Zhang, Mingming Tang","doi":"10.3233/aic-230217","DOIUrl":null,"url":null,"abstract":"When the sensor dynamically collects point cloud data for object or map reconstruction, the registration effect is poor and reconstruction application is difficult with a too low overlap rate of the collected point cloud data. The reason is that the objects are covered, the sensor rotation angle is too large and the speed of movement is too fast. Because of these problems, this paper proposes a point cloud registration algorithm based on FPFH feature matching, combined with second-order spatial measures. Firstly, using the FPFH feature extraction algorithm, the features of each point are extracted, and then feature matching is performed to generate the set of feature point pairs. Secondly, the second-order spatial measure is used to calculate the set of feature point pairs to obtain the second-order spatial measure matrix scores and sort them. Finally, the dichotomy method is used to find the appropriate second-order spatial measure scores for distinguishing the inner points (points in the overlap region) from the outer points (points that do not belong to the overlap region as well as the mismatched points and some disturbances). The contrast experiments between this algorithm and three common point cloud registration algorithms, FPFH-ICP, 4PCS-ICP, and NDT-ICP, on the Stanford dataset and 3DMatch dataset shows that the registration accuracy of the other algorithms decreases significantly with a low overlap rate. But this algorithm still has a high registration accuracy and is less affected by outliers than the other algorithms. Besides, this algorithm can still maintain a good registration effect on different data sets.","PeriodicalId":505412,"journal":{"name":"AI Communications","volume":"59 47","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"AI Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3233/aic-230217","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

When the sensor dynamically collects point cloud data for object or map reconstruction, the registration effect is poor and reconstruction application is difficult with a too low overlap rate of the collected point cloud data. The reason is that the objects are covered, the sensor rotation angle is too large and the speed of movement is too fast. Because of these problems, this paper proposes a point cloud registration algorithm based on FPFH feature matching, combined with second-order spatial measures. Firstly, using the FPFH feature extraction algorithm, the features of each point are extracted, and then feature matching is performed to generate the set of feature point pairs. Secondly, the second-order spatial measure is used to calculate the set of feature point pairs to obtain the second-order spatial measure matrix scores and sort them. Finally, the dichotomy method is used to find the appropriate second-order spatial measure scores for distinguishing the inner points (points in the overlap region) from the outer points (points that do not belong to the overlap region as well as the mismatched points and some disturbances). The contrast experiments between this algorithm and three common point cloud registration algorithms, FPFH-ICP, 4PCS-ICP, and NDT-ICP, on the Stanford dataset and 3DMatch dataset shows that the registration accuracy of the other algorithms decreases significantly with a low overlap rate. But this algorithm still has a high registration accuracy and is less affected by outliers than the other algorithms. Besides, this algorithm can still maintain a good registration effect on different data sets.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于 FPFH 特征的二阶空间度量低重叠率点云注册算法1
当传感器动态采集点云数据用于物体或地图重建时,由于采集的点云数据重叠率太低,注册效果差,重建应用困难。究其原因,主要是物体被遮挡、传感器旋转角度过大、运动速度过快等。针对这些问题,本文提出了一种基于 FPFH 特征匹配并结合二阶空间度量的点云注册算法。首先,利用 FPFH 特征提取算法提取每个点的特征,然后进行特征匹配,生成特征点对集合。其次,利用二阶空间度量对特征点对集合进行计算,得到二阶空间度量矩阵得分并进行排序。最后,使用二分法找到合适的二阶空间度量得分,用于区分内层点(重叠区域内的点)和外层点(不属于重叠区域的点以及不匹配点和一些干扰点)。在斯坦福数据集和 3DMatch 数据集上,该算法与 FPFH-ICP、4PCS-ICP 和 NDT-ICP 这三种常见点云注册算法的对比实验表明,当重叠率较低时,其他算法的注册精度会明显下降。但与其他算法相比,该算法仍具有较高的配准精度,且受异常值的影响较小。此外,该算法还能在不同的数据集上保持良好的配准效果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Second-order Spatial Measures Low Overlap Rate Point Cloud Registration Algorithm Based On FPFH Features1 Multimodal biometric authentication: A review A multi-average based pseudo nearest neighbor classifier The CADE-29 Automated Theorem Proving System Competition – CASC-29 Doubly stochastic subdomain mining with sample reweighting for unsupervised domain adaptive person re-identification
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1