{"title":"Texture Analysis Using GMRF Model for Image Segmentation on Spectral Clustering","authors":"Jin Huazhong, Ke Min-yi, Yan Xiwei, Wan Fang","doi":"10.1109/ITCS.2010.22","DOIUrl":null,"url":null,"abstract":"Spectral clustering algorithms are newly developing technique in recent years. In this paper, we derive a new pairwise affinity function for spectral clustering based on a measure of texture features represented by Gaussian Markov Random Field (GMRF) model. This model is used to capture the statistical properties of the neighborhood at a pixel, and then pairwise affinities represented by it can cluster the pixels into coherent groups. Having obtained a local similarity measured by regions of coherent texture and brightness, we use the normalized cuts to find partitions of the image. Experimental results demonstrate that the proposed method is effective and robust for image segmentation.","PeriodicalId":340471,"journal":{"name":"2010 Second International Conference on Information Technology and Computer Science","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Second International Conference on Information Technology and Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITCS.2010.22","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
Spectral clustering algorithms are newly developing technique in recent years. In this paper, we derive a new pairwise affinity function for spectral clustering based on a measure of texture features represented by Gaussian Markov Random Field (GMRF) model. This model is used to capture the statistical properties of the neighborhood at a pixel, and then pairwise affinities represented by it can cluster the pixels into coherent groups. Having obtained a local similarity measured by regions of coherent texture and brightness, we use the normalized cuts to find partitions of the image. Experimental results demonstrate that the proposed method is effective and robust for image segmentation.