Search

Abstract: Automatic image segmentation is always a fundamental but challenging problem in computer vision. The simplest approach to image segmentation may be clustering feature vectors of pixels at first, then labeling each pixel with its corresponding cluster. This requires that the clustering on feature space must be robust. However, most of popular clustering algorithms could not obtain a robust clustering result yet, if the clusters in feature space have a complex distribution. Generally, for most of clustering-based segmentation methods, it still needs more constraints of positional relations between pixels in image lattice to be utilized during the procedure of clustering. Our works in this paper address the problem of image segmentation under the paradigm of pure clustering-then-labeling. A robust clustering algorithm which could maintain good coherence of data in feature space is proposed and utilized to do clustering on the L∗a∗b∗ color feature space of pixels. Image segmentation is straightforwardly obtained by setting each pixel with its corresponding cluster. Further, based on the theory of Minimum Description Length, an effective approach to automatic parameter selection for our segmentation method is also proposed. We test our segmentation method on Berkeley segmentation database, and the experimental results show that our method compares favorably against some state-of-the-art segmentation methods. [Copyright &y& Elsevier]