Fuzzy C-Means Image Segmentation Algorithm Based on Chaotic Simulated Annealing

Article Preview

Abstract:

Considering the problem that the traditional fuzzy c-means (FCM) image segmentation algorithm is often caught in a specific range in local search and fails to get the globally optimal solution, this paper proposed a modified FCM algorithm based on chaotic simulated annealing (CSA). It traverse all the states without repetition within a certain range to calculate the optimal solution. Experimental results show that our method converges more quickly and accurately to the global optimal and proves a promise global optimization method of high adaptability and feasibility.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

536-539

Citation:

Online since:

August 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] D.L. Pham, J. L: IEEE Transactions on Medical Imaging, Vol. 18 (1999) No. 9, p.737–752.

Google Scholar

[2] Ding V Z, Sun J, Zang Y: International journal on computer and communication, Vol. 2 (2013) No. 1.

Google Scholar

[3] Jin L, Fu M: International Conference on IEEE, (2011), pp.5440-5443.

Google Scholar

[4] Caldairou B, Passat N, Habas P A, et al: Pattern Recognition, Vol. 44 (2011) No. 9, p.1916-(1927).

DOI: 10.1016/j.patcog.2010.06.006

Google Scholar

[5] Wang L, Smith K: Neural Networks, IEEE Transactions on, Vol. 9 (1998) No. 4, pp.716-718.

Google Scholar

[6] He Y: Neural Networks, IEEE Transactions on, Vol. 13 (2002) No. 6, pp.1526-1531.

Google Scholar