A fast watershed algorithm based on chain code and its application in image segmentation

In this paper, a novel algorithm is proposed for the watershed transformation. This new algorithm is based on chain code. The traditional concept of chain code is first expanded into point-out chain code and point-in chain code. Then two theorems, which depict how to make watershed transformation based on chain code, are proposed and proved. In the end, the description of this new algorithm is presented, and its complexity is discussed in detail. Experiments show that the presented algorithm runs fast. Further more, the new algorithm can provide more information to the following image processing.

[1]  Aggelos K. Katsaggelos,et al.  Hybrid image segmentation using watersheds and fast region merging , 1998, IEEE Trans. Image Process..

[2]  Josef Kittler,et al.  Automatic watershed segmentation of randomly textured color images , 1997, IEEE Trans. Image Process..

[3]  D. M. P. Hagyard,et al.  Analysis of watershed algorithms for greyscale images , 1996, Proceedings of 3rd IEEE International Conference on Image Processing.

[4]  Alina N. Moga,et al.  An efficient watershed algorithm based on connected components , 2000, Pattern Recognit..

[5]  Luc Vincent,et al.  Watersheds in Digital Spaces: An Efficient Algorithm Based on Immersion Simulations , 1991, IEEE Trans. Pattern Anal. Mach. Intell..