Advertisement

Fast, Parallel Watershed Algorithm Based on Path Tracing

  • Michał Świercz
  • Marcin Iwanowski
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6375)

Abstract

In this paper a fast, parallel watershed algorithm for segmentation of digital grey-scale images is presented. We show an original parallelisation technique based on the ”shared nothing” principle and its application to a modified path-tracing watershed algorithm, which allows a vast majority of computations to be broken up into several independent tasks that can be run in parallel on different processing nodes. This approach eliminates the need of any complex synchronization between the threads and translates to a very high efficiency and speed of the algorithm. Sample results are discussed, with emphasis on their correctness and execution times.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Vincent, L., Soille, P.: Watersheds in digital spaces - an efficient solution based on immersion simulations. IEEE Transactions on Pattern Analysis and Machine Intelligence 13(6), 583–598 (1991)CrossRefGoogle Scholar
  2. 2.
    Osma-Ruiz, V., Godino-Llorente, J.I., Sáenz-Lechón, N., Gomez-Vilda, P.: An improved watershed algorithm based on efficient computation of shortest paths. Pattern Recognition 40(3), 1078–1090 (2007)zbMATHCrossRefGoogle Scholar
  3. 3.
    Bieniek, A., Moga, A.: An efficient watershed algorithm based on connected components. Pattern Recognition 33(6), 907–916 (2000)CrossRefGoogle Scholar
  4. 4.
    Moga, A., Gabbouj, M.: Parallel Image Component Labeling With Watershed Transformation. IEEE Transactions on Pattern Analysis and Machine Intelligence 19(5), 441–450 (1997)CrossRefGoogle Scholar
  5. 5.
    Moga, A., Cramariuc, B., Gabbouj, M.: Parallel watershed transformation algorithms for image segmentation. Parallel Computing 24(14), 1981–2001 (1998)CrossRefGoogle Scholar
  6. 6.
    Roerdink, M., Meijster, A.: The Watershed Transform: Definitions, Algorithms and Parallelization Strategies. Fundamenta Informaticae 41, 187–228 (2000)zbMATHMathSciNetGoogle Scholar
  7. 7.
    Sun, H., Yang, J., Ren, M.: A fast watershed algorithm based on chain code and application in image segmentation. Pattern Recognition Letters 26(9), 1266–1274 (2005)CrossRefGoogle Scholar
  8. 8.
    Rambabu, C., Chakrabarti, I.: An efficient immersion-based watershed transform method and its prototype architecture. Journal of Systems Architecture 53(4), 210–226 (2007)CrossRefGoogle Scholar
  9. 9.
    Beucher, S.: The watershed transformation applied to image segmentation. Scanning Microscopy International 6, 299–314 (1991)Google Scholar
  10. 10.
    Stoev, S.L.: RaFSi - A Fast Watershed Algorithm Based on Rainfalling Simulation. In: 8th International Conference on Computer Graphics, Visualization, and Interactive Digital Media (WSCG 2000), pp. 100–107 (2000)Google Scholar
  11. 11.
    Lin, Y.-C., Tsai, Y.-P., Hung, Y.-P., Shih, Z.-C.: Comparison Between Immersion-Based and Toboggan- Based Watershed Image Segmentation. IEEE Transactions on Image Processing 15(3), 632–640 (2006)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Michał Świercz
    • 1
  • Marcin Iwanowski
    • 1
  1. 1.Institute of Control and Industrial ElectronicsWarsaw University of TechnologyWarsawPoland

Personalised recommendations