On the improvement of RPMNet for deep learning-based point cloud registration using a modified loss function

Kuo-Guan Wu, Cheng-Feng Lai, Min-Kuan Chang
{"title":"On the improvement of RPMNet for deep learning-based point cloud registration using a modified loss function","authors":"Kuo-Guan Wu, Cheng-Feng Lai, Min-Kuan Chang","doi":"10.1109/ICASI57738.2023.10179589","DOIUrl":null,"url":null,"abstract":"Point cloud registration involves the task of finding the alignment between pairs of point clouds. Recently, deep learning-based approaches have been shown to achieve more accurate results due to the enhanced feature extraction and correspondence matching mechanisms. Most of the deep learning-based approaches estimate the registration parameters directly without explicitly estimating correspondences. Instead, the correspondences are learned implicitly while networks are trained, and the loss functions used are mostly related to errors of registration parameters. RPMNet, one of the state-of-the-art registration methods, includes an additional component in the loss function to maximize the sum of inlier probabilities in order to prevent the problem of labeling most points as outliers. In this paper, we propose to improve the RPMNet through the modification of the loss function by replacing the sum of inlier probabilities with the sum of maximal matching probabilities, with the purpose of increasing the probability of correct correspondence and thus enhancing the registration performance. Simulation results demonstrate that an order of magnitude improvement can be achieved by the proposed method.","PeriodicalId":281254,"journal":{"name":"2023 9th International Conference on Applied System Innovation (ICASI)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 9th International Conference on Applied System Innovation (ICASI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICASI57738.2023.10179589","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Point cloud registration involves the task of finding the alignment between pairs of point clouds. Recently, deep learning-based approaches have been shown to achieve more accurate results due to the enhanced feature extraction and correspondence matching mechanisms. Most of the deep learning-based approaches estimate the registration parameters directly without explicitly estimating correspondences. Instead, the correspondences are learned implicitly while networks are trained, and the loss functions used are mostly related to errors of registration parameters. RPMNet, one of the state-of-the-art registration methods, includes an additional component in the loss function to maximize the sum of inlier probabilities in order to prevent the problem of labeling most points as outliers. In this paper, we propose to improve the RPMNet through the modification of the loss function by replacing the sum of inlier probabilities with the sum of maximal matching probabilities, with the purpose of increasing the probability of correct correspondence and thus enhancing the registration performance. Simulation results demonstrate that an order of magnitude improvement can be achieved by the proposed method.
基于深度学习的RPMNet点云配准改进研究
点云配准包括查找点云对之间的对齐。近年来,由于增强了特征提取和对应匹配机制,基于深度学习的方法已被证明可以获得更准确的结果。大多数基于深度学习的方法直接估计配准参数,而不显式估计对应关系。相反,在训练网络时隐式学习对应关系,使用的损失函数主要与配准参数的误差有关。RPMNet是最先进的配准方法之一,它在损失函数中包含一个额外的组件,以最大化内概率的总和,以防止将大多数点标记为离群值的问题。在本文中,我们提出通过修改损失函数来改进RPMNet,用最大匹配概率的和来代替内概率的和,以增加正确对应的概率,从而提高配准性能。仿真结果表明,该方法可实现一个数量级的改进。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信