The String-to-String Correction Problem
Journal of the ACM (JACM)
Computer Processing of Line-Drawing Images
ACM Computing Surveys (CSUR)
Automatic Construction of 2D Shape Models
IEEE Transactions on Pattern Analysis and Machine Intelligence
Learning Shape Models from Examples Using Automatic Shape Clustering and Procrustes Analysis
IPMI '99 Proceedings of the 16th International Conference on Information Processing in Medical Imaging
Comparison of AESA and LAESA search algorithms using string and tree-edit-distances
Pattern Recognition Letters
A Learning Model for Multiple-Prototype Classification of Strings
ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 4 - Volume 04
Feature extraction using a chaincoded contour representation of fingerprint images
AVBPA'03 Proceedings of the 4th international conference on Audio- and video-based biometric person authentication
Characterization of contour regularities based on the Levenshtein edit distance
Pattern Recognition Letters
| Hi-index | 0.00 |
In this paper, we present a new method for constructing prototypes representing a set of contours encoded by Freeman Chain Codes. Our method build new prototypes taking into account similar segments shared between contours instances. The similarity criterion was based on the Levenshtein Edit Distance definition. We also outline how to apply our method to reduce a data set without sensibly affect its representational power for classification purposes. Experimental results shows that our scheme can achieve compressions about 50% while classification error increases only by 0.75%.