DocumentCode
419607
Title
A graph decomposition approach to least squares attributed graph matching
Author
Jianfeng Lu ; Caelli, Terry ; Jingyu Yang
Author_Institution
Dept. of Comput. Sci., Alberta Univ., Edmonton, Alta., Canada
Volume
2
fYear
2004
fDate
23-26 Aug. 2004
Firstpage
471
Abstract
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.
Keywords
least squares approximations; pattern recognition; attributed graph matching; graph decomposition model; least squares methods; Computer science; Fitting; Hilbert space; Interpolation; Kernel; Least squares methods; Optimization methods; Pattern matching; Pattern recognition; Robustness;
fLanguage
English
Publisher
ieee
Conference_Titel
Pattern Recognition, 2004. ICPR 2004. Proceedings of the 17th International Conference on
ISSN
1051-4651
Print_ISBN
0-7695-2128-2
Type
conf
DOI
10.1109/ICPR.2004.1334265
Filename
1334265
Link To Document