A Simple Algorithm for Non-cooperative Target Recognition Based on Lidar

Peng Li, Mao Wang, Jinyu Fu, Yankun Wang
{"title":"A Simple Algorithm for Non-cooperative Target Recognition Based on Lidar","authors":"Peng Li, Mao Wang, Jinyu Fu, Yankun Wang","doi":"10.1109/ICCR55715.2022.10053919","DOIUrl":null,"url":null,"abstract":"Aiming at the problem of simple and fast recognition of non-cooperative targets in 3D space, a simple recognition algorithm for point cloud targets is proposed. First, the point cloud data was divided into $n$ categories with the first K-means clustering. Second, the target class was identified with a coarse sieve, and the speed of the algorithm was improved with sparse processing. The more accurate target class was obtained with secondary clustering. The two types of point cloud data are processed by principal component analysis (PCA), which obtains the feature root matrices. Then cosine distance matching was applied to the feature root matrices and target library (trained by 12 groups of point cloud data). This type of data was retained when the similarity was greater than the upper threshold. Therefore, the center point coordinates, distances, and similarity of the target were outputted. The experimental test results of the 13th and 14th groups indicated that the target segmentation similarity of this algorithm could reach 95.75% and 96.98% respectively, and the accuracy reached 100%.","PeriodicalId":441511,"journal":{"name":"2022 4th International Conference on Control and Robotics (ICCR)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 4th International Conference on Control and Robotics (ICCR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCR55715.2022.10053919","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Aiming at the problem of simple and fast recognition of non-cooperative targets in 3D space, a simple recognition algorithm for point cloud targets is proposed. First, the point cloud data was divided into $n$ categories with the first K-means clustering. Second, the target class was identified with a coarse sieve, and the speed of the algorithm was improved with sparse processing. The more accurate target class was obtained with secondary clustering. The two types of point cloud data are processed by principal component analysis (PCA), which obtains the feature root matrices. Then cosine distance matching was applied to the feature root matrices and target library (trained by 12 groups of point cloud data). This type of data was retained when the similarity was greater than the upper threshold. Therefore, the center point coordinates, distances, and similarity of the target were outputted. The experimental test results of the 13th and 14th groups indicated that the target segmentation similarity of this algorithm could reach 95.75% and 96.98% respectively, and the accuracy reached 100%.
一种基于激光雷达的非合作目标识别算法
针对三维空间非合作目标的简单快速识别问题,提出了一种简单的点云目标识别算法。首先,对点云数据进行K-means聚类,划分为$n$类;其次,采用粗筛对目标类进行识别,并通过稀疏处理提高算法的速度;通过二次聚类可以得到更精确的目标类。对两类点云数据进行主成分分析,得到特征根矩阵。然后对特征根矩阵和目标库(由12组点云数据训练)进行余弦距离匹配。当相似度大于上限阈值时,保留这类数据。因此,输出目标的中心点坐标、距离和相似度。第13组和第14组的实验测试结果表明,该算法的目标分割相似度分别可以达到95.75%和96.98%,准确率达到100%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信