Markov Random Field Based Color Texture Segmentation
Sanjaykumar Kinge1, B Sheela Rani2, Mukul Sutaone3

1Sanjaykumar Kinge*, Research Scholar at Sathyabama University Chennai and Assistant Professor, Department of Electronics and Telecommunication, MIT College of Engineering Pune, India.
2B Sheela Rani*, Director Research at Sathyabama University, Chennai, India.
3Mukul Sutaone, Professor and Deputy Director College of Engineering Pune, India.
Manuscript received on January 02, 2020. | Revised Manuscript received on January 15, 2020. | Manuscript published on January 30, 2020. | PP: 1055-1060 | Volume-8 Issue-5, January 2020. | Retrieval Number: E6177018520/2020©BEIESP | DOI: 10.35940/ijrte.E6177.018520

Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (

Abstract: Texture segmentation is one of the popular research domains and researchers across the globe are working on texture segmentation to enhance segmentation performance to address its requirements in many fields. Color texture segmentation has wide spectrum of applications in diverse fields such as segmentation of natural images, medical image analysis, remote sensing, shape extraction and inspection of products etc. This paper presents color texture segmentation algorithm which can satisfy requirements for such applications. Proposed algorithm is based on Markov Random Field (MRF) model eliminating the need of major contributor viz. Gabor filter used in past four decades for feature extraction and use only color as texture feature. Highly crude segmentation results are produced using only color as texture features. Crude segmentation results are enhanced by using Median filter with enlarged window size quantitatively determined by using parameters viz. structural similarity index (SSIM), mean square error (MSE) and peak signal to noise ratio (PSNR). Feature space dimensions are reduced by factor of 11 in proposed approach and this reduced computations by a factor of 11. The experimentation is carried out on 80 multi-class color texture benchmark images from Prague texture segmentation dataset and 4 benchmark images in Vistex dataset. Mean segmentation accuracy achieved for Prague texture dataset is 87.55% and it is higher by 9.82% over the best performing algorithm among 11 state-of-art algorithms suggested in most recent literature. Accuracy achieved for Vistex dataset is 98.21%. Average SSIM for Prague dataset is 0.91403 and Vistex dataset is 0.9405.
Keywords: Median filter, Markov random Field, Peak signal to noise ratio, Structural Similarity Index, Texture database.
Scope of the Article: Approximation And Randomized Algorithms.