IJWMT Vol. 2, No. 4, 15 Aug. 2012
Cover page and Table of Contents: PDF (size: 393KB)
Full Text (PDF, 393KB), PP.59-64
Views: 0 Downloads: 0
HMRF, semi-supervised, MeanShift, clustering, K-Means
The paper proposed a modified color image segmentation method basing on semi-supervised hidden Markov random fields (HMRF) with constraints. Making use of MeanShift algorithm to get supervision information and, cluster number and initial values for cluster centroids, color images can be segmented effectively with the method in this paper by K-Means algorithm. The experimental results are very encouraging.
Wei Hongru,Chai Fangyong,"A modified semi-supervised color image segmentation method", IJWMT, vol.2, no.4, pp.59-64, 2012. DOI: 10.5815/ijwmt.2012. 04.09
[1]D. Comaniciu, 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, May 2002, doi:10.1109/34.1000236
[2]S. Basu, M. Bilenko, and R. J. Mooney. A probabilistic framework for semi- supervised clustering, In Proceedings of the tenth ACM SIGKDD international conference on knowledge discovery and data mining, pages 59–68, Seattle, WA, 2004b.
[3]Olivier Chapelle, Bernhard Schölkopf, and AlexanderZien. Semi-Supervised Learning, MIT Press, 2006.
[4]A. P. Dempster, N. M. Laird, and D. B. Rubin. Maximum likelihood from incomplete data via the EM algorithm. JRSSB, 39:1–38, 1977.
[5]D. Martin and C. Fowlkes and D. Tal and J. Malik. A Database of Human Segmented Natural Images and its Application to Evaluating Segmentation Algorithms and Measuring Ecological Statistics,Vol. 2,pp. 416--423 ,July 2001, ICCV 2001.
[6]Arindam Banerjee, Srujana Merugu, Inderjit S. Dhillon, Joydeep Ghosh. Clustering with Bregman Divergences 6(Oct):1705--1749, 2005.