Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

15

CAIP
1995
Springer

favoriteEmaildiscussreport

155views Image Analysis» more CAIP 1995»

A Proposal for the Implementation of a Parallel Watershed Algorithm

13 years 8 months ago

A Proposal for the Implementation of a Parallel Watershed Algorithm

Download www.cs.rug.nl

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.

Arnold Meijster, Jos B. T. M. Roerdink

Real-time Traffic

CAIP 1995 | Image Analysis | Parallel Implementation | Single Program Multiple Data | Watershed Algorithm |

claim paper

Related Content

» An efficient watershed segmentation algorithm suitable for parallel implementation

» The Watershed Transform Definitions Algorithms and Parallelization Strategies

» Watershed Cuts Thinnings Shortest Path Forests and Topological Watersheds

» On Watershed Cuts and Thinnings

» Algorithms for the Topological Watershed

» The tiezone watershed definition algorithm and applications

» Level Set Methods for Watershed Image Segmentation

» Statistical solution to watershed oversegmentation

» UniquelyDetermined Thinning of the TieZone Watershed Based on Label Frequency

Post Info
More Details (n/a)

Added	25 Aug 2010
Updated	25 Aug 2010
Type	Conference
Year	1995
Where	CAIP
Authors	Arnold Meijster, Jos B. T. M. Roerdink

Comments (0)