Share Email Print
cover

Proceedings Paper

Parallel implementation of a watershed algorithm on shared memory multicore architecture
Author(s): Yosra Braham; Mohamed Akil Sr.; Mohamed Hédi Bedoui
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 17 March 2017
PDF: 6 pages
Proc. SPIE 10341, Ninth International Conference on Machine Vision (ICMV 2016), 1034119 (17 March 2017); doi: 10.1117/12.2268528
Show Author Affiliations
Yosra Braham, Univ. de Monastir (Tunisia)
Lab. of Informatics Gaspard-Monge, CNRS, École des ponts ParisTech, Univ. of Paris-Est (France)
Mohamed Akil Sr., Lab. of Informatics Gaspard-Monge, CNRS, École des ponts ParisTech, Univ. of Paris-Est (France)
Mohamed Hédi Bedoui, Univ. de Monastir (Tunisia)


Published in SPIE Proceedings Vol. 10341:
Ninth International Conference on Machine Vision (ICMV 2016)
Antanas Verikas; Petia Radeva; Dmitry P. Nikolaev; Wei Zhang; Jianhong Zhou, Editor(s)

© SPIE. Terms of Use
Back to Top