Paper
17 March 2017 Parallel implementation of a watershed algorithm on shared memory multicore architecture
Author Affiliations +
Proceedings Volume 10341, Ninth International Conference on Machine Vision (ICMV 2016); 1034119 (2017) https://doi.org/10.1117/12.2268528
Event: Ninth International Conference on Machine Vision, 2016, Nice, France
Abstract
Watershed transform is widely used in image segmentation. In literature, this transform is computed by various algorithms among which the M-border kernel algorithm [1]. This algorithm computes the watershed transform in the framework of edge weighted graphs. It is based on a local property that makes it adapted to parallelization. In this paper we propose a parallel implementation of this algorithm. We start by studying the data dependencies problematic that it raises. We give then an approach that allows overcoming this problematic based on an alternated edges processing strategy. The implementation of this strategy on a shared memory multicore architecture using a Single Program Multiple Data (SPMD) approach proves its effectiveness. In fact, experimental results show that our implementation achieves a relative speedup factor of 2.8 using 4 processors over the performance of the sequential algorithm using a single processor on the same system.
© (2017) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Yosra Braham, Mohamed Akil Sr., and Mohamed Hédi Bedoui "Parallel implementation of a watershed algorithm on shared memory multicore architecture", Proc. SPIE 10341, Ninth International Conference on Machine Vision (ICMV 2016), 1034119 (17 March 2017); https://doi.org/10.1117/12.2268528
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Image processing

Parallel computing

Image processing algorithms and systems

Image segmentation

Data processing

Information science

Machine vision

RELATED CONTENT


Back to Top