Elsevier

Pattern Recognition

Volume 35, Issue 2, February 2002, Pages 395-405
Pattern Recognition

Color image segmentation—an innovative approach

https://doi.org/10.1016/S0031-3203(01)00050-4Get rights and content

Abstract

In this paper we describe a color image segmentation system that performs color clustering in a color space and then color region segmentation in the image domain. For color segmentation, we developed a fuzzy clustering algorithm that iteratively generates color clusters using a uniquely defined fuzzy membership function and an objective function for clustering optimization. The fuzzy membership function represents belief value of a color belonging to a color cluster and the mutual interference of neighboring clusters. The region segmentation algorithm merges clusters in the image domain based on color similarity and spatial adjacency. We developed three different methods for merging regions in the image domain. Unlike many existing clustering algorithms, the image segmentation system does not require the knowledge about the number of the color clusters to be generated at each stage and the resolution of the color regions can be controlled by one single parameter, the radius of a cluster. The color image segmentation system has been implemented and tested on a variety of color images including satellite images, car and face images. The experiment results are presented and the performance of each algorithm in the segmentation system is analyzed. The system has shown to be both effective and efficient.

Introduction

Advances in cognitive psychology over the past decades have revealed that visual data, in the form of scenes and pictures, are often mentally processed in visual terms alone, without any corresponding translation or recording into verbal labels or representations [1], and humans often respond strongly to color cues within image contents [2], [3], [4], [5], [6]. In the past decade, color imaging and printing devices has become more affordable and computer power has been ever increasing. As a result, color imaging has become popular in many applications including object classification and recognition, video surveillance, image indexing and retrieval in image databases, feature based video compression, etc. [7], [8]. In some applications, image contents can be better described in terms of color features combined with spatial relations such as enclosure and adjacency due to the irregularity of object shapes in images. This paper describes our research in color image segmentation, which is often a necessary computational process for color-based image retrieval and object recognition.

Image segmentation is a process of partitioning image pixels based on selected image features. The pixels that belong to the same region must be spatially connected and have the similar image features. If the selected segmentation feature is color, an image segmentation process would separate pixels that have distinct color feature into different regions, and, simultaneously, group pixels that are spatially connected and have the similar color into the same region. In color imagery, image pixels can be represented in a number of different color spaces e.g. RGB, XYZ or LUV [5], [9], [10]. One major concern in color image segmentation is that the computational complexity, which has increased significantly in comparison with gray scale image segmentation. The process of image segmentation can be considered as an unsupervised clustering, if a priori knowledge about the number and type of regions present in the image is not available [11], [12]. Image clustering procedures often use the individual image pixels as units and compare each pixel value with every other neighboring pixel value, which require excessively long computation times for images of high resolutions. A high quality representation of a color requires 8 bits using pulse code modulation (PCM) quantization for each of the three color components, Red (R), Green (G), Blue (B). For each image pixel, 24 bits of amplitude quantization is required, allowing specification of 224=16,777,216 distinguishable colors. This leads to high computational cost in image clustering.

In this paper we describe a color image segmentation system that performs color clustering in a color space and then color region segmentation in the image domain. The paper is organized as follows. Section 2 will give an overview of the color image segmentation system. Section 3 will describe a fuzzy clustering algorithm that iteratively generates color clusters using a uniquely defined fuzzy membership function and an objective function for clustering optimization. The fuzzy membership function represents belief value of a color belonging to a color cluster and the mutual interference of neighboring clusters. Section 4 will present a region segmentation algorithm that groups clusters in the image domain based on color similarity and spatial adjacency. We developed three different methods for merging regions in the image domain. Unlike many existing clustering algorithms, the image segmentation system does not require the knowledge about the number of the color clusters to be generated at each stage and the resolution of the color regions can be controlled by one single parameter, the radius of a cluster. The color image segmentation system has been implemented and tested on a variety of color images including satellite images, car and face images. Section 5 presents our experiment results and the performance analysis of each algorithm in the segmentation system. The system has shown to be both effective and efficient.

Section snippets

A color image segmentation system

Fig. 1 presents the overview of the color image segmentation system. The color image segmentation system consists of two stages of computation. At the first stage, we developed a fuzzy clustering algorithm to generate clusters of similar colors using a color histogram of an image. The histogram of a color image in a selected color space is a three dimensional (3D) discrete feature space that provides the color distribution of the image. Given a discrete color space, a color histogram of an

A fuzzy clustering algorithm for color segmentation

Let function f(C) demote the color histogram of an image, where C is a color in the image. The dimensions of a color histogram are determined by the color space used to represent the image. For example, in the L*u*v* space, C is represented by a vector (l, u, v) and f(C) is the number of pixels that have L*u*v* values equal to (l,u,v). Considering the uncertainty nature of classifying similar colors into clusters, we developed the following fuzzy clustering algorithm for color segmentation.

