期刊文献+

一种允许误差的异构图形语义匹配技术

Algorithm for Error-Tolerant Semantic Matching of Heterogeneous Graphics
下载PDF
导出
摘要 为解决二维和三维异构图形数据匹配问题,以流程工厂协同设计为背景,提出了基于允许误差的最大语义匹配算法(MSMGE).该算法首先用类无向图描述二维和三维图形数据的工程属性和拓扑关系,消除了研究对象的异构性;然后,用语义表达式表示类无向图顶点与边的语义关系,将二维和三维异构图形数据的匹配转化为允许误差最大公共序列的匹配;最后,通过采用基于工程语义的类无向图语义分割、语义规整和语义裁剪等方法降低MSMGE的复杂度.研究表明,用此算法,匹配精度能够达到90%以上. In order to realize matching of 2D and 3D heterogeneous graphic data,an algorithm,named as MSMGE,for error-tolerant semantic matching of heterogeneous graphic data was presented based on the computer supported cooperative work in plant design.With this algorithm,the undirected-graph-like is used to represent the engineering properties and topological relations of 2D and 3D graphic data to smooth away the heterogeneity of the graphic data.And then,the semantic expression is adopted to describe the semantic relations among vertexes and edges in the undirected-graph-like to transform the semantic matching of heterogeneous graphic data into largest common subsequence error-tolerant matching.Lastly,the graphic partitioning based on engineering semantics,the semantic normalization and the semantic pruning are adopted in order to reduce the complexity of MSMGE.The research result shows that with the presented algorithm,the matching precision can exceed 90%.
出处 《西南交通大学学报》 EI CSCD 北大核心 2010年第4期589-595,共7页 Journal of Southwest Jiaotong University
基金 河南省教育厅自然科学研究计划项目(2009B520019) 洛阳理工学院博士启动基金(2008BZ12)的资助
关键词 计算机图形学 语义匹配 图匹配 异构图形 computer graphics semantic matching graph matching heterogeneous graphic
  • 相关文献

参考文献3

二级参考文献22

  • 1徐周波,古天龙,赵岭忠.网络最大流问题求解的符号ADD增广路径算法[J].计算机科学,2005,32(10):38-40. 被引量:9
  • 2凌永发,王杰,李正明.网络最大流问题典型组合算法研究[J].云南民族大学学报(自然科学版),2006,15(3):211-214. 被引量:8
  • 3吴海燕,高进博,冷传才.路网容量最大流的一种改进算法[J].交通运输系统工程与信息,2006,6(2):51-56. 被引量:7
  • 4桂岚.交通网络设计的优化模型及算法[J].系统工程,2006,24(12):26-32. 被引量:18
  • 5甘爱英.运筹学[M].北京:清华大学出版社,2002:254-278.
  • 6焦永兰.管理运筹学[M].北京:中国铁道出版社,2005:145-191.
  • 7AVINDRA R K, THOMAS M L, JAMES O B. Network flows : theory, algorithms, and applications [ M ]. Princeton: Prentice- Hall, 1993 : 46-210.
  • 8NI Daiheng. Determining traffic flow characteristics by definition for application in ITS [ J ]. IEEE Transactions on Intelligent Transportation Systems, 2007, 8 (2) : 181-187.
  • 9GOLDBERG A V, RAO S. Flows in undirected unit capacity networks[ J]. SIAM J. Discrete Math., 1999, 12( 1 ) : 1-5.
  • 10HACHTEL G D, SOMENZI F. A symbolic algorithm for maximum flow in 0-1 networks [ J ]. Formal Methods in System Design, 1997, 10(2-3): 207-219.

共引文献14

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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