Journal of Xidian University

Previous Articles     Next Articles

Neutrosophic fuzzy clustering segmentation algorithm based on HMRF

WU Chengmao;SHANGGUAN Ruoyu   

  1. (School of Electronic Engineering , Xi'an Univ. of Posts and Telecommunications, Xi'an 710121,China)
  • Received:2016-12-30 Online:2017-12-20 Published:2018-01-18
  • Supported by:

    国家自然科学基金重点资助项目(61136002);陕西省自然科学基金资助项目(2014JM8331,2014JQ5183,2014JM8307);陕西省教育厅科学研究计划资助项目(2015JK1654)

Abstract:

Considering neutrosophic C-means clustering algorithm with weak ability of suppressing noise, a neutrosophic C-means clustering segmentation algorithm based on the hidden Markov random field is proposed. First, the hidden Markov random field is used to describe the prior information of the arbitrary pixels classification. Second, information divergence between the prior information and sample classification membership is taken as a regular term and embedded into the existing neutrosophic C-means clustering objective function. Third, the samples in the European Space is mapped into the high-dimensional space through the kernel function, and the iterative expression for the neutrosophic C-means clustering segmentation algorithm based on the hidden Markov random field is obtained by the optimization method. Many standard, actual, and synthetic images corrupted by noise are used to validate the segmentation performance of the improved clustering segmentation algorithm. Experimental results show that the anti-noise performance of the proposed segmentation algorithm is improved significantly than the fuzzy C-means clustering algorithm based on the hidden Markov random field, and other fuzzy clustering segmentation algorithms.

Key words: image segmentation, fuzzy clustering, neutrosophic C-means clustering, hidden Markov random field, kernel function