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. © 2010 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Świercz, M., & Iwanowski, M. (2010). Fast, parallel watershed algorithm based on path tracing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6375 LNCS, pp. 317–324). https://doi.org/10.1007/978-3-642-15907-7_39
Mendeley helps you to discover research relevant for your work.