Graph edit distance with node splitting and merging, and its application to diatom identification

被引：0

作者：

Ambauen, R ^{[1
]}

Fischer, S ^{[1
]}

Bunke, H ^{[1
]}

机构：

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

来源：

GRAPH BASED REPRESENTATIONS IN PATTERN RECOGNITION, PROCEEDINGS | 2003年 / 2726卷

关键词：

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

A new graph matching scheme based on an extended set of edit operations, which include the splitting and merging of nodes, is proposed in this paper. This scheme is useful in applications where the nodes of the considered graphs represent regions extracted by some segmentation procedure from an image. To demonstrate the feasibility of the proposed method, its application to the automatic identification of diatoms (unicellular algae) is described.

引用

页码：95 / 106

页数：12

共 17 条

[1] AMBAUEN R, 2002, THESIS U BERN
[2] [Anonymous], P 2000 INT C PATT RE
[3] BAYER M, 2002, AUTOMATIC DIATOM IDE
[4] On a relation between graph edit distance and maximum common subgraph
Bunke, H
[J]. PATTERN RECOGNITION LETTERS, 1997, 18 (08) : 689 - 694
[5] CESAR R, 2000, P 16 INT C PATT REC, P465
[6] Fischer S., 2002, Structural, Syntactic, and Statistical Pattern Recognition. Joint IAPR International Workshops SSPR 2002 and SPR 2002 (Lecture Notes in Computer Science Vol. 2396), P94
[7] Fischer S, 2000, INT C PATT RECOG, P895, DOI 10.1109/ICPR.2000.906218
[8] FISCHER S, 2002, AUTOMATIC DIATOM IDE
[9] FISCHER S, 2000, P 2 INT C ADV CONC I, P67
[10] GOMILA C, 2001, P 3 IAPR TC15 WORKSH, P1

← 1 2 →