Gaussian mixture model based on hidden Markov random field for color image segmentation

3Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Gaussian Mixture Model (GMM) has been widely applied in image segmentation. However, the pixels themselves are considered independent of each other, making the segmentation result sensitive to noise. To overcome this problem for the segmentation process we propose a mixture model useing Markov Random Filed (MRF) that aims to incorporate spatial relationship among neighborhood pixels into the GMM. The proposed model has a simplified structure that allows the Expectation Maximization (EM) algorithm to be directly applied to the log-likelihood function to compute the optimum parameters of the mixture model. The experimental results show that our method has more advantage in image segmentation than other methods in terms of accuracy and quality of segmented image, and simple performance. © Springer-Verlag Berlin Heidelberg 2014.

Cite

CITATION STYLE

APA

Tran, K. A., Vo, N. Q., Nguyen, T. T., & Lee, G. (2014). Gaussian mixture model based on hidden Markov random field for color image segmentation. In Lecture Notes in Electrical Engineering (Vol. 280 LNEE, pp. 189–197). Springer Verlag. https://doi.org/10.1007/978-3-642-41671-2_25

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free