Abstract
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.
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
Forsyth, D., Ponce, J.: Computer Vision: A Modern Approach. Prentice Hall Press, Englewood Cliffs (2002)
Cheng, H., Jiang, X., et al.: Color image segmentation: advances and prospects. Pattern Recognition 34, 2259–2281 (2001)
Roberts, S.J.: Parametric and Non-Parametric Unsupervised Cluster Analysis. Pattern Recognition 30(2), 261–272 (1997)
Canny, J.F.: A Computational Approach to Edge Detection. IEEE Trans. on PAMI 8(6), 679–698 (1986)
Adams, R., Bischof, L.: Seeded Region Growing. IEEE Trans. on PAMIÂ 16(6) (1994)
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)
Comaniciu, D., Meer, P.: Mean Shift: A Robust Approach toward Feature Space Analysis. IEEE Trans. on PAMI 24(5), 603–619 (2002)
Tu, Z., Zhu, S.C.: Image Segmentation by Data-Driven Markov Chain Monte Carlo. IEEE Trans. on PAMI 24(5), 657–673 (2002)
Schölkopf, B., Smola, A.J.: Learning with Kernels: Support Vector Machines, Regularization and Beyond. MIT Press, Cambridge (2002)
Vapnik, V.: The Nature of Statistical Learning Theory, 2nd edn. Springer, New York (1997)
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)
Achlioptas, D., McSherry, F., Schölkopf, B.: Sampling techniques for kernel methods. Advance in Neural Information Processing Systems (NIPS) 14 (2002)
Williams, C., Seeger, M.: Using the Nyström Method to Speed Up Kernel Machines. Advance in Neural Information Processing Systems (NIPS) 13 (2001)
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)
Andrieu, C., de Freitas, N., Doucet, A., Jordan, M.I.: An introduction to MCMC for machine learning. Machine Learning 50, 5–43 (2003)
Breiman, L.: Bagging Predictors. Machine Learning 20(2), 123–140 (1996)
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)
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)
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)
Doucet, A., de Freitas, N., Gordon, N. (eds.): Sequential Monte Carlo in Practice. Springer, Heidelberg (2001)
Ng, A. Y., Jordan, M. I., Weiss, Y.: On Spectral Clustering: Analysis and an algorithm. Advance in Neural Information Processing Systems (NIPS) 14 (2002)
Kato, Z.: Bayesian Color Image segmentation using reversible jump Markov Chain Monte Carlo, CWI Research Report PNA-R9902 (1999) ISSN 1386-3711
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, J., Wang, J., Zhang, C. (2003). Color Image Segmentation: Kernel Do the Feature Space. In: LavraÄŤ, N., Gamberger, D., Blockeel, H., Todorovski, L. (eds) Machine Learning: ECML 2003. ECML 2003. Lecture Notes in Computer Science(), vol 2837. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39857-8_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-39857-8_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20121-2
Online ISBN: 978-3-540-39857-8
eBook Packages: Springer Book Archive