Advertisement

Note on two-dimensional pattern matching by optimal parallel algorithms

  • Maxime Crochemore
  • Wojciech Rytter
Communications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 654)

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.

Keywords

analysis of algorithms parallel algorithms pattern matching string-matching image processing 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AILSV 88]
    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. [AL 91]
    A. Amir, G.M. Landau, Fast parallel and serial multidimensional approximate pattern matching, Theoret. Comput. Sci. 81 (1991) 97–15.Google Scholar
  3. [Ba 78]
    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. [Bi 77]
    R.S. Bird, Two-dimensional pattern-matching, IPL 6 (1977) 168–170.Google Scholar
  5. [CR 90]
    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. [CR 91]
    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. [[GR 88]
    A. Gibbons, W. Rytter, Efficient parallel algorithms, Cambridge University Press (1988).Google Scholar
  8. [KMR 72]
    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. [KLP 89]
    Z. Kedem, G.M. Landau, K. Palem, Optimal parallel suffix-prefix matching algorithm and its applications, SPAA '89.Google Scholar
  10. [Vi 85]
    U. Vishkin, Optimal parallel pattern matching in strings, Information and Control, 67 (1985) 91–113.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Maxime Crochemore
    • 1
  • Wojciech Rytter
    • 2
  1. 1.LITP, Institut Blaise PascalUniversité Paris 7Paris cedex 05
  2. 2.Institute of InformaticsWarsaw UniversityWarsaw 59Poland

Personalised recommendations