Similarity in Two-Dimensional Strings
In this paper we discuss how to compute the edit distance (or similarity) between two images. We present new similarity measures and how to compute them. They can be used to perform more general two-dimensional approximate pattern matching. Previous work on two-dimensional approximate string matching either work with only substitutions or a restricted edit distance that allows only some type of errors.
KeywordsPattern Match Edit Distance Longe Common Subsequence Approximate Match Approximate String Match
Unable to display preview. Download preview PDF.
- 1.A. Amir and M. Farach. Efficient 2-dimensional approximate matching of non-rectangular figures. In Proc. SODA’91, pages 212–223, San Francisco, CA, Jan 1991.Google Scholar
- 4.R. Baeza-Yates and G. Navarro. Fast two-dimensional approximate string matching. In LATIN’98, Campinas, Brazil, April 1998. Springer-Verlag LNCS 1380, edited by C. Lucchesi and A. Moura, 341–351.Google Scholar
- 7.M. Flickner, H. Sawhney, W. Niblack, J. Ashley, Q. Huang, B. Dom, M. Gorkani, J. Hafner, D. Petkovic, and W. Equitz.Google Scholar
- 9.J. Karkkäinen and E. Ukkonen. Two and higher dimensional pattern matching in optimal expected time. In Proc. SODA’94, pages 715–723. SIAM, 1994.Google Scholar
- 10.K. Krithivasan. Efficient two-dimensional parallel and serial approximate pattern matching. Technical Report CAR-TR-259, University of Maryland, 1987.Google Scholar
- 12.K. Park. Analysis of two dimensional approximate pattern matching algorithms. In Proc. CPM’96, LNCS 1075, pages 335–347, 1996.Google Scholar