Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorDey, R-
dc.contributor.authorNanda, P K-
dc.contributor.authorPanda, S-
dc.identifier.citationInternational Conference on Signal Processing, Communications and Networking, 2008. ICSCN '08. 4-6 Jan. 2008, Anna Unviersity, Chennai, P 317-322en
dc.descriptionCopyright for the paper belongs to IEEEen
dc.description.abstractIn 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.en
dc.format.extent1927284 bytes-
dc.subjectMarkov processesen
dc.subjectimage colour analysisen
dc.subjectimage segmentationen
dc.subjectimage textureen
dc.subjectsimulated annealingen
dc.titleConstrained Markov Random Field Model for Color and Texture Image Segmentationen
Appears in Collections:Conference Papers

Files in This Item:
File Description SizeFormat 
pkn1.pdf1.88 MBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.