.png){kind=icon}
.png){kind=icon}
Return
Patch-based fuzzy clustering for image segmentation
.png){kind=icon}
PRE
AI
DOI：10.1007/s00500-017-2955-2.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Fuzzy C-means has been adopted for image segmentation, but it is sensitive to noise and other image artifacts due to not considering neighbor information. In order to solve this problem, many improved algorithms have been proposed, such as fuzzy local information C-means clustering algorithm (FLICM). However, the segmentation results of FLICM are unsatisfactory when performed on complex images. To overcome this, a novel fuzzy clustering algorithm is proposed in this paper, and more information is utilized to guide the procedure of image segmentation. In the proposed algorithm, pixel relevance based on patch similarity will be investigated firstly, by which all information over the whole image can be considered, not limited to local context. Compared with Zhang et al. (Multimed Tools Appl 76(6):7869-7895, 2017a. 10.1007/s11042-016-3399-x) pixel relevance is unnecessary to be normalized, and much more information can play positive role in image segmentation. Experimental results show that the proposed algorithm outperforms current fuzzy algorithms, especially in enhancing the robustness of corresponding fuzzy clustering algorithms.
Keywords:
Image segmentation
Fuzzy clustering
FLICM
Pixel relevance
Patch similarity
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.