期刊文献+

基于面属性相似的CAD模型检索方法 被引量:2

CAD Models Retrieval Based on the Similarity of Face Attributes
下载PDF
导出
摘要 针对现有基于面属性图需要应用图匹配或子图匹配计算来实现CAD模型的形状匹配,且其模型检索方法存在检索效率低下或检索结果不够准确的问题,提出了一种基于面属性相似的CAD模型检索方法。在现有的模型面属性基础上,引入了包含较多属性的面特征属性和面几何边界特征属性来表达CAD模型的形状特征。特别是外环边循环码可以更详细地表达模型的面几何边界特征属性,只需要采用简单的模型面属性相似性度量方法就能实现CAD模型的形状检索。实验结果表明,该方法能够实现CAD模型的形状检索,其检索效率和精准程度能够满足实际需要,显著提高了CAD模型面的形状辨识能力。 A CAD model retrieval method based on the similarity of face attributes was presented in order to resolve the prob-lem that graph matching or sub-graph matching realizing the CAD model retrieval based on face attribute graph may not be effec-tive and efficient enough.Based on the existing representations for face attributes, the face attributes and geometry boundary at-tributes were introduced to represent the shape of CAD models.In particular, cycle code of the outer edges was adopted to de-scribe the shape of CAD models in detail, which greatly increased the resolution of the face shape.Thus, the similar evaluations between the compared models were used for realizing the CAD model retrieval instead of graph matching or sub-graph matching. Experimental results show that this method is able to support CAD model retrieval and its efficiency and effect meets the require-ment of practical applications.
出处 《武汉理工大学学报(信息与管理工程版)》 CAS 2015年第5期537-541,共5页 Journal of Wuhan University of Technology:Information & Management Engineering
基金 国家自然科学基金资助项目(51475186) 湖北省教育厅科研基金资助项目(B2013229)
关键词 面属性图 外环边循环码 模型检索 子图匹配 face attribute graph cycle code of the outer edges model retrieval sub-graph matching
  • 相关文献

参考文献11

二级参考文献57

  • 1郑伯川,彭维,张引,叶修梓,张三元.3D模型检索技术综述[J].计算机辅助设计与图形学学报,2004,16(7):873-881. 被引量:66
  • 2邹潇湘,戴琼.图同构中的一类顶点细分方法[J].软件学报,2007,18(2):213-219. 被引量:6
  • 3Sinkhorn R. A relationship between arbitrary positive matrices and doubly stochastic matrices [J]. The Annals of Mathematical Statistics, 1964, 35(2): 876-879. 被引量:1
  • 4Gao S, Shah J J. Automatic recognition of interacting machining features based on minimal condition subgraph [J]. Computer Aided Design, 1998, 30(9): 727-739. 被引量:1
  • 5Gold S, Rangarajan A. A graduated assignment algorithm for graph matching [J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 1996, 18(4): 377-388. 被引量:1
  • 6Geiger 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. 被引量:1
  • 7Ullmann J R. An algorithm for subgraph isomorphism [J]. Journal of the Association for Computing Machinery, 1976, 23(1) : 31-42. 被引量:1
  • 8Wong 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. 被引量:1
  • 9Cross 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. 被引量:1
  • 10Caelli 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. 被引量:1

共引文献65

同被引文献32

引证文献2

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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