Unsupervised color image segmentation using a lattice algebra clustering technique

In this paper we introduce a lattice algebra clustering technique for segmenting digital images in the Red-Green- Blue (RGB) color space. The proposed technique is a two step procedure. Given an input color image, the first step determines the finite set of its extreme pixel vectors within the color cube by means of the scaled min-W and max-M lattice auto-associative memory matrices, including the minimum and maximum vector bounds. In the second step, maximal rectangular boxes enclosing each extreme color pixel are found using the Chebychev distance between color pixels; afterwards, clustering is performed by assigning each image pixel to its corresponding maximal box. The two steps in our proposed method are completely unsupervised or autonomous. Illustrative examples are provided to demonstrate the color segmentation results including a brief numerical comparison with two other non-maximal variations of the same clustering technique.

[1]  F. Meyer,et al.  Color image segmentation , 1992 .

[2]  Pierre-Yves Strub,et al.  Color image segmentation based on automatic morphological clustering , 2001, Proceedings 2001 International Conference on Image Processing (Cat. No.01CH37205).

[3]  Mehmet Celenk,et al.  Optimal thresholding for color images , 1998, Electronic Imaging.

[4]  Andreas Koschan,et al.  Colour Image Segmentation: A Survey , 1994 .

[5]  V. K. Banga,et al.  Color Image Segmentation Using Soft Computing , .

[6]  L. Iancu,et al.  A morphological auto-associative memory based on dendritic computing , 2004, 2004 IEEE International Joint Conference on Neural Networks (IEEE Cat. No.04CH37541).

[7]  Jing Li Wang,et al.  Color image segmentation: advances and prospects , 2001, Pattern Recognit..

[8]  Yee-Hong Yang,et al.  Multiresolution Color Image Segmentation , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[9]  Huang Yumin,et al.  A PHYSICAL APPROACH TO COLOR IMAGE UNDERSTANDING , 1991 .

[10]  José Crespo,et al.  The Flat Zone Approach and Color Images , 1994, ISMM.

[11]  Gerhard X. Ritter,et al.  Lattice associative memories that are robust in the presence of noise , 2005, SPIE Optics + Photonics.

[12]  Sang Uk Lee,et al.  Color image segmentation based on 3-D clustering: morphological approach , 1998, Pattern Recognit..

[13]  Gerhard X. Ritter,et al.  Perfect recall from noisy input patterns with a dendritic lattice associative memory , 2011, The 2011 International Joint Conference on Neural Networks.

[14]  Glenn Healey,et al.  Using physical color models in 3-D machine vision , 1990, Electronic Imaging.

[15]  Paul D. Gader,et al.  Fixed Points of Lattice Transforms and Lattice Associative Memories , 2006 .

[16]  Sankar K. Pal,et al.  A review on image segmentation techniques , 1993, Pattern Recognit..

[17]  Gerhard X. Ritter,et al.  Reconstruction of Patterns from Noisy Inputs Using Morphological Associative Memories , 2003, Journal of Mathematical Imaging and Vision.

[18]  Henryk Palus.  Color Image Segmentation: Selected Techniques , 2006 .

[19]  Josef Kittler,et al.  Histogram-based segmentation in a perceptually uniform color space , 1998, IEEE Trans. Image Process..

[20]  G. Urcid,et al.  COLOR IMAGE SEGMENTATION BASED ON LATTICE AUTO-ASSOCIATIVE MEMORIES , 2009 .