DocumentCode
2290132
Title
Texture image segmentation based on spectral clustering ensemble via Markov random field
Author
Liu, BingXiang ; Jia, Jianhua
Author_Institution
Sch. of Inf. Eng., Jingdezhen Ceramic Inst., Jingdezhen, China
Volume
1
fYear
2011
fDate
10-12 June 2011
Firstpage
550
Lastpage
554
Abstract
Image segmentation is a fundamental problem in computer vision. Recently, ensemble learning receives more and more attention for its robustness, novelty and stability. Generally there are two problems in ensemble learning. One is the generation of the individuals of ensemble. The other is the consensus function of the individuals. We focus on the second problem. A new consensus function is proposed for texture images segmentation. To the consensus function, the spatial information of image, that means the adjacent pixels belong to the same class with a high probability, are considered via MRF. Expectation Maximum (EM) algorithm is applied to estimate the parameters of the model and converges fast. The experimental results show that the performance of our model is better than SC using Nyström method and the SCE via mixture model proposed by Topchy for image segmentation.
Keywords
Markov processes; computer vision; expectation-maximisation algorithm; image segmentation; image texture; pattern clustering; Markov random field; Nyström method; computer vision; consensus function; expectation maximum algorithm; mixture model; spatial information; spectral clustering; texture image segmentation; Clustering algorithms; Computational modeling; Feature extraction; Image segmentation; Pattern analysis; Pixel; Markov Random Model (MRF); image segmentation; spectral clustering; unsupervised ensemble;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Science and Automation Engineering (CSAE), 2011 IEEE International Conference on
Conference_Location
Shanghai
Print_ISBN
978-1-4244-8727-1
Type
conf
DOI
10.1109/CSAE.2011.5953280
Filename
5953280
Link To Document