Extended attributed string matching for shape recognition

被引:24
作者
Chen, SW [1 ]
Tung, ST
Fang, CY
Cherng, S
Jain, AK
机构
[1] Natl Taiwan Normal Univ, Dept Informat & Comp Educ, Taipei, Taiwan
[2] Dept Management & Budget, Property Management Div, Lansing, MI USA
[3] Michigan State Univ, Dept Comp Sci, E Lansing, MI 48824 USA
关键词
attributed string matching; dynamic programming; invariant two-way relaxation scheme; fuzzy split and merge; legality costs of edit operations;
D O I
10.1006/cviu.1998.0599
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, we extend the attributed string matching (ASN) technique, which originally dealt with single objects, to handle scenes containing multiple objects. The emerging issues have uncovered several weaknesses inherent in ASM. We overcome these weaknesses in this study. Major tasks include the introduction of an invariant two-way relaxation process with fuzzy split-and-merge mechanism, a new set of cast functions for edit operators, and the legality costs of edit operations. Three algorithms have been developed, respectively, implementing the original ASM, its modification (MASM) characterized by the proposed new cost functions, and extended ASM (EASM) further incorporating the legality costs of edit operations. These algorithms are then applied to a number of real images. By comparing their performances, we observe that both the new cost functions and the legality costs of edit operations have greatly enlarged the range of the computed similarity values, An augmentation in the separability of similarity values signifies an increment in the discernibility among objects. Experimental results support the applicability of the extended ASM, (C) 1998 Academic Press.
引用
收藏
页码:36 / 50
页数:15
相关论文
共 37 条
[21]   COMPUTATION OF NORMALIZED EDIT DISTANCE AND APPLICATIONS [J].
MARZAL, A ;
VIDAL, E .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1993, 15 (09) :926-932
[22]   A STEREO VISION TECHNIQUE USING CURVE-SEGMENTS AND RELAXATION MATCHING [J].
NASRABADI, NM .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1992, 14 (05) :566-572
[23]   POINT PATTERN-MATCHING BY RELAXATION [J].
RANADE, S ;
ROSENFELD, A .
PATTERN RECOGNITION, 1980, 12 (04) :269-275
[24]   FUZZY RELAXATION APPROACH FOR INEXACT SCENE MATCHING [J].
RANGANATH, HS ;
CHIPMAN, LJ .
IMAGE AND VISION COMPUTING, 1992, 10 (09) :631-640
[25]   The method of normalization to determine invariants [J].
Rothe, I ;
Susse, H ;
Voss, K .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1996, 18 (04) :366-376
[26]   DYNAMIC-PROGRAMMING ALGORITHM OPTIMIZATION FOR SPOKEN WORD RECOGNITION [J].
SAKOE, H ;
CHIBA, S .
IEEE TRANSACTIONS ON ACOUSTICS SPEECH AND SIGNAL PROCESSING, 1978, 26 (01) :43-49
[27]  
Sedgewick R., 1983, Algorithms
[28]   HYBRID CONTEXTUAL TEXT RECOGNITION WITH STRING-MATCHING [J].
SINHA, RMK ;
PRASADA, B ;
HOULE, GF ;
SABOURIN, M .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1993, 15 (09) :915-925
[29]   REGISTERING LANDSAT IMAGES BY POINT MATCHING [J].
TON, JC ;
JAIN, AK .
IEEE TRANSACTIONS ON GEOSCIENCE AND REMOTE SENSING, 1989, 27 (05) :642-651
[30]   ATTRIBUTED STRING MATCHING WITH MERGING FOR SHAPE-RECOGNITION [J].
TSAI, WH ;
YU, SS .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1985, 7 (04) :453-462