Shape recognition using attributed string matching with polygon vertices as the primitives

被引:15
作者
Kaygin, S [1 ]
Bulut, MM [1 ]
机构
[1] Middle E Tech Univ, Dept Elect & Elect Engn, TR-06531 Ankara, Turkey
关键词
attributed strings; vertex primitives; polygon matching; edit distance; shape recognition;
D O I
10.1016/S0167-8655(01)00111-8
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Attributed string matching has been utilized for polygon matching in various applications, in which line segments are the primitives. Adding a merge operator avoids the segmentation inconsistencies due to the noisy images or distorted shapes, however it is computationally expensive. In this paper, the vertices of the polygons are suggested as the primitives of the attributed strings. Deletion and insertion of a vertex corresponds to merging two consecutive line segments and splitting a line segment, respectively. In this way, the benefits of split and merge operations are placed in the dynamic programming algorithm for the edit distance evaluation without an extra computation-cost. (C) 2002 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:287 / 294
页数:8
相关论文
共 15 条
[1]   APPLICATIONS OF APPROXIMATE STRING-MATCHING TO 2D SHAPE-RECOGNITION [J].
BUNKE, H ;
BUHLER, U .
PATTERN RECOGNITION, 1993, 26 (12) :1797-1812
[2]   Extended attributed string matching for shape recognition [J].
Chen, SW ;
Tung, ST ;
Fang, CY ;
Cherng, S ;
Jain, AK .
COMPUTER VISION AND IMAGE UNDERSTANDING, 1998, 70 (01) :36-50
[3]   TRADEMARK SHAPES DESCRIPTION BY STRING-MATCHING TECHNIQUES [J].
CORTELAZZO, G ;
MIAN, GA ;
VEZZI, G ;
ZAMPERONI, P .
PATTERN RECOGNITION, 1994, 27 (08) :1005-1018
[4]   Finding rotational symmetries by cyclic string matching [J].
Llados, J ;
Bunke, H ;
Marti, E .
PATTERN RECOGNITION LETTERS, 1997, 18 (14) :1435-1442
[5]   ON A CYCLIC STRING-TO-STRING CORRECTION PROBLEM [J].
MAES, M .
INFORMATION PROCESSING LETTERS, 1990, 35 (02) :73-78
[6]   POLYGONAL SHAPE-RECOGNITION USING STRING-MATCHING TECHNIQUES [J].
MAES, M .
PATTERN RECOGNITION, 1991, 24 (05) :433-440
[7]   Bayesian graph edit distance [J].
Myers, R ;
Wilson, RC ;
Hancock, ER .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2000, 22 (06) :628-635
[8]  
PITAS I, 1993, DIGITAL IMAGE PROCES, P303
[9]   A NEW SPLIT-AND-MERGE TECHNIQUE FOR POLYGONAL-APPROXIMATION OF CHAIN CODED CURVES [J].
RAY, BK ;
RAY, KS .
PATTERN RECOGNITION LETTERS, 1995, 16 (02) :161-169
[10]   An efficient algorithm for the optimal polygonal approximation of digitized curves [J].
Salotti, M .
PATTERN RECOGNITION LETTERS, 2001, 22 (02) :215-221