Share Email Print

Proceedings Paper

Optimal parallel watershed algorithm based on image integration and sequential scannings
Author(s): Alina N. Lindner; Moncef Gabbouj
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Watershed transformation is a tool for image segmentation widely used in computer vision applications. However, the complexity of processing large images entails fast parallel algorithms. In this paper, an improved SPMD (single program multiple data) watershed algorithm based on image integration and sequential scannings is rendered. The task performed by the algorithm is an alternative to the classical simulated immersion for computing the watershed image. Although the technique converges slow on a single processor computer, due to the repeated raster and anti-raster scannings of the image, it performs much faster in parallel, when subimages of the global image are simultaneously processed. Additionally, a global connected components operation employed for the parallel labeling of the seeds for region growing increases the efficiency of the algorithm. Results of a message passing interface (MPI) implementation tested on a Cray T3D parallel computer demonstrate the resilience of the presented parallel design solution to increasing number of processors, as to larger image sizes.

Paper Details

Date Published: 19 September 1997
PDF: 12 pages
Proc. SPIE 3166, Parallel and Distributed Methods for Image Processing, (19 September 1997); doi: 10.1117/12.279607
Show Author Affiliations
Alina N. Lindner, Albert-Ludwigs-Univ. Freiburg (Germany)
Moncef Gabbouj, Tampere Univ. of Technology (Finland)

Published in SPIE Proceedings Vol. 3166:
Parallel and Distributed Methods for Image Processing
Hongchi Shi; Patrick C. Coffield, Editor(s)

© SPIE. Terms of Use
Back to Top