Skip to main content
SpringerLink
Log in

A proposal for the implementation of a parallel watershed algorithm

  • Posters
  • Conference paper
  • First Online:
Computer Analysis of Images and Patterns (CAIP 1995)

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

Included in the following conference series:

Abstract

In this paper a parallel implementation of a watershed algorithm is proposed. The algorithm is designed for a ring-architecture with distributed memory and a piece of shared memory using a single program multiple data (SPMD) approach. The watershed transform is generally considered to be inherently sequential. This paper shows that it is possible to exploit parallelism by splitting the computation of the watersheds of an image into three stages that can be executed in parallel.

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. H. Bal, Programming Distributed Systems. Prentice Hall, 1990.

    Google Scholar 

  2. S. Beucher and F. Meyer. The morphological approach to segmentation: The watershed transformation. In E.R. Dougherty, editor, Mathematical Morphology in Image Processing. Marcel Dekker, New York, 1993. Chapter 12, pp. 433–481.

    Google Scholar 

  3. F. Meyer and S. Beucher. Morphological segmentation. Journal of Visual Communications and Image Representation, 1(1):21–45, 1990.

    Google Scholar 

  4. A.N. Moga, T. Viero, B.P. Dobrin, M. Gabbouj. Implementation of a distributed watershed algorithm. In J. Serra and P. Soille (Eds.), Mathematical Morphology and Its Applications to Image Processing, Kluwer, 1994, pp. 281–288.

    Google Scholar 

  5. J. Serra, Image Analysis and Mathematical Morphology. Academic Press, 1982.

    Google Scholar 

  6. S.R. Sternberg, Grayscale morphology. Computer Vision, Graphics, Image Processing, 35, pp 333–355, 1986 Academic Press, 1982.

    Google Scholar 

  7. L. Vincent and P. Soille, Watersheds in Digital Spaces: An Efficient Algorithm Based on Immersion Simulations. IEEE Transactions on Pattern Analysis and Machine Intelligence, 13, no. 6, pp 583–598, june 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Mathematics and Computing Science, University of Groningen, P.O. Box 800, 9700, AV Groningen, The Netherlands

    A. Meijster & J. B. T. M. Roerdink

Authors
  1. A. Meijster
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. B. T. M. Roerdink
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Václav Hlaváč Radim Šára

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Meijster, A., Roerdink, J.B.T.M. (1995). A proposal for the implementation of a parallel watershed algorithm. In: Hlaváč, V., Šára, R. (eds) Computer Analysis of Images and Patterns. CAIP 1995. Lecture Notes in Computer Science, vol 970. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60268-2_382

Download citation

  • DOI: https://doi.org/10.1007/3-540-60268-2_382

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60268-2

  • Online ISBN: 978-3-540-44781-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation