4.6 Article

Kullback-Leibler Divergence-Based Fuzzy C-Means Clustering Incorporating Morphological Reconstruction and Wavelet Frames for Image Segmentation

Journal

IEEE TRANSACTIONS ON CYBERNETICS
Volume 52, Issue 8, Pages 7612-7623

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TCYB.2021.3099503

Keywords

Image reconstruction; Image segmentation; Wavelet transforms; Clustering algorithms; Partitioning algorithms; Linear programming; Prototypes; Fuzzy C-means (FCMs); image segmentation; Kullback-Leibler divergence; morphological reconstruction (MR); wavelet frame

Funding

  1. China National Postdoctoral Program for Innovative Talents [BX2021249]
  2. National Natural Science Foundation of China [61873342, 61672400, 62076189]
  3. Recruitment Program of Global Experts
  4. Science and Technology Development Fund, MSAR [0012/2019/A1]

Ask authors/readers for more resources

This article introduces a Fuzzy C-Means (FCM) algorithm based on KL divergence, incorporating tight wavelet frame transform and morphological reconstruction. By introducing a KL divergence term on the partition matrix to make membership degrees closer, the algorithm improves image segmentation accuracy. Experimental results show that the proposed algorithm outperforms its peers in synthetic, medical, and real-world image segmentation, while also being faster than most FCM-related algorithms.
In this article, we elaborate on a Kullback-Leibler (KL) divergence-based Fuzzy C-Means (FCM) algorithm by incorporating a tight wavelet frame transform and morphological reconstruction (MR). To make membership degrees of each image pixel closer to those of its neighbors, a KL divergence term on the partition matrix is introduced as a part of FCM, thus resulting in KL divergence-based FCM. To make the proposed FCM robust, a filtered term is augmented in its objective function, where MR is used for image filtering. Since tight wavelet frames provide redundant representations of images, the proposed FCM is performed in a feature space constructed by tight wavelet frame decomposition. To further improve its segmentation accuracy (SA), a segmented feature set is reconstructed by minimizing the inverse process of its objective function. Each reconstructed feature is reassigned to the closest prototype, thus modifying abnormal features produced in the reconstruction process. Moreover, a segmented image is reconstructed by using tight wavelet frame reconstruction. Finally, supporting experiments coping with synthetic, medical, and real-world images are reported. The experimental results exhibit that the proposed algorithm works well and comes with better segmentation performance than other peers. In a quantitative fashion, its average SA improvements over its peers are 4.06%, 3.94%, and 4.41%, respectively, when segmenting synthetic, medical, and real-world images. Moreover, the proposed algorithm requires less time than most of the FCM-related algorithms.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available