Color Image Segmentation: Kernel Do the Feature Space

  • Jianguo Lee
  • Jingdong Wang
  • Changshui Zhang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2837)


In this paper, we try to apply kernel methods to solve the problem of color image segmentation, which is attracting more and more attention recently as color images provide more information than gray level images do. One natural way for color image segmentation is to do pixels clustering in color space. GMM has been applied for this task. However, practice has shown that GMM doesn’t perform this task well in original color space. Our basic idea is to solve the segmentation in a nonlinear feature space obtained by kernel methods. The scheme is that we propose an extension of EM algorithm for GMM by involving one kernel feature extraction step, which is called K-EM. With the technique based on Monte Carlo sampling and mapping, K-EM not only speeds up kernel step, but also automatically extracts good features for clustering in a nonlinear way. Experiments show that the proposed algorithm has satisfactory performance. The contribution of this paper could be summarized into two points: one is that we introduced kernel methods to solve real computer vision problem, the other is that we proposed an efficient scheme for kernel methods applied in large scale problems.


Color Space Gaussian Mixture Model Support Vector Regression Kernel Method Spectral Cluster 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Forsyth, D., Ponce, J.: Computer Vision: A Modern Approach. Prentice Hall Press, Englewood Cliffs (2002)Google Scholar
  2. 2.
    Cheng, H., Jiang, X., et al.: Color image segmentation: advances and prospects. Pattern Recognition 34, 2259–2281 (2001)zbMATHCrossRefGoogle Scholar
  3. 3.
    Roberts, S.J.: Parametric and Non-Parametric Unsupervised Cluster Analysis. Pattern Recognition 30(2), 261–272 (1997)CrossRefGoogle Scholar
  4. 4.
    Canny, J.F.: A Computational Approach to Edge Detection. IEEE Trans. on PAMI 8(6), 679–698 (1986)Google Scholar
  5. 5.
    Adams, R., Bischof, L.: Seeded Region Growing. IEEE Trans. on PAMI 16(6) (1994)Google Scholar
  6. 6.
    Belongie, S., Carson, C., Greeenspan, H. and Malik, J.: Color and Texture Based Image Segmentation Using EM and Its Application to Content-Based Image Re-trieval. In: Proceeding of the International Conferences on Computer Vision (ICCV 1998) (1998) Google Scholar
  7. 7.
    Comaniciu, D., Meer, P.: Mean Shift: A Robust Approach toward Feature Space Analysis. IEEE Trans. on PAMI 24(5), 603–619 (2002)Google Scholar
  8. 8.
    Tu, Z., Zhu, S.C.: Image Segmentation by Data-Driven Markov Chain Monte Carlo. IEEE Trans. on PAMI 24(5), 657–673 (2002)Google Scholar
  9. 9.
    Schölkopf, B., Smola, A.J.: Learning with Kernels: Support Vector Machines, Regularization and Beyond. MIT Press, Cambridge (2002)Google Scholar
  10. 10.
    Vapnik, V.: The Nature of Statistical Learning Theory, 2nd edn. Springer, New York (1997)Google Scholar
  11. 11.
    Schölkopf, B., Smola, A.J., Müller, K.R.: Nonlinear Component Analysis as a Kernel Eigenvalue Problem. Neural Computation 10(5), 1299–1319 (1998)CrossRefGoogle Scholar
  12. 12.
    Achlioptas, D., McSherry, F., Schölkopf, B.: Sampling techniques for kernel methods. Advance in Neural Information Processing Systems (NIPS) 14 (2002) Google Scholar
  13. 13.
    Williams, C., Seeger, M.: Using the Nyström Method to Speed Up Kernel Machines. Advance in Neural Information Processing Systems (NIPS) 13 (2001) Google Scholar
  14. 14.
    Taylor, J.S., Williams, C., Cristianini, N., Kandola, J.: On the Eigenspectrum of the Gram Matrix and Its Relationship to the Operator Eigenspectrum. In: Cesa-Bianchi, N., Numao, M., Reischuk, R. (eds.) ALT 2002. LNCS (LNAI), vol. 2533, pp. 23–40. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  15. 15.
    Andrieu, C., de Freitas, N., Doucet, A., Jordan, M.I.: An introduction to MCMC for machine learning. Machine Learning 50, 5–43 (2003)zbMATHCrossRefGoogle Scholar
  16. 16.
    Breiman, L.: Bagging Predictors. Machine Learning 20(2), 123–140 (1996)Google Scholar
  17. 17.
    Bilmes, J. A.: A Gentle Tutorial on the EM Algorithm and its Application to Parameter Estimation for Gaussian Mixture and Hidden Markov Models, Technical Report, ICSI-TR-97-021, UC Berkeley (1997) Google Scholar
  18. 18.
    Wu, Y., Tian, Q., Huang, T.S.: Discriminant-EM Algorithm with Application to Image Retrieval. In: Proceeding of the IEEE Conferences on Computer Vision and Pattern Recognition (CVPR 2000), pp. 222–227 (2000)Google Scholar
  19. 19.
    Wu, Y., Huang, T.S., Toyama, K.: Self-Supervised Learning for Object Recognition based on Kernel Discriminant-EM Algorithm. In: Proceeding of the International Conferences on Computer Vision (ICCV 2001), pp. 275–280 (2001)Google Scholar
  20. 20.
    Doucet, A., de Freitas, N., Gordon, N. (eds.): Sequential Monte Carlo in Practice. Springer, Heidelberg (2001)zbMATHGoogle Scholar
  21. 21.
    Ng, A. Y., Jordan, M. I., Weiss, Y.: On Spectral Clustering: Analysis and an algorithm. Advance in Neural Information Processing Systems (NIPS) 14 (2002) Google Scholar
  22. 22.
    Kato, Z.: Bayesian Color Image segmentation using reversible jump Markov Chain Monte Carlo, CWI Research Report PNA-R9902 (1999) ISSN 1386-3711Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Jianguo Lee
    • 1
  • Jingdong Wang
    • 1
  • Changshui Zhang
    • 1
  1. 1.State Key Laboratory of Intelligent Technology and Systems, Department of AutomationTsinghua UniversityBeijingP. R. China

Personalised recommendations