Skip to Main content Skip to Navigation
Journal articles

A Parallel, O(n) Algorithm for an Unbiased, Thin Watershed

Abstract : 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. This hierarchical dependency complexifies the efficient use of modern computational architectures. This paper introduces a new way of computing the watershed transform that alleviates the sequential nature of hierarchical queue propagation. It is shown that this method can directly relate to the hierarchical flooding. Simultaneous and disorderly growth can now be used to maximize performances on modern architectures. Higher speed is reached, bigger data volume can be processed. Experimental results show increased performances regarding execution speed and memory consumption.
Document type :
Journal articles
Complete list of metadata
Contributor : Petr Dokladal Connect in order to contact the contributor
Submitted on : Tuesday, April 12, 2022 - 9:09:17 AM
Last modification on : Thursday, April 14, 2022 - 3:12:02 AM
Long-term archiving on: : Wednesday, July 13, 2022 - 6:26:34 PM


Publisher files allowed on an open archive



Théodore Chabardès, Petr Dokládal, Matthieu Faessel, Michel Bilodeau. A Parallel, O(n) Algorithm for an Unbiased, Thin Watershed. Image Processing On Line, IPOL - Image Processing on Line, 2022, 12, pp.50-71. ⟨10.5201/ipol.2022.215⟩. ⟨hal-03637529⟩



Record views


Files downloads