Fast, Parallel Watershed Algorithm Based on Path Tracing
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.
Unable to display preview. Download preview PDF.
- 9.Beucher, S.: The watershed transformation applied to image segmentation. Scanning Microscopy International 6, 299–314 (1991)Google Scholar
- 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