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

Authors:
Serkan Kaygin;M. Mete Bulut
Affiliations:
Department of Electrical and Electronics Engineering, Middle East Technical University, 06531 Ankara, Turkey;Department of Electrical and Electronics Engineering, Middle East Technical University, 06531 Ankara, Turkey
Venue:
Pattern Recognition Letters
Year:
2002

Citing 10
Cited 4

On a cyclic string-to-string correction problem

Information Processing Letters
Polygonal shape recognition using string-matching techniques

Pattern Recognition
Attributed String Matching by Split-and-Merge for On-Line Chinese Character Recognition

IEEE Transactions on Pattern Analysis and Machine Intelligence
Digital image processing algorithms

Digital image processing algorithms
A new split-and-merge technique for polygonal approximation of chain coded curves

Pattern Recognition Letters
Extended attributed string matching for shape recognition

Computer Vision and Image Understanding
The String-to-String Correction Problem

Journal of the ACM (JACM)
Bayesian Graph Edit Distance

IEEE Transactions on Pattern Analysis and Machine Intelligence
An efficient algorithm for the optimal polygonal approximation of digitized curves

Pattern Recognition Letters
Two-dimensional object recognition through two-stage string matching

IEEE Transactions on Image Processing

Hierarchical Matching Using Combinatorial Pyramid Framework

ICISP '08 Proceedings of the 3rd international conference on Image and Signal Processing
Curve matching for open 2D curves

Pattern Recognition Letters
Visual understanding industrial workflows under uncertainty on distributed service oriented architectures

Future Generation Computer Systems
Word spotting in historical printed documents using shape and sequence comparisons

Pattern Recognition

Quantified Score

Hi-index	0.10

Visualization

Abstract

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.