期刊文献+

一种装配体模型的离散量化与相似性分析方法 被引量:2

A method for discrete quantization and similarity analysis of assembly model
原文传递
导出
摘要 装配体模型相似性分析作为产品信息重用领域的重点问题而得到广泛关注,目前一些方法利用图论的相关知识,能够实现结构信息的发掘但通常较为复杂,也有一些方法从向量集合的角度入手以获得更好的计算效率,但忽略了零件间的连接关系。针对这些方法的优势与不足,提出了一种基于结构离散的装配体模型信息量化方法,将装配体结构信息融入向量化描述符中,并建立相应的索引结构与相似性度量方法。该方法首先提取装配体中结构特征形成连接图,并将装配体分解为若干个相互连接的零件构成的结构单元;然后,利用结构-形状距离函数对各个结构单元进行量化表征,以此为基础构建基于高维向量的装配体描述符;最后,基于词袋(BOW)模型和超球体软分配策略建立倒排索引与过滤机制,通过求解查询装配体模型与库模型间的最优匹配,最终实现装配体模型的相似性分析。 Similarity analysis of the assembly model is widely concerned in the field of product information reuse.At present,some methods utilize the graph theory to excavate structural information,but they are usually complicated.There are also some methods considering the vector collection to get better computing efficiency,but they ignore the connection between parts.Based on the advantages and disadvantages of these methods,this paper proposes an assembly model information quantization method,which integrates structural information into vectorization descriptor and establishes a corresponding index structure and similarity measurement method.First,a connection graph is used to represent the structure features of the assembly,and interconnected part models are divided into several structural units.Then,each structural unit is quantified by the structure-shape distribution function.On this basis,the point set-based assembly descriptor is constructed.Finally,an inverted index and filtering mechanism is established based on the Bag of Word(BOW)algorithm and hypersphere soft allocation strategy.By solving the optimal matching between the query assembly model and the library model,similarity analysis of the assembly model is ultimately realized.
作者 张杰 季宝宁 杨宁 唐文斌 ZHANG Jie;JI Baoning;YANG Ning;TANG Wenbin(School of Mechanical Engineering,Northwestern Polytechnical University,Xi'an 710129,China;School of Mechanical and Electrical Engineering,Xi'an Polytechnic University,Xi'an 710048,China)
出处 《航空学报》 EI CAS CSCD 北大核心 2021年第10期363-373,共11页 Acta Aeronautica et Astronautica Sinica
基金 国家自然科学基金(51475371) 陕西省重点研发计划(2019ZDLGY02-01)。
关键词 装配体检索 结构-形状距离 结构离散化 BOW索引 相似性分析 assembly retrieval structure-shape distance structural discretization BOW indexing similarity analysis
  • 相关文献

参考文献3

二级参考文献25

  • 1张旭堂,刘文剑.基于二分图的装配体检索研究[J].计算机辅助设计与图形学学报,2005,17(9):2106-2111. 被引量:7
  • 2Sinkhorn R. A relationship between arbitrary positive matrices and doubly stochastic matrices [J]. The Annals of Mathematical Statistics, 1964, 35(2): 876-879.
  • 3Gao S, Shah J J. Automatic recognition of interacting machining features based on minimal condition subgraph [J]. Computer Aided Design, 1998, 30(9): 727-739.
  • 4Gold S, Rangarajan A. A graduated assignment algorithm for graph matching [J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 1996, 18(4): 377-388.
  • 5Geiger D, Girosi F. Parallel and deterministic algorithms from MRF's: surface reconstruction [J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 1991, 13 (5): 401-412.
  • 6Ullmann J R. An algorithm for subgraph isomorphism [J]. Journal of the Association for Computing Machinery, 1976, 23(1) : 31-42.
  • 7Wong A K C, You M, Chan S C. An algorithm for graph optimal monomorphism [J]. IEEE Transactions on Systems, Man and Cybernetics, 1990, 20(3): 628-636.
  • 8Cross A D J, Myers R, Hancock E R. Convergence of a hill climbing genetic algorithm for graph matching [J]. Pattern Recognition, 2000, 33(11): 1863-1880.
  • 9Caelli T, Kosinov S. An eigenspace projection clustering method for inexact graph matching [J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2004, 26 (4) : 515-519.
  • 10Brijnesh J J, Fritz W. Solving inexact graph isomorphism problems using neural networks [J]. Neurocomputing, 2005, 63 : 45-67.

共引文献51

同被引文献13

引证文献2

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部