Abstract
G-images refer to image data defined on irregular graph domains. This article elaborates on a similarity-preserving Fuzzy C-Means (FCM) algorithm for G-image segmentation and aims to develop techniques and tools for segmenting G-images. To preserve the membership similarity between an arbitrary image pixel and its neighbors, a Kullback-Leibler divergence term on partition matrix is introduced as a part of FCM. As a result, similarity-preserving FCM is developed by considering spatial information of image pixels for its robustness enhancement. Due to superior characteristics of a wavelet space, the proposed FCM is performed in this space rather than the Euclidean one used in conventional FCM to secure its high robustness. Experiments on synthetic and real-world G-images demonstrate that it indeed achieves higher robustness and performance than the state-of-the-art segmentation algorithms. Moreover, it requires less computation than most of them.
Original language | English (US) |
---|---|
Pages (from-to) | 3887-3898 |
Number of pages | 12 |
Journal | IEEE Transactions on Fuzzy Systems |
Volume | 29 |
Issue number | 12 |
DOIs | |
State | Published - Dec 1 2021 |
All Science Journal Classification (ASJC) codes
- Control and Systems Engineering
- Computational Theory and Mathematics
- Artificial Intelligence
- Applied Mathematics
Keywords
- Fuzzy C -Means (FCM)
- G-image segmentation
- similarity-preserving
- spatial information
- wavelet space