Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/15773
Title: Significantly Fast and Robust Fuzzy C-Means Clustering Algorithm Based on Morphological Reconstruction and Membership Filtering
Authors: Jia, X
Zhang, Y
He, L
Meng, H
Nandi, A
Keywords: Image segmentation;Fuzzy c-means clustering;Local spatial information;Morphological reconstruction
Issue Date: 23-Jan-2018
Publisher: IEEE
Citation: Lei, T. et al. (2018) 'Significantly Fast and Robust Fuzzy C-Means Clustering Algorithm Based on Morphological Reconstruction and Membership Filtering', IEEE Transactions on Fuzzy Systems, 26(5), pp. 3027-3041. doi: 10.1109/TFUZZ.2018.2796074.
Abstract: As fuzzy c-means clustering (FCM) algorithm is sensitive to noise, local spatial information is often introduced to an objective function to improve the robustness of the FCM algorithm for image segmentation. However, the introduction of local spatial information often leads to a high computational complexity, arising out of an iterative calculation of the distance between pixels within local spatial neighbors and clustering centers. To address this issue, an improved FCM algorithm based on morphological reconstruction and membership filtering (FRFCM) that is significantly faster and more robust than FCM, is proposed in this paper. Firstly, the local spatial information of images is incorporated into FRFCM by introducing morphological reconstruction operation to guarantee noise-immunity and image detail-preservation. Secondly, the modification of membership partition, based on the distance between pixels within local spatial neighbors and clustering centers, is replaced by local membership filtering that depends only on the spatial neighbors of membership partition. Compared to state-of-theart algorithms, the proposed FRFCM algorithm is simpler and significantly faster, since it is unnecessary to compute the distance between pixels within local spatial neighbors and clustering centers. In addition, it is efficient for noisy image segmentation because membership filtering are able to improve membership partition matrix efficiently. Experiments performed on synthetic and real-world images demonstrate that the proposed algorithm not only achieves better results, but also requires less time than state-of-the-art algorithms for image segmentation.
URI: https://bura.brunel.ac.uk/handle/2438/15773
ISSN: 1063-6706
Appears in Collections:Dept of Mechanical and Aerospace Engineering Research Papers

Files in This Item:
File Description SizeFormat 
FullText.pdfCopyright © 2018 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. See: https://journals.ieeeauthorcenter.ieee.org/become-an-ieee-journal-author/publishing-ethics/guidelines-and-policies/post-publication-policies/5.05 MBAdobe PDFView/Open


Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.