A New PSO Based Kernel Clustering Method for Image Segmentation

In this paper a novel kernel clustering method is proposed. The application of the proposed clustering algorithm to the problem of unsupervised classification and image segmentation task is investigated. The proposed method provides a new scheme for classifying objects of one data set without any prior knowledge on the number of naturally occurring regions in the data or an assumption on clusters shapes. It's based on the use of Particle Swarm Optimization (PSO) algorithm and the use of core set concept which is commonly used to resolve the Minimum Enclosing Ball (MEB) problem. The performance of the proposed method has been compared with a few state of the art kernel clustering methods over a test of artificial data and the Berkeley image segmentation dataset.

[1]  Xiang Ji,et al.  Support vector clustering combined with spectral graph partitioning , 2004, Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004..

[2]  Daewon Lee,et al.  An improved cluster labeling method for support vector clustering , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[3]  Ivor W. Tsang,et al.  Core Vector Machines: Fast SVM Training on Very Large Data Sets , 2005, J. Mach. Learn. Res..

[4]  Dorin Comaniciu,et al.  Mean Shift: A Robust Approach Toward Feature Space Analysis , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[5]  Andries Petrus Engelbrecht,et al.  Particle swarm optimization with spatially meaningful neighbours , 2008, 2008 IEEE Swarm Intelligence Symposium.

[6]  Hava T. Siegelmann,et al.  Support Vector Clustering , 2002, J. Mach. Learn. Res..

[7]  Jitendra Malik,et al.  A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics , 2001, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001.

[8]  Hui Zhang,et al.  Image segmentation evaluation: A survey of unsupervised methods , 2008, Comput. Vis. Image Underst..

[9]  Russell C. Eberhart,et al.  A new optimizer using particle swarm theory , 1995, MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science.

[10]  Kenneth L. Clarkson,et al.  Smaller core-sets for balls , 2003, SODA '03.

[11]  Bernhard Schölkopf,et al.  Nonlinear Component Analysis as a Kernel Eigenvalue Problem , 1998, Neural Computation.

[12]  Xiaoming Deng,et al.  Scaling up Kernel Grower Clustering Method for Large Data Sets via Core-sets , 2008 .

[13]  G. Wyszecki,et al.  Color Science Concepts and Methods , 1982 .

[14]  Jianhua Yang,et al.  Support vector clustering through proximity graph modelling , 2002, Proceedings of the 9th International Conference on Neural Information Processing, 2002. ICONIP '02..

[15]  Russell C. Eberhart,et al.  Parameter Selection in Particle Swarm Optimization , 1998, Evolutionary Programming.

[16]  Robert P. W. Duin,et al.  Support Vector Data Description , 2004, Machine Learning.

[17]  Martial Hebert,et al.  A Measure for Objective Evaluation of Image Segmentation Algorithms , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Workshops.

[18]  R. Kondor,et al.  Bhattacharyya and Expected Likelihood Kernels , 2003 .

[19]  Nello Cristianini,et al.  An introduction to Support Vector Machines , 2000 .

[20]  Francesco Camastra,et al.  A Novel Kernel Method for Clustering , 2005, IEEE Trans. Pattern Anal. Mach. Intell..

[21]  Hoel Le Capitaine,et al.  On Selecting an Optimal Number of Clusters for Color Image Segmentation , 2010, 2010 20th International Conference on Pattern Recognition.

[22]  José Neves,et al.  The fully informed particle swarm: simpler, maybe better , 2004, IEEE Transactions on Evolutionary Computation.

[23]  Frans van den Bergh,et al.  An analysis of particle swarm optimizers , 2002 .

[24]  Robert P. W. Duin,et al.  Support vector domain description , 1999, Pattern Recognit. Lett..

[25]  Max Mignotte,et al.  A Label Field Fusion Bayesian Model and Its Penalized Maximum Rand Estimator for Image Segmentation , 2010, IEEE Transactions on Image Processing.

[26]  Vladimir N. Vapnik,et al.  The Nature of Statistical Learning Theory , 2000, Statistics for Engineering and Information Science.

[27]  Vladimir Vapnik,et al.  Statistical learning theory , 1998 .

[28]  J.T. Kwok,et al.  Scaling up support vector data description by using core-sets , 2004, 2004 IEEE International Joint Conference on Neural Networks (IEEE Cat. No.04CH37541).

[29]  Karen Daniels,et al.  Gaussian Kernel Width Generator for Support Vector Clustering , 2005, Advances in Bioinformatics and Its Applications.

[30]  Ashok N. Srivastava,et al.  Mixture Density Mercer Kernels: A Method to Learn Kernels Directly from Data , 2004, SDM.

[31]  Gunther Wyszecki,et al.  Color Science: Concepts and Methods, Quantitative Data and Formulae, 2nd Edition , 2000 .

[32]  Jitendra Malik,et al.  Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[33]  Mark A. Girolami,et al.  Mercer kernel-based clustering in feature space , 2002, IEEE Trans. Neural Networks.

[34]  C. Berg,et al.  Harmonic Analysis on Semigroups , 1984 .

[35]  James Kennedy,et al.  Particle swarm optimization , 1995, Proceedings of ICNN'95 - International Conference on Neural Networks.

[36]  Xuegong Zhang,et al.  Kernel Nearest-Neighbor Algorithm , 2002, Neural Processing Letters.

[37]  Joseph S. B. Mitchell,et al.  Approximate minimum enclosing balls in high dimensions using core-sets , 2003, ACM J. Exp. Algorithmics.