Image segmentation of color image based on region coherency

A two-step image segmentation algorithm is proposed, which is based on region coherency for the segmentation of color image. The first step is the watershed segmentation, and the next one is the region merging using artificial neural networks. Spatially homogeneous regions are obtained by the first step, but the regions are oversegmented. The second step merges the oversegmented regions. The proposed method exploits the luminance and chrominance difference components of the color image to verify region coherency. The YUV color coordinate system is used in this work.

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

[2]  Nuggehally Sampath Jayant,et al.  An adaptive clustering algorithm for image segmentation , 1989, International Conference on Acoustics, Speech, and Signal Processing,.

[3]  Laurent Najman,et al.  Geodesic Saliency of Watershed Contours and Hierarchical Segmentation , 1996, IEEE Trans. Pattern Anal. Mach. Intell..

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

[5]  Erkki Oja,et al.  Rival penalized competitive learning for clustering analysis, RBF net, and curve detection , 1993, IEEE Trans. Neural Networks.

[6]  Carlo H. Séquin,et al.  Optimal adaptive k-means algorithm with dynamic adjustment of learning rate , 1995, IEEE Trans. Neural Networks.