A Hybrid Recognition Framework for Highly Interacting Machining Features Based on Primitive Decomposition, Learning and Reconstruction

IF 3 3区 计算机科学 Q2 COMPUTER SCIENCE, SOFTWARE ENGINEERING
Jianping Yang , Qiaoyun Wu , Yuan Zhang , Jiajia Dai , Jun Wang
{"title":"A Hybrid Recognition Framework for Highly Interacting Machining Features Based on Primitive Decomposition, Learning and Reconstruction","authors":"Jianping Yang ,&nbsp;Qiaoyun Wu ,&nbsp;Yuan Zhang ,&nbsp;Jiajia Dai ,&nbsp;Jun Wang","doi":"10.1016/j.cad.2024.103813","DOIUrl":null,"url":null,"abstract":"<div><div>For the highly interacting machining features, Layered Projection Decomposition Method presents inferior recognition efficiency and accuracy, due to its high-cost 3D projection and failures in determining projection faces for internal occluded faces. To address these issues, we propose a potential hybrid recognition framework. We first introduce a straightforward adjacent projection wire (APW) over UV wires, automatically restoring the full projection wires from highly interacting features. Building on APWs, an efficient hybrid boundary representation and its corresponding unambiguous primitive definitions are proposed by combining with graph-based boundary representations. Subsequently, we design an efficient primitive decomposition method by introducing primitive boundary matching to decide the initial projection faces, and introducing iterative projection boundary expansion to complete the full primitives from occluded faces. Moreover, we establish an efficient Graph Neural Network to learn the distinguishable distributions over the decomposed primitives. Specifically, an Adjacency Attention Unit is proposed to automatically perceive the influence weight of adjacent nodes, leading to more discriminative self-adaptive shape embedding for efficient primitive recognition. Finally, we summarize convenient reconstruction rules to correct the wrong predictions of feature faces with indistinguishable adjacent relationships. To evaluate the effectiveness of the proposed recognition framework, CAD models of complex aircraft structural parts are collected to present a challenging machining feature dataset. Extensive numerical experiments demonstrate that the proposed hybrid recognition framework enables significant improvements over the state-of-the-art machining feature recognition techniques.</div></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":"179 ","pages":"Article 103813"},"PeriodicalIF":3.0000,"publicationDate":"2024-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer-Aided Design","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0010448524001404","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

Abstract

For the highly interacting machining features, Layered Projection Decomposition Method presents inferior recognition efficiency and accuracy, due to its high-cost 3D projection and failures in determining projection faces for internal occluded faces. To address these issues, we propose a potential hybrid recognition framework. We first introduce a straightforward adjacent projection wire (APW) over UV wires, automatically restoring the full projection wires from highly interacting features. Building on APWs, an efficient hybrid boundary representation and its corresponding unambiguous primitive definitions are proposed by combining with graph-based boundary representations. Subsequently, we design an efficient primitive decomposition method by introducing primitive boundary matching to decide the initial projection faces, and introducing iterative projection boundary expansion to complete the full primitives from occluded faces. Moreover, we establish an efficient Graph Neural Network to learn the distinguishable distributions over the decomposed primitives. Specifically, an Adjacency Attention Unit is proposed to automatically perceive the influence weight of adjacent nodes, leading to more discriminative self-adaptive shape embedding for efficient primitive recognition. Finally, we summarize convenient reconstruction rules to correct the wrong predictions of feature faces with indistinguishable adjacent relationships. To evaluate the effectiveness of the proposed recognition framework, CAD models of complex aircraft structural parts are collected to present a challenging machining feature dataset. Extensive numerical experiments demonstrate that the proposed hybrid recognition framework enables significant improvements over the state-of-the-art machining feature recognition techniques.
基于基元分解、学习和重构的高度交互加工特征混合识别框架
对于高度交互的加工特征,分层投影分解法的识别效率和准确性较低,原因是其三维投影成本较高,且无法确定内部遮挡面的投影面。为了解决这些问题,我们提出了一种潜在的混合识别框架。首先,我们在 UV 线之上引入了直接的相邻投影线(APW),自动从高度交互的特征中恢复完整的投影线。在 APW 的基础上,我们结合基于图的边界表示法,提出了一种高效的混合边界表示法及其相应的无歧义基元定义。随后,我们设计了一种高效的基元分解方法,通过引入基元边界匹配来决定初始投影面,并引入迭代投影边界扩展来完成从遮挡面到完整基元的分解。此外,我们还建立了一个高效的图神经网络来学习分解基元的可区分分布。具体来说,我们提出了一个邻接注意单元,用于自动感知相邻节点的影响权重,从而实现更具辨别力的自适应形状嵌入,以实现高效的基元识别。最后,我们总结了方便的重构规则,以纠正对相邻关系无法区分的特征面的错误预测。为了评估所提出的识别框架的有效性,我们收集了复杂飞机结构部件的 CAD 模型,以提供一个具有挑战性的加工特征数据集。广泛的数值实验证明,与最先进的加工特征识别技术相比,所提出的混合识别框架能够实现显著的改进。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Computer-Aided Design
Computer-Aided Design 工程技术-计算机:软件工程
CiteScore
5.50
自引率
4.70%
发文量
117
审稿时长
4.2 months
期刊介绍: Computer-Aided Design is a leading international journal that provides academia and industry with key papers on research and developments in the application of computers to design. Computer-Aided Design invites papers reporting new research, as well as novel or particularly significant applications, within a wide range of topics, spanning all stages of design process from concept creation to manufacture and beyond.
×
引用
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学术官方微信