Skip to main content
SpringerLink
Log in

Note on two-dimensional pattern matching by optimal parallel algorithms

  • Communications
  • Conference paper
  • First Online:
Book cover Parallel Image Analysis (ICPIA 1992)

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

Included in the following conference series:

  • 169 Accesses

Abstract

We discuss techniques for constructing parallel image identification algorithms: cutting images into small factors, and compressing images by a parallel reduction of large number of such independent factors into smaller objects. A version of Kedem Landau Palem algorithm for parallel one-dimensional and two-dimensional rectangular image recognition on a CRCW PRAM is presented. The crucial part in KLP algorithm is a suffix-prefix matching subprocedure. In our algorithm such a subprocedure is omitted. A novel algorithm for pattern-matching is proposed, more directly designed for two-dimensional objects. It does not use the multi-text/multi-pattern approach as in KLP algorithm. The importance of five types of factors in strings and images is emphasized A new useful type of two-dimensional factors is introduced: thin factors.

Work by this author is supported by PRC “Mathématiques-Informatique” & NATO Grant CRG 900293.

Work by this author is supported by the Polish Grant 2-11-90-91-01.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Apostolico, C. Iliopoulos, G. Landau, B. Schieber, U. Vishkin, Parallel construction of a suffix tree with applications, Algorithmica 3 (1988) 347–365.

    Google Scholar 

  2. A. Amir, G.M. Landau, Fast parallel and serial multidimensional approximate pattern matching, Theoret. Comput. Sci. 81 (1991) 97–15.

    Google Scholar 

  3. T. Baker, A technique for extending rapid exact string matching to arrays of more than one dimension, SIAM J. Comp. 7 (1978) 533–541.

    Google Scholar 

  4. R.S. Bird, Two-dimensional pattern-matching, IPL 6 (1977) 168–170.

    Google Scholar 

  5. M. Crochemore, W. Rytter, Parallel computations on strings and arrays, in: (STACS'90, Choffrut and Lengauer eds, LNCS 415, Springer-Verlag, 1990) 109–125.

    Google Scholar 

  6. M. Crochemore, W. Rytter, Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays, Theoret. Comput. Sci. 88 (1991) 59–82.

    Google Scholar 

  7. A. Gibbons, W. Rytter, Efficient parallel algorithms, Cambridge University Press (1988).

    Google Scholar 

  8. R. Karp, R. Miller, A. Rosenberg, Rapid identification of repeated patterns in strings, arrays and trees, in Proceedings of ACM Symposium on Theory Of Computation, 4 (1972) 125–136.

    Google Scholar 

  9. Z. Kedem, G.M. Landau, K. Palem, Optimal parallel suffix-prefix matching algorithm and its applications, SPAA '89.

    Google Scholar 

  10. U. Vishkin, Optimal parallel pattern matching in strings, Information and Control, 67 (1985) 91–113.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LITP, Institut Blaise Pascal, Université Paris 7, 2 place Jussieu, F-75251, Paris cedex 05

    Maxime Crochemore

  2. Institute of Informatics, Warsaw University, Ul. Banacha 2, 00913, Warsaw 59, Poland

    Wojciech Rytter

Authors
  1. Maxime Crochemore
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wojciech Rytter
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Akira Nakamura Maurice Nivat Ahmed Saoudi Patrick S. P. Wang Katsushi Inoue

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Crochemore, M., Rytter, W. (1992). Note on two-dimensional pattern matching by optimal parallel algorithms. In: Nakamura, A., Nivat, M., Saoudi, A., Wang, P.S.P., Inoue, K. (eds) Parallel Image Analysis. ICPIA 1992. Lecture Notes in Computer Science, vol 654. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56346-6_33

Download citation

  • DOI: https://doi.org/10.1007/3-540-56346-6_33

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56346-4

  • Online ISBN: 978-3-540-47538-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation