The Improved Membership Matrix Initialization Method of FCM for Image Segmentation

Article Preview

Abstract:

The performance of FCM for image segmentation directly subjects to the initialized membership matrix. This paper proposed twice FCM method to solve the membership matrix initiation problem. The image is spared to a blurred image at first, and then uses the FCM for the blurred image to obtain an iterative result, in which the membership matrix is taken as the initialized membership function of the FCM for the original image processing. This method overcomes the random membership initialization method cannot convergence to the optimum point of the objective function of FCM for the image segmentation at some extend, furthermore, it can obtain better results than the traditional FCM method.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 989-994)

Pages:

3743-3746

Citation:

Online since:

July 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] GONG Xue-Jing, CI Lin-Lin, YAO Kang-ze. Split-merge algorithm of image based on Morton code [J]. Computer Engineering and Design. 2007, 28(22): 5440-5443.

DOI: 10.1109/icwapr.2007.4421576

Google Scholar

[2] TAN Qing, HE Qing, ZHAO Wei-Zhong, SHI Zhong-Zhi. Evolutionary programming based FCMBP fuzzy clustering method [J]. Systems Engineering-Theory& Practice, 2011, 31(7): 1363-1370.

Google Scholar

[3] YU Jian. On the Fuzziness Index of the FCM Algorithms [J]. Chinese Journal of Computers, 2003, 26(8): 968-973.

Google Scholar

[4] CHEN Song-Sheng, WANG Wei. Modified fast fuzzy C-means clustering algorithm [J]. Computer Engineering and Applications, 2007, 43(10): 167-169.

Google Scholar

[5] BeZedk J. C. Patter Recognition with fussy objective function algorithms [M]. New York, Plenum Press, (1981).

Google Scholar