Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2014, Article ID 464875, 13 pages
http://dx.doi.org/10.1155/2014/464875
Research Article

KmsGC: An Unsupervised Color Image Segmentation Algorithm Based on -Means Clustering and Graph Cut

1College of Computer Science, Sichuan University, Chengdu, Sichuan 610065, China
2College of Mathematics and Information Science, Guangxi University, Nanning, Guangxi 530004, China

Received 26 August 2013; Revised 17 March 2014; Accepted 2 April 2014; Published 12 May 2014

Academic Editor: Gerhard-Wilhelm Weber

Copyright © 2014 Binmei Liang and Jianzhou Zhang. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. C. Petitjean and J. Dacher, “A review of segmentation methods in short axis cardiac MR images,” Medical Image Analysis, vol. 15, no. 2, pp. 169–184, 2011. View at Publisher · View at Google Scholar · View at Scopus
  2. H. A. Jalab and N. A. Abdullah, “Content-based image retrieval based on electromagnetism-like mechanism,” Mathematical Problems in Engineering, vol. 2013, Article ID 782519, 10 pages, 2013. View at Publisher · View at Google Scholar · View at MathSciNet
  3. J. Wang and M. F. Cohen, “Image and video matting: a survey,” Foundations and Trends in Computer Graphics and Vision, vol. 3, no. 2, pp. 97–175, 2007. View at Publisher · View at Google Scholar · View at Scopus
  4. J. Shotton, J. Winn, C. Rother, and A. Criminisi, “Textonboost for image understanding: multi-class object recognition and segmentation by jointly modeling texture, layout, and context,” International Journal of Computer Vision, vol. 81, no. 1, pp. 2–23, 2009. View at Publisher · View at Google Scholar · View at Scopus
  5. M. A. Ruzon and C. Tomasi, “Color edge detection with the compass operator,” in Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR '99), vol. 2, pp. 160–166, Fort Collins, Colo, USA, June 1999. View at Scopus
  6. S.-C. T. Cheng, “Region-growing approach to colour segmentation using 3-D clustering and relaxation labelling,” IEE Proceedings: Vision, Image and Signal Processing, vol. 150, no. 4, pp. 270–276, 2003. View at Publisher · View at Google Scholar · View at Scopus
  7. L. Vincent and P. Soille, “Watersheds in digital spaces: an efficient algorithm based on immersion simulations,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 13, no. 6, pp. 583–598, 1991. View at Publisher · View at Google Scholar · View at Scopus
  8. I. Vanhamel, I. Pratikakis, and H. Sahli, “Multiscale gradient watersheds of color images,” IEEE Transactions on Image Processing, vol. 12, no. 6, pp. 617–626, 2003. View at Publisher · View at Google Scholar · View at Scopus
  9. D. Comaniciu and P. Meer, “Mean shift: a robust approach toward feature space analysis,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 24, no. 5, pp. 603–619, 2002. View at Publisher · View at Google Scholar · View at Scopus
  10. A. Y. Yang, J. Wright, S. Sastry, and Y. Ma, “Unsupervised segmentation of natural images via lossy data compression,” Computer Vision and Image Understanding, vol. 110, no. 2, pp. 212–225, 2008. View at Publisher · View at Google Scholar · View at Scopus
  11. P. Felzenszwalb and D. Huttenlocher, “Efficient graph-based image segmentation,” International Journal of Computer Vision, vol. 59, no. 2, pp. 167–181, 2004. View at Publisher · View at Google Scholar · View at Scopus
  12. J. Shi and J. Malik, “Normalized cuts and image segmentation,” in Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, pp. 731–737, San Juan, Puerto Rico, June 1997. View at Publisher · View at Google Scholar · View at Scopus
  13. Y. Deng and B. S. Manjunath, “Unsupervised segmentation of color-texture regions in images and video,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 23, no. 8, pp. 800–810, 2001. View at Publisher · View at Google Scholar · View at Scopus
  14. Z. Yu, O. C. Au, R. Zou, W. Yu, and J. Tian, “An adaptive unsupervised approach toward pixel clustering and color image segmentation,” Pattern Recognition, vol. 43, no. 5, pp. 1889–1906, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  15. G. P. Balasubramanian, E. Saber, V. Misic, E. Peskin, and M. Shaw, “Unsupervised color image segmentation using a dynamic color gradient thresholding algorithm,” in Human Vision and Electronic Imaging XIII, B. E. Rogowitz and T. N. Pappas, Eds., vol. 6806 of Proceedings of SPIE, San Jose, Calif, USA, January 2008. View at Publisher · View at Google Scholar · View at Scopus
  16. Y. Boykov and M.-P. Jolly, “Interactive graph cuts for optimal boundary & region segmentation of objects in N-D images,” in Proceedings of the 8th International Conference on Computer Vision (ICCV '01), vol. 1, pp. 105–112, Vancouver, Canada, July 2001. View at Publisher · View at Google Scholar · View at Scopus
  17. A. Delong, A. Osokin, H. N. Isack, and Y. Boykov, “Fast approximate energy minimization with label costs,” International Journal of Computer Vision, vol. 96, no. 1, pp. 1–27, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  18. Y. Boykov and G. Funka-Lea, “Graph cuts and efficient N-D image segmentation,” International Journal of Computer Vision, vol. 70, no. 2, pp. 109–131, 2006. View at Publisher · View at Google Scholar · View at Scopus
  19. C. Rother, V. Kolmogorov, and A. Blake, “‘GrabCut”: interactive foreground extraction using iterated graph cuts,” in Proceedings of the 31st ACM International Conference on Computer Graphics and Interactive Techniques (ACM SIGGRAPH '04), pp. 309–314, Los Angeles, Calif, USA, August 2004. View at Publisher · View at Google Scholar · View at Scopus
  20. Y. Li, J. Sun, C. -K. Tang, and H. -Y. Shum, “Lazy snapping,” ACM Transactions on Graphics, vol. 23, no. 3, pp. 303–308, 2004. View at Google Scholar
  21. J. Ning, L. Zhang, D. Zhang, and C. Wu, “Interactive image segmentation by maximal similarity based region merging,” Pattern Recognition, vol. 43, no. 2, pp. 445–456, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  22. S. Vicente, V. Kolmogorov, and C. Rother, “Graph cut based image segmentation with connectivity priors,” in Proceedings of the 26th IEEE Conference on Computer Vision and Pattern Recognition (CVPR '08), pp. 1–8, Anchorage, Alaska, USA, June 2008. View at Publisher · View at Google Scholar · View at Scopus
  23. Y. Boykov, O. Veksler, and R. Zabin, “Efficient approximate energy minimization via graph cuts,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 20, no. 12, pp. 1222–1239, 2001. View at Google Scholar
  24. V. Kolmogorov and R. Zabih, “What energy functions can be minimized via graph cuts?” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 26, no. 2, pp. 147–159, 2004. View at Publisher · View at Google Scholar · View at Scopus
  25. A. Blake and A. Zisserman, Visual Reconstruction, MIT Press, Cambridge, Mass, USA, 1987. View at MathSciNet
  26. B. K. Horn and B. G. Schunck, “Determining optical flow,” in Techniques and Applications of Image Understanding, vol. 0281 of Proceedings of SPIE, pp. 319–331, 1981. View at Publisher · View at Google Scholar
  27. A. K. Jain, “Data clustering: 50 years beyond K-means,” Pattern Recognition Letters, vol. 31, no. 8, pp. 651–666, 2010. View at Publisher · View at Google Scholar · View at Scopus
  28. M. H. Hansen and B. Yu, “Model selection and the principle of minimum description length,” Journal of the American Statistical Association, vol. 96, no. 454, pp. 746–774, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  29. J. Han, M. Kamber, and J. Pei, Data Mining: Concepts and Techniques, Morgan Karfmann, 2006.
  30. S. Ray and R. H. Turi, “Determination of number of clusters in k-means clustering and application in colour image segmentation,” 1999, http://www.csse.monash.edu.au/~roset/papers/cal99.pdf.
  31. Z. Volkovich, G.-W. Weber, R. Avros, and O. Yahalom, “On an adjacency cluster merit approach,” International Journal of Operational Research, vol. 13, no. 3, pp. 239–255, 2012. View at Publisher · View at Google Scholar · View at Scopus
  32. Z. Volkovich, Z. Barzily, G.-W. Weber, D. Toledano-Kitai, and R. Avros, “Resampling approach for cluster model selection,” Machine Learning, vol. 85, no. 1-2, pp. 209–248, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  33. J. Besag, “On the statistical analysis of dirty pictures,” Journal of the Royal Statistical Society, vol. 48, no. 3, pp. 259–302, 1986. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  34. S. Geman and D. Geman, “Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 6, no. 6, pp. 721–741, 1984. View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  35. Y. Boykov and V. Kolmogorov, “An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 26, no. 9, pp. 1124–1137, 2004. View at Publisher · View at Google Scholar · View at Scopus
  36. S. C. Zhu and A. Yuille, “Region competition: unifying snakes, region growing, and bayes/mdl for multiband image segmentation,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 18, no. 9, pp. 884–900, 1996. View at Publisher · View at Google Scholar · View at Scopus
  37. L. Patino, “Fuzzy relations applied to minimize over segmentation in watershed algorithms,” Pattern Recognition Letters, vol. 26, no. 6, pp. 819–828, 2005. View at Publisher · View at Google Scholar · View at Scopus