The Community for Technology Leaders
Pattern Recognition, International Conference on (2004)
Cambridge UK
Aug. 23, 2004 to Aug. 26, 2004
ISSN: 1051-4651
ISBN: 0-7695-2128-2
pp: 471-474
Jianfeng Lu , Department of Computing Science of University of Alberta, Canada; Department of Computer Science of Nanjing University of Sci & Technology, P.R. China
Terry Caelli , Department of Computing Science of University of Alberta, Canada
Jingyu Yang , Department of Computer Science of Nanjing University of Sci & Technology, P.R. China
ABSTRACT
In this paper, a graph decomposition model is combined with recent developments in least squares methods for matching attributed graphs. In particular, we show how this approach improves the robustness of graph matching and also reveals important structural similarities between subgraphs of target and model graphs.
INDEX TERMS
null
CITATION

J. Yang, T. Caelli and J. Lu, "A Graph Decomposition Approach to Least Squares Attributed Graph Matching," Pattern Recognition, International Conference on(ICPR), Cambridge UK, 2004, pp. 471-474.
doi:10.1109/ICPR.2004.1334265
90 ms
(Ver 3.3 (11022016))