In

Image segmentation in image space

At the second stage of image segmentation, we map the clusters in CL1 to the image domain to obtain CL2. Each cluster in CL2 contains pixels that are spatially connected and belong to the same color cluster in CL1. In general, one cluster in CL1 is decomposed into more than one cluster in CL2, and therefore CL2 is much larger than CL1. The clusters illustrated in Fig. 4, Fig. 5 that are separated in the image space are considered as different clusters in CL2, although they may the same color.

Implementation, experiment, and performance analysis

All the algorithms described in the previous sections have been implemented in C under the operating system of Windows 95. In the implementation, we first converted a color from its RGB metrics to L*u*v* metrics using the formula given in Refs. [20], [21] and quantized L*u*v* space into a 3D mesh that has 64 bins at each dimension. In order to effectively control the number of clusters generated by the fuzzy clustering algorithm, we introduced one additional parameter, max-cluster-number. When

Conclusion

We have presented a color image segmentation system that is both effective and efficient. The segmentation system consists of two stages of computation: fuzzy clustering process in the color space and region segmentation in the image space. The fuzzy clustering algorithm is innovatively developed and efficiently implemented. The fuzzy membership function used in the fuzzy clustering algorithm adequately expresses the mutual interference of neighboring clusters as well as the color distance

Acknowledgements

The work is support in part by a grant from the Office of Vice President at the University of Michigan.

About the Author—TIE-QI CHEN received a B.S. degree in Theoretical Physics from Nanjing University, Nanjing, Jiangsu, P.R. China 1989 and a Ph.D. degree in Optics from Fudan University, Shanghai, P.R. China in 1995, and a M.S. degree in Computer Engineering from the University of Michigan-Dearborn, Dearborn, Michigan in 1998. From 1995 to 1998, he worked as a visiting scholar at the University of Michigan-Dearborn, Dearborn, Michigan. Currently he is a Senior Software Engineer at Automotive

References (21)

  • M. Roubens

    Fuzzy Clustering algorithms and their cluster validity

    Eur. J. Oper. Res.

    (1982)
  • R.N. Haber, L. Wilkinson, Perceptual component of computer displays, IEEE CG&A (1982)...
  • F. Geldard

    The Human Senses

    (1953)
  • P. Lennie et al.

    Mechanisms of Color Vision

    CRC Crit. Rev. Neurobiol.

    (1988)
  • D. Chapman, Vision, instruction, and action, Technical Report 1204, Massachusetts Institute of Technology, Artificial...
  • C.L. Novak, S.A. Shafer, Color vision, Physics-Based Vision COLOR, Jones an Bartlett, 1992, pp....
  • G.D. Finlayson

    Color in perspective

    IEEE Trans. Pattern Anal. Mach. Intell.

    (1996)
  • J. Hafner et al.

    Efficient color histogram indexing for quadratic form distance functions

    IEEE Trans. Pattern Anal. Mach. Intell.

    (1995)
  • E. Binaghi, I. Gagliardi, R. Schettini, Indexing and fuzzy logic-based retrieval of color images, in: E. Knuth and L....
  • E. Hering

    Outlines of a Theory of the Light Sense

    (1964)
There are more references available in the full text version of this article.

Cited by (77)

View all citing articles on Scopus

About the Author—TIE-QI CHEN received a B.S. degree in Theoretical Physics from Nanjing University, Nanjing, Jiangsu, P.R. China 1989 and a Ph.D. degree in Optics from Fudan University, Shanghai, P.R. China in 1995, and a M.S. degree in Computer Engineering from the University of Michigan-Dearborn, Dearborn, Michigan in 1998. From 1995 to 1998, he worked as a visiting scholar at the University of Michigan-Dearborn, Dearborn, Michigan. Currently he is a Senior Software Engineer at Automotive Technologies International, Inc., Rochester Hills, Michigan. He is now working in the field of automotive occupant safety using optical and ultrasonic sensing and neural networks. His interests include image processing, neural networks, fuzzy logic, and software development. Dr. Chen is a member of IEEE and ACM.

About the Author—YI LU received a M.S. degree in Computer Science from Wayne State University, Detroit, Michigan, in 1983, and a Ph.D. degree in Computer, Information and Control Engineering from the University of Michigan, Ann Arbor, Michigan, in 1989. From 1989 to 1992, she was a Research Scientist at the Environmental Research Institute of Michigan, Ann Arbor, Michigan. Currently she is an Associate Professor at the University of Michigan-Dearborn. Her research interests include computer vision, neural networks and fuzzy logic. Dr. Lu is a senior member of IEEE Computer Society and a member in the American Association of Artificial Intelligence. She is an associate editor for the Journal of Pattern Recognition.

View full text