Weighted mean of a pair of graphs

被引：32

作者：

Bunke, H ^{[1
]}

Günter, S ^{[1
]}

机构：

[1] Univ Bern, Dept Comp Sci, CH-3012 Bern, Switzerland

来源：

COMPUTING | 2001年 / 67卷 / 03期

关键词：

graph matching; graph edit distance; weighted mean; generalized median; self organizing map;

D O I：

10.1007/s006070170006

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Graph matching and graph edit distance are fundamental concepts in structural pattern recognition. In this paper, the weighted mean of a pair of graphs is introduced. Given two graphs, G and G', with d(G, G') being the edit distance of G and G', the weighted mean of G and G' is a graph G" that has edit distances d(G, G") and d(G", G') to G and G', respectively, such that d(G, G") + d(G", G') = d(G, G'). We'll show formal properties of the weighted mean, describe a procedure for its computation, and give examples.

引用

页码：209 / 224

页数：16

共 28 条

[1]

[Anonymous], P 4 AS C COMP VIS TA

[2]

[Anonymous], P NAT S PATT REC IM

[3]

[Anonymous], 1995, SELF ORG MAP

[4]

BAXTER K, 2000, P VISION INTERFACE, V6, P179

[5] Inexact graph matching for structural pattern recognition [J].

Bunke, H. ;

Allermann, G. .

PATTERN RECOGNITION LETTERS, 1983, 1 (04) :245-253

[6] Combinatorial search versus genetic algorithms:: A case study based on the generalized median graph problem [J].

Bunke, H ;

Münger, A ;

Jiang, XY .

PATTERN RECOGNITION LETTERS, 1999, 20 (11-13) :1271-1277

[7]

BUNKE H, UNPUB WEIGHTED MEAN

[8] 2-D object recognition by multiscale tree matching [J].

Cantoni, V ;

Cinque, L ;

Guerra, C ;

Levialdi, S ;

Lombardi, L .

PATTERN RECOGNITION, 1998, 31 (10) :1443-1454

[9]

Folkers A, 2000, INT C PATT RECOG, P51, DOI 10.1109/ICPR.2000.902863

[10]

HUET B, 1999, P 2 IAPR TC 15 WORKS, P89

← 1 2 3 →