Skip to main content

A multiscale parallel thinning algorithm

  • Conference paper
  • First Online:
Parallel Processing: CONPAR 92—VAPP V (VAPP 1992, CONPAR 1992)

Abstract

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

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(n 2). Complexity analysis and comparison with a well-known thinning algorithm using a SIMD machine are presented.

This work was supported by EEC ESPRIT Basic Research Action 3280 “NANA” and the CNRS Coordinated Research Program C 3.

This article was processed using the LaTEX macro package with LLNCS style

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. T. Pavlidis. A thinning algorithm for discrete binary images. Computer vision and image processing, 20:142–157, 1980.

    Google Scholar 

  2. C. Arcelli and G. Sanniti di Baja. A thinning algorithm based on prominence detection. Pattern Recognition, 13(3):225–235, 1981.

    Article  Google Scholar 

  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. C. Arcelli. Pattern thinning by contour tracing. Comp. Graph. and Image Proc., 17:130–144, 1981.

    Google Scholar 

  5. Z. Guo and R.W. Hall. Parallel thinning with two-subiteration algorithms. Comm. ACM, 32:359–373, 1989.

    MathSciNet  Google Scholar 

  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. 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. 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. J. Olszewski. A flexible thinning algorithm allowing parallel, sequentiel and distributed application. To appear in ACM Trans. on Mathematical Sofware.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Stephane Ubeda .

Editor information

Luc Bougé Michel Cosnard Yves Robert Denis Trystram

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Levaire, JL., Ubeda, S. (1992). A multiscale parallel thinning algorithm. In: Bougé, L., Cosnard, M., Robert, Y., Trystram, D. (eds) Parallel Processing: CONPAR 92—VAPP V. VAPP CONPAR 1992 1992. Lecture Notes in Computer Science, vol 634. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55895-0_460

Download citation

  • DOI: https://doi.org/10.1007/3-540-55895-0_460

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55895-8

  • Online ISBN: 978-3-540-47306-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics