Abstract
In this paper a parallel implementation of a watershed algorithm is proposed. The algorithm is designed for a ring-architecture with distributed memory and a piece of shared memory using a single program multiple data (SPMD) approach. The watershed transform is generally considered to be inherently sequential. This paper shows that it is possible to exploit parallelism by splitting the computation of the watersheds of an image into three stages that can be executed in parallel.
| Original language | English |
|---|---|
| Title of host publication | EPRINTS-BOOK-TITLE |
| Publisher | University of Groningen, Johann Bernoulli Institute for Mathematics and Computer Science |
| Number of pages | 6 |
| Publication status | Published - 1995 |