DocumentCode
2950557
Title
Constrained Markov Random Field Model for Color and Texture Image Segmentation
Author
Dey, Rahul ; Nanda, P.K. ; Panda, Sucheta
Author_Institution
Nat. Inst. of Technol., Rourkela
fYear
2008
fDate
4-6 Jan. 2008
Firstpage
317
Lastpage
322
Abstract
In this paper, the problem of color image segmentation is addressed as a pixel labeling problem. The observed color image is assumed to be the degraded version of the image labels. We have proposed a new Markov random field (MRF) model known as constrained MRF (CMRF) model to model the unknown image labels and Ohta (I1I2I3) model is used as the color model. The unique feature of the proposed CMRF model is found to posses a unifying feature of modeling scene and texture images as well. The labels are estimated using maximum a posteriori (MAP) estimation criterion. A hybrid algorithm is proposed to obtain the MAP estimate and the performance of the algorithm is found to be better than that of using simulated annealing (SA) algorithm. The performance of the proposed model is compared with JSEG method and the proposed model is found to be better than JSEG method.
Keywords
Markov processes; image colour analysis; image segmentation; image texture; simulated annealing; color segmentation; constrained Markov random field model; maximum a posteriori estimation criterion; pixel labeling problem; simulated annealing algorithm; texture image segmentation; Color; Degradation; Hidden Markov models; Image converters; Image segmentation; Labeling; Layout; Markov random fields; Pixel; Signal processing algorithms;
fLanguage
English
Publisher
ieee
Conference_Titel
Signal Processing, Communications and Networking, 2008. ICSCN '08. International Conference on
Conference_Location
Chennai
Print_ISBN
978-1-4244-1924-1
Electronic_ISBN
978-1-4244-1924-1
Type
conf
DOI
10.1109/ICSCN.2008.4447211
Filename
4447211
Link To Document