Extended Attributed String Matching for Shape Recognition

S. W. Chen*, S. T. Tung, C. Y. Fang, Shen Cherng, Anil K. Jain

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

28 Citations (Scopus)


In this paper, we extend the attributed string matching (ASM) 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 cost 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

Original languageEnglish
Pages (from-to)36-50
Number of pages15
JournalComputer Vision and Image Understanding
Issue number1
Publication statusPublished - 1998 Apr


  • Attributed string matching
  • Dynamic programming
  • Fuzzy split and merge
  • Invariant two-way relaxation scheme
  • Legality costs of edit operations

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Computer Vision and Pattern Recognition


Dive into the research topics of 'Extended Attributed String Matching for Shape Recognition'. Together they form a unique fingerprint.

Cite this