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
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.
Citation:
Jianfeng Lu, Terry Caelli, Jingyu Yang, "A Graph Decomposition Approach to Least Squares Attributed Graph Matching," icpr, vol. 2, pp.471-474, 17th International Conference on Pattern Recognition (ICPR'04) - Volume 2, 2004