Edit Distance for Ordered Vector Sets: A Case of Study
Digital contours in a binary image can be described as an ordered vector set. In this paper an extension of the string edit distance is defined for its computation between a pair of ordered sets of vectors. This way, the differences between shapes can be computed in terms of editing costs. In order to achieve efficency a dominant point detection algorithm should be applied, removing redundant data before coding shapes into vectors. This edit distance can be used in nearest neighbour classification tasks. The advantages of this method applied to isolated handwritten character classification are shown, compared to similar methods based on string or tree representations of the binary image.
TopicsDominant Points Pattern Recognition Structural Pattern Recognition
- 8.Rico-Juan, J.R., Calera-Rubio, J.: Evaluation of handwritten character recognizers using tree-edit-distance and fast nearest neighbour search. In: Iñesta, J.M., Micó, L. (eds.) Pattern Recognition in Information Systems, Alicante (Spain), pp. 326–335. ICEIS Press (2002)Google Scholar