Graph Matching: What Are We Really Talking About?
暂无分享,去创建一个
Graph matching is among all the manipulations of graphs the one which gave rise to the most methods in order to encounter the time complexity drawback especially in the context of pattern recognition related applications. This paper will first introduce the works presented during the 3rd workshop on Graph based Representation and second will try to set some trends towards the next generation of graph matching methods.
[1] Edwin R. Hancock,et al. Computing approximate tree edit distance using relaxation labeling , 2003, Pattern Recognit. Lett..
[2] Shinji Umeyama,et al. An Eigendecomposition Approach to Weighted Graph Matching Problems , 1988, IEEE Trans. Pattern Anal. Mach. Intell..
[3] Horst Bunke,et al. Recent Advances in Graph Matching , 1997, Int. J. Pattern Recognit. Artif. Intell..