Marker-based image segmentation relying on disjoint set union

Abstract Marker-based image segmentation has been widely used in image analysis and understanding. The well-known Meyer's marker-based watershed algorithm by immersion is realized using the hierarchical circular queues. A new marker-based segmentation algorithm relying on disjoint set union is proposed in this paper. It consists of three steps, namely: pixel sorting, set union, and pixel resolving. The memory requirement for the proposed algorithm is fixed as 2× N integers ( N is the image size), whereas the memory requirement for Meyer's algorithm is image dependent. The advantage of the proposed algorithm lies at its regularity and simplicity in software/firmware/hardware implementation.

[1]  John I. Goutsias,et al.  Mathematical Morphology and its Applications to Image and Signal Processing , 2000, Computational Imaging and Vision.

[2]  Chee Sun Won,et al.  Fast object tracking in digital video , 2000, IEEE Trans. Consumer Electron..

[3]  Daniel Gatica-Perez,et al.  Semantic video object extraction using four-band watershed and partition lattice operators , 2001, IEEE Trans. Circuits Syst. Video Technol..

[4]  Yoshinori Izumi,et al.  Morphological segmentation of sport scenes using color information , 2000, IEEE Trans. Broadcast..

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

[6]  Jos B. T. M. Roerdink,et al.  A disjoint set algorithm for the watershed transform , 1998, 9th European Signal Processing Conference (EUSIPCO 1998).

[7]  J. Serra,et al.  An overview of morphological filtering , 1992 .

[8]  Moncef Gabbouj,et al.  Parallel Marker-Based Image Segmentation with Watershed Transformation , 1998, J. Parallel Distributed Comput..

[9]  Moncef Gabbouj,et al.  Parallel Image Component Labeling With Watershed Transformation , 1997, IEEE Trans. Pattern Anal. Mach. Intell..

[10]  Robert E. Tarjan,et al.  Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

[11]  B. S. Manjunath,et al.  Color image segmentation , 1999, Proceedings. 1999 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No PR00149).

[12]  Montse Pardàs,et al.  Hierarchical morphological segmentation for image sequence coding , 1994, IEEE Trans. Image Process..

[13]  Philippe Salembier,et al.  Antiextensive connected operators for image and sequence processing , 1998, IEEE Trans. Image Process..

[14]  Fernand Meyer,et al.  Topographic distance and watershed lines , 1994, Signal Process..

[15]  Cedric Nishan Canagarajah,et al.  Image segmentation using a texture gradient based watershed transform , 2003, IEEE Trans. Image Process..

[16]  Jeffrey D. Ullman,et al.  Set Merging Algorithms , 1973, SIAM J. Comput..

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

[18]  Wan-Chi Siu,et al.  Improved techniques for automatic image segmentation , 2001, IEEE Trans. Circuits Syst. Video Technol..

[19]  GalilZvi,et al.  Data structures and algorithms for disjoint set union problems , 1991 .

[20]  Jos B. T. M. Roerdink,et al.  The Watershed Transform: Definitions, Algorithms and Parallelization Strategies , 2000, Fundam. Informaticae.

[21]  Zvi Galil,et al.  Data structures and algorithms for disjoint set union problems , 1991, CSUR.

[22]  Alina N. Moga,et al.  A connected component approach to the watershed segmentation , 1998 .

[23]  E.A.B. da Silva,et al.  Wavelet-watershed automatic infrared image segmentation method , 2003 .