Particle Competitive Mechanism-Based Multi-objective Rough Clustering Algorithm for Image Segmentation

Feng Zhao ◽  
Lulu Cao ◽  
Hanqiang Liu ◽  
Zihan Tang ◽  
Jiulun Fan
2013 ◽  
Vol 791-793 ◽  
pp. 1337-1340
Xue Zhang Zhao ◽  
Ming Qi ◽  
Yong Yi Feng

Fuzzy kernel clustering algorithm is a combination of unsupervised clustering and fuzzy set of the concept of image segmentation techniques, But the algorithm is sensitive to initial value, to a large extent dependent on the initial clustering center of choice, and easy to converge to local minimum values, when used in image segmentation, membership of the calculation only consider the current pixel values in the image, and did not consider the relationship between neighborhood pixels, and so on segmentation contains noise image is not ideal. This paper puts forward an improved fuzzy kernel clustering image segmentation algorithm, the multi-objective problem, change the single objective problem to increase the secondary goals concerning membership functions, Then add the constraint information space; Finally, using spatial neighborhood pixels corrected membership degree of the current pixel. The experimental results show that the algorithm effectively avoids the algorithm converges to local extremism and the stagnation of the iterative process will appear problem, significantly lower iterative times, and has good robustness and adaptability.

Seyed Jalaleddin Mousavirad ◽  
Gerald Schaefer ◽  
Mahshid Helali Moghadam ◽  
Mehrdad Saadatmand ◽  
Mahdi Pedram

R. R. Gharieb ◽  
G. Gendy ◽  
H. Selim

In this paper, the standard hard C-means (HCM) clustering approach to image segmentation is modified by incorporating weighted membership Kullback–Leibler (KL) divergence and local data information into the HCM objective function. The membership KL divergence, used for fuzzification, measures the proximity between each cluster membership function of a pixel and the locally-smoothed value of the membership in the pixel vicinity. The fuzzification weight is a function of the pixel to cluster-centers distances. The used pixel to a cluster-center distance is composed of the original pixel data distance plus a fraction of the distance generated from the locally-smoothed pixel data. It is shown that the obtained membership function of a pixel is proportional to the locally-smoothed membership function of this pixel multiplied by an exponentially distributed function of the minus pixel distance relative to the minimum distance provided by the nearest cluster-center to the pixel. Therefore, since incorporating the locally-smoothed membership and data information in addition to the relative distance, which is more tolerant to additive noise than the absolute distance, the proposed algorithm has a threefold noise-handling process. The presented algorithm, named local data and membership KL divergence based fuzzy C-means (LDMKLFCM), is tested by synthetic and real-world noisy images and its results are compared with those of several FCM-based clustering algorithms.

Sign in / Sign up

Export Citation Format

Share Document