神经网络模拟的ICP算法

S.Yu. Leonov, A. Vasilyev, A. Makovetskii, Egor Gordionok, V. Kober
{"title":"神经网络模拟的ICP算法","authors":"S.Yu. Leonov, A. Vasilyev, A. Makovetskii, Egor Gordionok, V. Kober","doi":"10.1117/12.2676383","DOIUrl":null,"url":null,"abstract":"The paper deals with the problem of overlapping two point-data clouds. Traditionally, iterative or variational methods are used to solve such problems. However, these methods are ineffective to solve tasks with a large number of points in the clouds or in the cases of task series with real-time cloud mapping. For those tasks, it is more appropriate to use neural network technique and deep learning methods. The overlap of point-data clouds is understood as finding the displacement vector between them and the rotation matrix of the clouds relative to each other. First of all, point-data clouds are reduced to the zero displacement by means of some transformation. To find the rotation matrix for transformed clouds the authors proposed a simple neural network implementation of the ICP algorithm. This implementation consists of two stages substantially formed by neural networks. At the first stage, a two-layer probabilistic network acts as a metric classifier. The first layer of the probabilistic network is composed of radial-basis elements – Gaussians. The Gaussian activation function makes it possible to identify the output of the first layer with the probability showing the proximity of the points of the superimposed clouds. The second layer of this network is competitive. As a result of the probabilistic network, the points of these two clouds are ranked according to the degree of proximity. The point-data clouds sorted by proximity are sent to the second single-layer neural network. On the second stage, the rotation matrix is calculated using the learning procedure according to the Hebb rule. In the case of small point clouds (less than 10 thousand points), it is more appropriate to use a pseudo-inverse rule (calculations using a pseudoinverse Penrose-Moore matrix) based on the Hebb rule. At the output of the second stage, the rotation matrix is obtained, with which we can easily calculate the displacement vector of the original point clouds. The approbation of the proposed point-data cloud overlap method showed a good match on samples from the ModelNet40 database.","PeriodicalId":434863,"journal":{"name":"Optical Engineering + Applications","volume":"78 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Neural network analog of the ICP algorithm\",\"authors\":\"S.Yu. Leonov, A. Vasilyev, A. Makovetskii, Egor Gordionok, V. Kober\",\"doi\":\"10.1117/12.2676383\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper deals with the problem of overlapping two point-data clouds. Traditionally, iterative or variational methods are used to solve such problems. However, these methods are ineffective to solve tasks with a large number of points in the clouds or in the cases of task series with real-time cloud mapping. For those tasks, it is more appropriate to use neural network technique and deep learning methods. The overlap of point-data clouds is understood as finding the displacement vector between them and the rotation matrix of the clouds relative to each other. First of all, point-data clouds are reduced to the zero displacement by means of some transformation. To find the rotation matrix for transformed clouds the authors proposed a simple neural network implementation of the ICP algorithm. This implementation consists of two stages substantially formed by neural networks. At the first stage, a two-layer probabilistic network acts as a metric classifier. The first layer of the probabilistic network is composed of radial-basis elements – Gaussians. The Gaussian activation function makes it possible to identify the output of the first layer with the probability showing the proximity of the points of the superimposed clouds. The second layer of this network is competitive. As a result of the probabilistic network, the points of these two clouds are ranked according to the degree of proximity. The point-data clouds sorted by proximity are sent to the second single-layer neural network. On the second stage, the rotation matrix is calculated using the learning procedure according to the Hebb rule. In the case of small point clouds (less than 10 thousand points), it is more appropriate to use a pseudo-inverse rule (calculations using a pseudoinverse Penrose-Moore matrix) based on the Hebb rule. At the output of the second stage, the rotation matrix is obtained, with which we can easily calculate the displacement vector of the original point clouds. The approbation of the proposed point-data cloud overlap method showed a good match on samples from the ModelNet40 database.\",\"PeriodicalId\":434863,\"journal\":{\"name\":\"Optical Engineering + Applications\",\"volume\":\"78 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-10-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Optical Engineering + Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1117/12.2676383\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Optical Engineering + Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1117/12.2676383","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文研究了两个点数据云的重叠问题。传统上,迭代或变分方法用于解决这类问题。然而,这些方法对于云中有大量点的任务或具有实时云映射的任务系列来说是无效的。对于这些任务,使用神经网络技术和深度学习方法更为合适。点数据云的重叠被理解为找到它们之间的位移向量和云相对于彼此的旋转矩阵。首先,通过变换将点数据云降为零位移。为了求出变换后的云的旋转矩阵,作者提出了一种简单的ICP算法的神经网络实现。该实现由两个阶段组成,基本上由神经网络构成。在第一阶段,一个两层概率网络作为度量分类器。概率网络的第一层由径向基元-高斯元组成。高斯激活函数使识别第一层的输出成为可能,其概率显示叠加云点的接近度。这个网络的第二层是竞争性的。作为概率网络的结果,这两个云的点根据接近程度排序。根据接近度排序的点数据云被发送到第二层单层神经网络。在第二阶段,根据Hebb规则使用学习程序计算旋转矩阵。在小点云(小于1万个点)的情况下,使用基于Hebb规则的伪逆规则(使用伪逆Penrose-Moore矩阵计算)更为合适。在第二阶段的输出,得到旋转矩阵,我们可以很容易地计算原始点云的位移向量。所提出的点数据云重叠方法与ModelNet40数据库样本的匹配效果良好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Neural network analog of the ICP algorithm
The paper deals with the problem of overlapping two point-data clouds. Traditionally, iterative or variational methods are used to solve such problems. However, these methods are ineffective to solve tasks with a large number of points in the clouds or in the cases of task series with real-time cloud mapping. For those tasks, it is more appropriate to use neural network technique and deep learning methods. The overlap of point-data clouds is understood as finding the displacement vector between them and the rotation matrix of the clouds relative to each other. First of all, point-data clouds are reduced to the zero displacement by means of some transformation. To find the rotation matrix for transformed clouds the authors proposed a simple neural network implementation of the ICP algorithm. This implementation consists of two stages substantially formed by neural networks. At the first stage, a two-layer probabilistic network acts as a metric classifier. The first layer of the probabilistic network is composed of radial-basis elements – Gaussians. The Gaussian activation function makes it possible to identify the output of the first layer with the probability showing the proximity of the points of the superimposed clouds. The second layer of this network is competitive. As a result of the probabilistic network, the points of these two clouds are ranked according to the degree of proximity. The point-data clouds sorted by proximity are sent to the second single-layer neural network. On the second stage, the rotation matrix is calculated using the learning procedure according to the Hebb rule. In the case of small point clouds (less than 10 thousand points), it is more appropriate to use a pseudo-inverse rule (calculations using a pseudoinverse Penrose-Moore matrix) based on the Hebb rule. At the output of the second stage, the rotation matrix is obtained, with which we can easily calculate the displacement vector of the original point clouds. The approbation of the proposed point-data cloud overlap method showed a good match on samples from the ModelNet40 database.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信