Inexact graph matching for structural pattern recognition

被引：301

作者：

Bunke, H. ^{[1
]}

Allermann, G. ^{[2
]}

机构：

[1] Univ Erlangen Nurnberg, Lehrstuhl Informat Mustererkennung 5, Fr, Germany

[2] Mannesmann Forsch Inst, Duisburg, FR, Germany

来源：

PATTERN RECOGNITION LETTERS | 1983年 / 1卷 / 04期

关键词：

Attributed graphs; inexact matching; heuristic search; structural pattern recognition; silhouette recognition;

D O I：

10.1016/0167-8655(83)90033-8

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

This paper is concerned with the inexact matching of attributed, relational graphs for structural pattern recognition. The matching procedure is based on a state space search utilizing heuristic information. Some experimental results are reported.

引用

页码：245 / 253

页数：9

共 12 条

[1]

Bunke H., 1982, P NATO ASI IM SEQ PR

[2]

Cheng J.K., 1981, P IEEE COMP SOC C PR, P542

[3]

Corneil D.G., 1970, J ASS COMPUT MACH, V17

[4]

Fu K. S., 1982, SYNTACTIC PATTERN RE

[5]

FU KS, 1973, IEEE T COMPUT, VC 22, P1087, DOI 10.1109/T-C.1973.223654

[6]

Kashyap R. L., 1982, Proceedings of the 6th International Conference on Pattern Recognition, P472

[7]

Nilsson N.J., 1980, PRINCIPLES ARTIFICIA

[8]

PAVLIDIS T, 1977, STRUCTURAL PATTERN R

[9]

Sanfeliu A., 1980, 8039 TREE PURD U

[10] STRUCTURAL DESCRIPTIONS AND INEXACT MATCHING [J].

SHAPIRO, LG ;

HARALICK, RM .

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1981, 3 (05) :504-519

← 1 2 →