The Two Step Mutation Evolutionary Programming Using in Image Segmentation

Abstract:

Image segmentation is an important task in image analysis and processing. Many of the existing methods for segmenting a multi-component image (satellite or aerial) are very slow and require a priori knowledge of the image that could be difficult to obtain. Furthermore, the success of each of these methods depends on several factors, such as the characteristics of the acquired image, resolution limitations, intensity in-homogeneities and the percentage of imperfections induced by the process of image acquisition. Evolutionary programming(EP) has been applied with success to many numerical and combinatorial optimization problems in recent years. EP has rather slow convergence rates, however, on some function optimization problems. In this paper the new evolutionary programming is proposed to overcome the premature convergence. There are two step mutation in the new evolutionary programming. The first step is responsible for searching the whole space. The second is responsible for searching the local part in detail. The cooperation and specialization between different two step mutation are considered during the algorithm design. The new evolutionary programming can use in image segmentation and the experimental results show the new evolutionary programming is efficient.

• Periodical: Advanced Materials Research (Volumes 433-440)
• Pages: 5459-5462
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.433-440.5459
• Online since: January 2012
• Authors: Fang Liu
• Keywords: Evolutionary Programming, Image Segmation, Mutation Operation

References

[1] M. Awad, K. Chehdi, A. Nasri. Multi-component image segmentation using a hybrid dynamic genetic algorithm and fuzzy C-means. IET Image Process., 2009, Vol. 3, Iss. 2, pp.52-66.

DOI: 10.1049/iet-ipr.2007.0213

[2] Stelios Krinidis and Vassilios Chatzis, A Robust Fuzzy Local Information C-Means Clustering Algorithm, IEEE Trans. Image Process, 19( 5), 1328-1337( 2010).

DOI: 10.1109/tip.2010.2040763

[3] T. Bäck and H. -P. Schwefel, Evolutionary computation: An overview, in Proc. IEE Int. Conf. Evolutionary Computation, 1996, p.20–29.

[4] T. Bäck, U. Hammel, and H. -P. Schwefel, Evolutionary computation: Comments on the history and current state, IEEE Trans. Evol. Comput, vol. 1, no. 1, p.3–17, (1997).

DOI: 10.1109/4235.585888

[5] T. B¨ack and H. -P. Schwefel, An overview of evolutionary algorithms for parameter optimization, Evol. Comput, vol. 1, no. 1, p.1–23, (1993).

[6] D. B. Fogel, Evolutionary Computation: Toward a New Philosophy of Machine Intelligence. Piscataway, NJ: IEEE Press, (1995).

[7] D. Fogel, Evolutionary Computation. Piscataway, NJ: IEEE Press, (1995).

[8] L. J. Fogel, A. J. Owens, and M. J. Walsh, Artificial Intelligence through Simulated Evolution. New York: Wiley, (1966).

[9] L. J. Fogel, Intelligence through Simulated Evolution: Forty Years of Evolutionary Programming. New York: Wiley, (1999).

[10] B. L. Wu and X. H. Yu, Enhanced evolutionary programming for function optimization, in Proc. IEE Int. Conf. Evolutionary Computation, 1998, p.695–698.

[11] J. H. Kim, H. K. Chae, J. Y. Jeon, and S. W. Lee, Identification and control of systems with friction using accelerated evolutionary programming, IEEE Contr. Syst., p.38–47, (1997).

[12] M. T. Hagan, H. B. Demuth, and M. Beale, Neural Network Design: PWS, (1996).

[13] Z. Michalewicz, Genetic Algorithms + Data Structures = Evolutionary Programs, 3rd ed. New York: Springer-Verlag, (1996).

[14] Aguilar, Jose; The Evolutionary Programming in the Identification of Discreet Events Dynamic Systems Latin America Transactions, IEEE (Revista IEEE America Latina) Issue Date:  Sept. 2007 Volume : 5 ,  Issue: 5 On page(s): 301 - 310.

DOI: 10.1109/tla.2007.4378522