The Implementation of a Parallel Watershed Algorithm

Research output: Chapter in Book/Report/Conference proceedingChapterAcademic

11 Citations (Scopus)
95 Downloads (Pure)

Abstract

In this paper the implementation of a parallel watershed algorithm is described. The algorithm is implemented on a multiple instruction multiple data (MIMD) ring-architecture using a single program multiple data (SPMD) approach using an asynchronous message passing interface and simulated shared memory via the Linda tuple space. 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 languageEnglish
Title of host publicationEPRINTS-BOOK-TITLE
PublisherUniversity of Groningen, Johann Bernoulli Institute for Mathematics and Computer Science
Number of pages9
Publication statusPublished - 1995

Keywords

  • image segmentation
  • parallel implementation
  • watershed algorithm

Cite this