Perceptual Organization and Curve Partitioning
IEEE Transactions on Pattern Analysis and Machine Intelligence
Review of shape coding techniques
Image and Vision Computing
Elements of information theory
Elements of information theory
Attributed String Matching by Split-and-Merge for On-Line Chinese Character Recognition
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Real-Time Matching System for Large Fingerprint Databases
IEEE Transactions on Pattern Analysis and Machine Intelligence
The String-to-String Correction Problem
Journal of the ACM (JACM)
Computation of Normalized Edit Distance and Applications
IEEE Transactions on Pattern Analysis and Machine Intelligence
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Saliency-Based Multiscale Method for On-Line Cursive Handwriting Shape Description
IWFHR '04 Proceedings of the Ninth International Workshop on Frontiers in Handwriting Recognition
A Method for the Correction of Garbled Words Based on the Levenshtein Metric
IEEE Transactions on Computers
| Hi-index | 0.00 |
Edit Distance has been widely studied and successfully applied in a large variety of application domains and many techniques based on this concept have been proposed in the literature. These techniques share the property that, in case of patterns having different lengths, a number of symbols are introduced in the shortest one, or deleted from the longest one, until both patterns have the same length. In case of applications in which strings are used for shape description, however, this property may introduce distortions in the shape, resulting in a distance measure not reflecting the perceived similarity between the shapes to compare. Moving from this consideration, we propose a new edit distance, called Weighted Edit Distance that does not require the introduction or the deletion of any symbol. Preliminary experiments performed by comparing our technique with the Normalized Edit Distance and the Markov Edit Distance have shown very encouraging results.