Kronecker product graph matching

被引：23
作者：
van Wyk, BJ
van Wyk, MA
机构：
[1] Kentron Dynam, ZA-0046 Centurion, South Africa
[2] Rand Afrikaans Univ, ZA-2006 Johannesburg, South Africa
来源：
PATTERN RECOGNITION | 2003年 / 36卷 / 09期
关键词：
graph matching; graph isomorphism; image matching; pattern matching;
D O I：
10.1016/S0031-3203(03)00009-8
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
In this paper the Interpolator-based Kronecker product graph matching (IBKPGM) algorithm for performing attributed graph matching is presented. The IBKPGM algorithm is based on the Kronecker product graph matching (KPGM) formulation. This new formulation incorporates a general approach to a wide class of graph matching problems based on attributed graphs, allowing the structure of the graphs to be based on multiple sets of attributes. Salient features of the IBKPGM algorithm are that no assumption is made about the adjacency structure of the graphs to be matched, and that the explicit calculation of compatibility values between all vertices of the reference and input graphs as well as between all edges of the reference and input graphs are avoided. (C) 2003 Pattern Recognition Society. Published by Elsevier Science Ltd. All rights reserved.
引用
收藏
页码：2019 / 2030
页数：12
相关论文
共 62 条
1234567