An Efficient Unsupervised MRF Image Clustering Method
- Cite this paper as:
- Hou Y., Guo L., Lun X. (2006) An Efficient Unsupervised MRF Image Clustering Method. In: Gabrys B., Howlett R.J., Jain L.C. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2006. Lecture Notes in Computer Science, vol 4252. Springer, Berlin, Heidelberg
On the basis of Markov Random Field (MRF), which uses context information, in this paper, a robust image segmentation method is proposed. The relationship between observed pixel intensities and distance between pixels are introduced to the traditional neighbourhood potential function, which described the probability of pixels being classified into one class. To perform an unsupervised segmentation, the Bayes Information Criterion (BIC) is used to determine the class number. The K-means is employed to initialise the classification and calculate the mean values and variances of the classes. The segmentation is transformed to maximize a posteriori (MAP) procedure. Then, the Iterative Conditional Model (ICM) is employed to solve the MAP problem. In the experiments, the proposed method is adopted with K-means, traditional Expectation-Maximization (EM) and MRF image segmentation techniques, for noisy image segmentation applying on synthetic and real images. The experiment results and the histogram of signal to noise ratio (SNR)-miss classification ratio (MCR) showed that the proposed algorithm is the better choice.
Unable to display preview. Download preview PDF.