A comparison of different evolutive niching strategies for identifying a set of selfsimilar contractions for the IFS inverse problem

• Autores: José Manuel Gutiérrez Llorente , María Laura Ivanissevich, Antonio Santiago Cofiño González
• Localización: Journal of Computer Science and Technology, ISSN-e 1666-6038, Vol. 1, Nº. 5, 2001 (Ejemplar dedicado a: Fifth Issue; 15 p.)
• Idioma: inglés
• Enlaces
  • Texto completo
• Resumen

  • The key problem in fractal image compression is that of obtaining the IFS code (a set of linear transformations)which approximates a given image with a certain prescribed accuracy (inverse IFS problem).In this paper,we analyze and compare the performance of sharing and crowding niching techniques for identifying optimal selfsimilar transformations likely to represent a selfsimilar area within the image. The best results are found using the deterministic crowding method.We also present an nteractive Matlab program implementing the algorithms described in the paper.The key problem in fractal image compression is that of obtaining the IFS code (a set of linear transformations)which approximates a given image with a certain prescribed accuracy (inverse IFS problem).In this paper,we analyze and compare the performance of sharing and crowding niching techniques for identifying optimal selfsimilar transformations likely to represent a selfsimilar area within the image. The best results are found using the deterministic crowding method.We also present an nteractive Matlab program implementing the algorithms described in the paper.

• Referencias bibliográficas
  • References [1] Abiko,T.,Kawamata,M.: IFS coding of non-homogeneous fractal images using Grobner basis. Proc. of the IEEE International Conference...
  • [2] Barnsley, M.F.: Fractals everywhere, second edition. Academic Press, 1990.
  • [3] Berkner, K.: A wavelet-based solution to the inverse problem for fractal interpolation functions ,inL.Vehel et al. editors. Fractals in...
  • [4] Evans, A.K. and Turner, M.J.: Specialization of evolutionar yalgorithms and data structures for the IFS inverse problem, in M.J. Turner...
  • [5] Fisher, Y.: Fractal Image Compression: Theor yand Application. SpringerVerlag, 1995.
  • [6] Goentzel, B.: Fractal image compression with the genetic algorithm. Complexity International 1, 111-126, 1994.
  • [7] Gutiérrez, J.M., Cofiño, A.S., and Ivanissevich, M.L. An Hybrid Evolutive–Genetic Strategy for the Inverse Fractal Problem of IFS Models....
  • [8] Gutiérrez, J.M., lglesias, A. ,Rodríguez, M.A. and Rodríguez, V.J.: Generating and Rendering Fractal Images . The Mathematica Journal...
  • [9] Holland, J.H.: Adaptation in natural and artificial systems. The University o Michigan Press, 1975.
  • [10] Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning, Addison Wesley, 1989.
  • [11] Lutton, E. et al.: Mixed IFS - resolution of the inverse problem using genetic programming. INRIA Rapport 2631, 1995.
  • [12] Mahfoud, S.W.: Crowding and preselection revisited, in Proc. PPSN-92, Elsevier, 1992.
  • [13] Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs, second edition, Springer-Verlag, 1994.
  • [14] Nettleton, D.J., Garigliano, R.: Evolutionar yalgorithms and a fractal inverse problem. Biosystems 33, 221-231, 1994.
  • [15] Rechenberg, I.: Evolution strategie: Optimierung technischer systeme nach prinzipien der biologischen evolution. Frommann-Holzboog Verlag,...
  • [16] Shonkwiler, R., Mendivil, F., Deliu, A.: Genetic algorithms for the 1-D fractal inverse problem. Proceedings of the Fourth International...
  • [17] Turner, M.J.andBlackledge, J.M., Andrews, P.R.: Fractal Geometr yin Digital Imaging. Academic Press, 1998.
  • [18] Yin, X. and Germay, N.: , A fast genetic algorithm with sharing scheme using cluster analysis methods in multimodal function optimization,...