A new marker-based watershed algorithm
Authors:
- Weisi LinWLWeisi Lin
- 4 October 2004
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2
Abstract
The marker-based watershed approach is a very efficient means for image segmentation and has been widely used in recent years. The conventional marker-based algorithms are realized using hierarchical queues. A new marker-based watershed algorithm based on the disjoint set data structure is proposed in this paper. It consists of two steps: the flooding step and the resolving step. This algorithm has significantly lower memory requirement as compared with the conventional algorithms while maintaining the computational complexity of O(N) where N is the image size. Experimental results further show that the new algorithm implemented in C language runs much faster than the conventional algorithm based on the hierarchical queues as a result of savings from huge memory allocation and releasing operations.Keywords
This publication has 10 references indexed in Scilit:
- Automatic segmentation of moving objects in video sequences: a region labeling approachIEEE Transactions on Circuits and Systems for Video Technology, 2002
- Improved techniques for automatic image segmentationIEEE Transactions on Circuits and Systems for Video Technology, 2001
- Morphological segmentation of sport scenes using color informationIEEE Transactions on Broadcasting, 2000
- Regions adjacency graph applied to color image segmentationIEEE Transactions on Image Processing, 2000
- Fast object tracking in digital videoIEEE Transactions on Consumer Electronics, 2000
- Hybrid image segmentation using watersheds and fast region mergingIEEE Transactions on Image Processing, 1998
- Hierarchical morphological segmentation for image sequence codingIEEE Transactions on Image Processing, 1994
- Data structures and algorithms for disjoint set union problemsACM Computing Surveys, 1991
- Watersheds in digital spaces: an efficient algorithm based on immersion simulationsIEEE Transactions on Pattern Analysis and Machine Intelligence, 1991
- A linear-time algorithm for a special case of disjoint set unionJournal of Computer and System Sciences, 1985