期刊文献+

融合拓扑特征和领域特征的非精确图匹配算法 被引量:3

INEXACT GRAPH MATCHING ALGORITHM INTEGRATING TOPOLOGICAL FEATURES AND DOMAIN FEATURES
下载PDF
导出
摘要 针对结构模式识别领域中现有图匹配算法对反映图本身拓扑结构的节点特征挖掘不够充分的问题,提出融合拓扑特征和领域特征的非精确图匹配算法。利用建筑学与城市规划学科中的空间句法理论构造图拓扑特征的量化描述,并将其与节点属性和边属性等其他领域的非拓扑特征相结合,构造描述图特征的特征向量,以此为桥梁将结构模式识别问题转化为统计模式识别问题,进而借助支持向量机实现非精确图匹配。不同于其他的图匹配算法,该算法对图的拓扑表达能力强,并且可融合图的领域方面的非拓扑特征,通用性较好。实验结果表明,提出的图匹配算法在不同的图数据集上均具有较高的分类识别率。 In the field of structural pattern recognition,the existing graph matching algorithms can't efficiently mine the node features re-flecting the topological structures of graph itself.To solve this problem,we propose a new inexact graph matching algorithm which integrates the topological features and domain features.We use the space syntax theory in architecture and urban planning to construct the quantitative description of graph's topological features,and then combine them with non-topological features in other domain aspects,such as node attrib-utes and edge attributes,etc.,to construct the feature vectors which depict the graph feature.In this way,the structural pattern recognition is converted to statistical pattern recognition,and the SVMcan then be used as the aid to achieve inexact graph matching.Differing from other graph matching methods,the proposed algorithm can adequately render the graph's topology and merge the non-topological features in terms of the graph's domain property,and has a favourable universality as well.Experimental results show that the proposed graph matching algorithm can achieve higher classifying accuracy in different graph datasets.
出处 《计算机应用与软件》 CSCD 2015年第10期164-167,共4页 Computer Applications and Software
基金 国家自然科学基金项目(61373112 51348002 50878176) 陕西省教育厅专项科研项目(2013JK1157) 西安建筑科技大学青年基金项目(QN1232)
关键词 结构模式识别 空间句法 拓扑 统计模式识别 非精确图匹配 Structural pattern recognition Space syntax Topology Statistical pattern recognition Inexact graph matching
  • 相关文献

参考文献15

  • 1Gibert J, Valveny E, Bunke H. Graph embedding in vector spaces by node attribute statistics [ J ]. Pattern Recognition, 2012,45 ( 9 ) : 3072 - 3083.
  • 2Conte D, Foggia F, Sansone C, et al. Thirty years of graph matching in pattern recognition[ C ]. IJPRAI 12,2004:265 - 298.
  • 3Borzeshi Zare E, Piccardi M, Riesen K, et al. Discriminative proto- type selection methods for graph embedding[ J ]. Pattern Recognition, 2013 ,46 : 1648 - 1657.
  • 4Bunke H, Riesen K. Towards the unification of structural and statisti- cal pattern recognition [ J ]. Pattern Recognition Letters, 2011,33 ( 7 ) : 811 -825.
  • 5Bunke H, Riesen K. Improving vector space embedding of graph throuth feature selection algorithms [ J ]. Pattern Recognition, 2011,44 (9) : 1928 - 1940.
  • 6Riesen K, Bunke H. Reducing the dimensionality of dissimilarity space embedding graph kemels[ J]. Engineering Applications of Artif- icaial Intelligence,2009,22 ( 1 ) ,48 - 56.
  • 7Wilson R, Hancock E, Luo B. Pattern vectors from algebraic graph theory[ J]. IEEE Transactions on Pattern Analysis and Machine Intel- ligence,2005,27 (7) :1112 - 1124.
  • 8Ren P, Wilson R, Hancock E. Graph Characterization via Ihara Coefi- cients[ J]. IEEE Transactions on Neural Networks,2011,22 ( 2 ) : 233 - 245.
  • 9Gibert J, Valveny E, Bunke H. Vocabulary Selection for Graph of Words Embedding[ C ]//Proceedings of the 5 th Iberian Conference on Pattern Recognition and Image Analysis, Lecture Notes in Computer Science, Springer,2011,6669:216 -223.
  • 10Gibert J, Valveny E, Bunke H. Graph of Words Embedding for Molec- ular Structure-Activity Relationship Analysis [ C ]//Proceedings of the 15th Iberoamerican Congress on Pattern Recognition, Lecture Notes in Computer Science, Springer, 2010,6419 : 30 - 37.

同被引文献33

引证文献3

二级引证文献24

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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