Skip to main content
SpringerLink
Log in
Book cover

International Computing and Combinatorics Conference

COCOON 1998: Computing and Combinatorics pp 319–328Cite as

Similarity in Two-Dimensional Strings

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1449))

Abstract

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.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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 

  2. A. Amir and G. Landau. Fast parallel and serial multidimensional approximate array matching. Theoretical Computer Science, 81:97–115, 1991. Also as report CS-TR-2288, Dept. of Computer Science, Univ. of Maryland, 1989.

    Article  MathSciNet  Google Scholar 

  3. M. Atallah. A linear time algorithm for the Hausdorff distance between convex polygons, Information Processing Letters 17, 207–209, 1983.

    Article  MathSciNet  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 

  5. M. Crochemore and W. Rytter. Text Algorithms. Oxford University Press, Oxford, UK, 1994.

    MATH  Google Scholar 

  6. C. Faloutsos, R. Barber, M. Flickner, J. Hafner, W. Niblack, D. Petkovic, and W. Equitz. Efficient and effective querying by image content. J. of Intelligent Information Systems, 3:231–262, 1994.

    Article  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 

  8. R. Giancarlo. A generalization of suffix trees to square matrices, with applications. SIAM J. on Computing, 24:520–562, 1995.

    Article  MathSciNet  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 

  11. K. Krithivasan and R. Sitalakshmi. Efficient two-dimensional pattern matching in the presence of errors. Information Sciences, 43:169–184, 1987.

    Article  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 

  13. S. Ranka and T. Heywood. Two-dimensional pattern matching with k mismatches. Pattern recognition, 24(1):31–40, 1991.

    Article  MathSciNet  Google Scholar 

  14. P. Sellers. The theory and computation of evolutionary distances: pattern recognition. J. of Algorithms, 1:359–373, 1980.

    Article  MathSciNet  Google Scholar 

  15. P. Suetens, P. Fua, and A. Hanson. Computational Strategies for Object Recognition, ACM Computing Surveys, 24:5–62, 1992.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Depto. de Ciencias de la Computación, Universidad de Chile, Casilla 2777, Santiago, Chile

    Ricardo A. Baeza-Yates

Authors
  1. Ricardo A. Baeza-Yates
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Information Science, Academia Sinica, 11529, Nankang, Taipei, Taiwan

    Wen-Lian Hsu

  2. Department of Computer Science, Yale University, 51 Prospect Street, New Haven, CT, 06520, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Baeza-Yates, R.A. (1998). Similarity in Two-Dimensional Strings. In: Hsu, WL., Kao, MY. (eds) Computing and Combinatorics. COCOON 1998. Lecture Notes in Computer Science, vol 1449. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-68535-9_36

Download citation

  • DOI: https://doi.org/10.1007/3-540-68535-9_36

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64824-6

  • Online ISBN: 978-3-540-68535-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation