A parallel, O(n), algorithm for unbiased, thin watershed - Archive ouverte HAL Access content directly
Conference Papers Year :

A parallel, O(n), algorithm for unbiased, thin watershed

Petr Dokládal
Matthieu Faessel
  • Function : Author
  • PersonId : 975978
Michel Bilodeau


The watershed transform is a powerful tool for morphological segmentation. Most common implementations of this method involve a strict hierarchy on gray tones in processing the pixels composing an image. Those dependencies complexify the efficient use of modern computational architectures. This paper aims at answering this problem by introducing a new way of simulating the waterflood that preserves the locality of data to be processed. We propose a region growth algorithm based on arrowing graphs that is strictly linear despite the valuation domain of input images. Simultaneous and disorderly growth is made possible by using a synchronization mechanism coded directly on the weight of nodes. Experimental results show that the algorithm is accurate and by far outperforms common watershed algorithms.
Fichier principal
Vignette du fichier
chabardes.pdf (306.87 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01266889 , version 1 (03-02-2016)
hal-01266889 , version 2 (09-02-2016)




  • HAL Id : hal-01266889 , version 2


Theodore Chabardes, Petr Dokládal, Matthieu Faessel, Michel Bilodeau. A parallel, O(n), algorithm for unbiased, thin watershed . IEEE International Conference on Image Processing, Sep 2016, Phoenix, United States. ⟨hal-01266889v2⟩
4979 View
368 Download


Gmail Facebook Twitter LinkedIn More