A multiscale parallel thinning algorithm

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 634)


This paper presents a new parallel thinning algorithm. Thinning algorithms based on contour tracing are strongly sequential and irregular, with a complexity of O(n2). Thinning algorithms using parallel neighboring operations are regular with a complexity of O(n3).

The parallel thinning approach we propose uses the notion of multi-scaling. This new algorithm keeps the regularity and parallelism of the neighboring operator while achieving a cost of O(n2). Complexity analysis and comparison with a well-known thinning algorithm using a SIMD machine are presented.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    T. Pavlidis. A thinning algorithm for discrete binary images. Computer vision and image processing, 20:142–157, 1980.Google Scholar
  2. 2.
    C. Arcelli and G. Sanniti di Baja. A thinning algorithm based on prominence detection. Pattern Recognition, 13(3):225–235, 1981.CrossRefGoogle Scholar
  3. 3.
    C.J. Hilditch. Comparison of thinning algorithms on a parallel processor. Computer Vision, Graphics and Image Processing, 1(3):115–132, 1983.Google Scholar
  4. 4.
    C. Arcelli. Pattern thinning by contour tracing. Comp. Graph. and Image Proc., 17:130–144, 1981.Google Scholar
  5. 5.
    Z. Guo and R.W. Hall. Parallel thinning with two-subiteration algorithms. Comm. ACM, 32:359–373, 1989.MathSciNetGoogle Scholar
  6. 6.
    C.M. Holt, A. Stewart, M. Clint, and R.H. Perrott. An improved parallel thinning algorithm. Comm. ACM, 30:156–160, 1987.Google Scholar
  7. 7.
    R.T. Chin, H.K. Wan, D.L. Stover, and R.D. Iverson. A one-pass thinning algorithm and its parallel implementation. Comp. Vision, Graph. and Image Proc., 40:30–40, 1987.Google Scholar
  8. 8.
    V. Poty and S. Ubeda. Parallel thinning algorithm using k×k mask. In Int. Coll. on Parallel Image Proc., 337–352, 1991.Google Scholar
  9. 9.
    J. Olszewski. A flexible thinning algorithm allowing parallel, sequentiel and distributed application. To appear in ACM Trans. on Mathematical Sofware.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  1. 1.LIP, ENS LyonLyon Cedex 07France

Personalised recommendations