Abstract
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.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Durbin, K., Eddy, S., Krogh, A., Mitchison, G.: Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids. Cambridge Univ. Press, Cambridge (1997)
Cover, T.M., Thomas, J.A.: Elements of Information Theory, 2nd edn. Wiley, Chichester (1991)
Huang, X., Acero, A., Hon, H.: Spoken Language Processing. Prentice-Hall, Englewood Cliffs (2001)
Tsay, Y.T., Tsai, W.H.: Attributed String Matching Split-and- Merge for On-Line Chinese Character Recognition. IEEE Trans. on Pattern Analysis and Machine Intelligence 15(2), 180–185 (1993)
Ratha, N., Chen, S., Karu, K., Jain, A.K.: A Real-Time Matching System for Large Fingerprint Databases. IEEE Trans. on Pattern Analysis and Machine Intelligence 18(8), 799–813 (1996)
Levenstein, A.: Binary Codes Capable of Correcting Deletions, Insertions and Reversals. Soviet Physics-Doklandy 10 (1966)
Okuda, T., Tanaka, E., Kasai, T.: A Method of Correction of Garbled Words Based on the Levenstein Metric. IEEE Trans. on Computers, 172–177 (1976)
Wagner, R.A., Fisher, M.J.: The String to String Correction Problem. Journal of ACM 21(1), 168–173 (1974)
Marzal, A., Vidal, E.: Computation of Normalized Edit Distance and Applications. IEEE Trans. on Pattern Analysis and Machine Intelligence 15(9), 926–932 (1993)
Wei, J.: Markov Edit Distanc. IEEE Trans. on Pattern Analysis And Machine Intelligence 26(3), 311–321 (2004)
De Stefano, C., Guadagno, G., Marcelli, A.: A Saliency-Based Segmentation Method for On-Line Cursive Handwriting. International Journal of Pattern Recognition and Artificial Intelligence 18(6), 1139–1156 (2004)
De Stefano, C., Garruto, M., Marcelli, A.: A saliency-based multiscale method for on-line cursive handwriting shape description”. In: Proc. of the 9th International Workshop on Frontiers in Handwriting Recognition 2004 (IWFHR-9), Tokyo, Japan, October, 26-29, pp. 124–129 (2004)
Pavlidis, T.: Structural Pattern Recognition. Springer, Heidelberg (1977)
Fischler, M.A., Bolles, R.C.: Perceptual organization and curve partitioning. IEEE Trans. on Pattern Analysis and Machine Intelligence 8(1), 100–105 (1986)
Marshall, S.: Review of shape coding techniques. Image and Vision Computing 7(4), 281–294 (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
De Stefano, C., Garruto, M., Lapresa, L., Marcelli, A. (2005). Using Strings for On-Line Handwriting Shape Matching: A New Weighted Edit Distance. In: Roli, F., Vitulano, S. (eds) Image Analysis and Processing – ICIAP 2005. ICIAP 2005. Lecture Notes in Computer Science, vol 3617. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11553595_138
Download citation
DOI: https://doi.org/10.1007/11553595_138
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28869-5
Online ISBN: 978-3-540-31866-8
eBook Packages: Computer ScienceComputer Science (R0)