An efficient watershed segmentation algorithm suitable for parallel implementation

Authors:
A. Moga;B. Cramariuc;M. Gabbouj
Affiliations:
-;-;-
Venue:
ICIP '95 Proceedings of the 1995 International Conference on Image Processing (Vol.2)-Volume 2 - Volume 2
Year:
1995

Citing 1
Cited 3

Watersheds in Digital Spaces: An Efficient Algorithm Based on Immersion Simulations

IEEE Transactions on Pattern Analysis and Machine Intelligence

Parallel Watershed Algorithm on Images from Cranial CT-Scans Using PVM and MPI on Distributed Memory System

Proceedings of the 6th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
A massively parallel implementation of the watershed based on cellular automata

ASAP '97 Proceedings of the IEEE International Conference on Application-Specific Systems, Architectures and Processors
A robust fully automatic scheme for general image segmentation

Digital Signal Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

An important aspect of designing a parallel algorithm is exploitation of the data locality for minimization of the communication overhead. We propose a reformulation of a global image operation called the watershed transformation. The method is one of the various approaches for image segmentation and works by labeling connected components. Both serial and parallel programming models are presented and evaluated when running on SUN and DEC Alpha AXP workstations, and a Cray T3D, respectively.