根据相应点的有序和无序特征建立统一余量模型

IF 2.9 3区 工程技术 Q2 ENGINEERING, ELECTRICAL & ELECTRONIC
Jingyu Sun , Yadong Gong , Songhua Li , Chuang Zuo , Zichen Zhao , Jibin Zhao , Hongyao Zhang , Ming Cai
{"title":"根据相应点的有序和无序特征建立统一余量模型","authors":"Jingyu Sun ,&nbsp;Yadong Gong ,&nbsp;Songhua Li ,&nbsp;Chuang Zuo ,&nbsp;Zichen Zhao ,&nbsp;Jibin Zhao ,&nbsp;Hongyao Zhang ,&nbsp;Ming Cai","doi":"10.1016/j.dsp.2025.105256","DOIUrl":null,"url":null,"abstract":"<div><div>Registration is the basis for visual guidance in automated machining processes. This paper focuses on models which are with similar spatial structures. Using bounding boxes to represent outer contours, we extract sparse feature points from point clouds. In this process, matching results are critically affected by erroneous point pairs. Therefore, this paper introduces the Kullback-Leibler (K-L) divergence into the topography evaluation function. A sequential motion-invariant matrix is added to the function to describe the corresponding relationship. To even out the machining allowance, we propose a fine registration method. It considers minimizing variance in the allowance and tangent distance between corresponding points. Meanwhile, the judge criteria of similarity are proposed. They are based on the Hausdorff-Cosine similarity function. This function accounts for angles between neighboring point normals, reducing misidentification and ensuring correct counterparts are included in calculations. Compared with other algorithms, the method improves accuracy, speed of calculations, and ability to resist Gaussian noise. The resulting model ensures uniform allowance distribution. It's a visual prerequisite for further processing.</div></div>","PeriodicalId":51011,"journal":{"name":"Digital Signal Processing","volume":"164 ","pages":"Article 105256"},"PeriodicalIF":2.9000,"publicationDate":"2025-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Uniform allowance model built on the ordered and disordered features of corresponding points\",\"authors\":\"Jingyu Sun ,&nbsp;Yadong Gong ,&nbsp;Songhua Li ,&nbsp;Chuang Zuo ,&nbsp;Zichen Zhao ,&nbsp;Jibin Zhao ,&nbsp;Hongyao Zhang ,&nbsp;Ming Cai\",\"doi\":\"10.1016/j.dsp.2025.105256\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Registration is the basis for visual guidance in automated machining processes. This paper focuses on models which are with similar spatial structures. Using bounding boxes to represent outer contours, we extract sparse feature points from point clouds. In this process, matching results are critically affected by erroneous point pairs. Therefore, this paper introduces the Kullback-Leibler (K-L) divergence into the topography evaluation function. A sequential motion-invariant matrix is added to the function to describe the corresponding relationship. To even out the machining allowance, we propose a fine registration method. It considers minimizing variance in the allowance and tangent distance between corresponding points. Meanwhile, the judge criteria of similarity are proposed. They are based on the Hausdorff-Cosine similarity function. This function accounts for angles between neighboring point normals, reducing misidentification and ensuring correct counterparts are included in calculations. Compared with other algorithms, the method improves accuracy, speed of calculations, and ability to resist Gaussian noise. The resulting model ensures uniform allowance distribution. It's a visual prerequisite for further processing.</div></div>\",\"PeriodicalId\":51011,\"journal\":{\"name\":\"Digital Signal Processing\",\"volume\":\"164 \",\"pages\":\"Article 105256\"},\"PeriodicalIF\":2.9000,\"publicationDate\":\"2025-04-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Digital Signal Processing\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1051200425002787\",\"RegionNum\":3,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"ENGINEERING, ELECTRICAL & ELECTRONIC\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Digital Signal Processing","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1051200425002787","RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

摘要

配准是自动化加工过程中视觉导向的基础。本文主要研究具有相似空间结构的模型。利用边界框表示外轮廓,从点云中提取稀疏特征点。在此过程中,错误的点对会严重影响匹配结果。因此,本文将Kullback-Leibler (K-L)散度引入地形评价函数。在函数中加入一个序列运动不变矩阵来描述相应的关系。为了均匀加工余量,我们提出了一种精细配准方法。它考虑了最小方差的余量和切线距离之间的对应点。同时,提出了相似度的判断标准。它们基于hausdorff - cos相似函数。该函数考虑相邻点法线之间的角度,减少错误识别并确保计算中包含正确的对应物。与其他算法相比,该方法提高了计算精度、计算速度和抗高斯噪声能力。所得模型保证了余量分布均匀。这是进一步处理的视觉先决条件。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Uniform allowance model built on the ordered and disordered features of corresponding points
Registration is the basis for visual guidance in automated machining processes. This paper focuses on models which are with similar spatial structures. Using bounding boxes to represent outer contours, we extract sparse feature points from point clouds. In this process, matching results are critically affected by erroneous point pairs. Therefore, this paper introduces the Kullback-Leibler (K-L) divergence into the topography evaluation function. A sequential motion-invariant matrix is added to the function to describe the corresponding relationship. To even out the machining allowance, we propose a fine registration method. It considers minimizing variance in the allowance and tangent distance between corresponding points. Meanwhile, the judge criteria of similarity are proposed. They are based on the Hausdorff-Cosine similarity function. This function accounts for angles between neighboring point normals, reducing misidentification and ensuring correct counterparts are included in calculations. Compared with other algorithms, the method improves accuracy, speed of calculations, and ability to resist Gaussian noise. The resulting model ensures uniform allowance distribution. It's a visual prerequisite for further processing.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Digital Signal Processing
Digital Signal Processing 工程技术-工程:电子与电气
CiteScore
5.30
自引率
17.20%
发文量
435
审稿时长
66 days
期刊介绍: Digital Signal Processing: A Review Journal is one of the oldest and most established journals in the field of signal processing yet it aims to be the most innovative. The Journal invites top quality research articles at the frontiers of research in all aspects of signal processing. Our objective is to provide a platform for the publication of ground-breaking research in signal processing with both academic and industrial appeal. The journal has a special emphasis on statistical signal processing methodology such as Bayesian signal processing, and encourages articles on emerging applications of signal processing such as: • big data• machine learning• internet of things• information security• systems biology and computational biology,• financial time series analysis,• autonomous vehicles,• quantum computing,• neuromorphic engineering,• human-computer interaction and intelligent user interfaces,• environmental signal processing,• geophysical signal processing including seismic signal processing,• chemioinformatics and bioinformatics,• audio, visual and performance arts,• disaster management and prevention,• renewable energy,
×
引用
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学术官方微信