By Topic

An improved parallel watershed algorithm for distributed memory system

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Hai-Fang Zhou ; Dept. of Comput. Sci. & Technol., Nat. Univ. of Defense Technol., Changsha, China ; Yan-Huang Jiang ; Xue-jun Yang

As a classical method of image segmentation in mathematical morphology, the watershed transform has been applied successively into some fields like remote sensing image processing, biomedical and computer vision applications. However the watershed transform is a relatively time consuming task and classical watershed algorithms have a strong recursive nature, so straightforward parallel ones have a very low efficiency. Mekjster and Roerdink (1996; 1995) have proposed an alternative algorithm (M-R for short) which consists of three stages aimed to exploit parallelism fully. The M-R algorithm has much limitation and some underlying logical errors, therefore we present an improved parallel watershed algorithm based on a directed valued graph called components graph for image segmentation. We firstly point out the limits of the M-R algorithm, then describe the theory and steps of our algorithm in detail. Finally, experimental studies and performance measurements are given.

Published in:

Algorithms and Architectures for Parallel Processing, 2002. Proceedings. Fifth International Conference on

Date of Conference:

23-25 Oct. 2002