Using Triangular Function To Improve Size Of Population In Quantum Evolution Algorithm For Fractal Image Compression

Fractal Image Compression is a well-known problem which is in the class of NP-Hard problems. Quantum Evolutionary Algorithm is a novel optimization algorithm which uses a probabilistic representation for solutions and is highly suitable for combinatorial problems like Knapsack problem. Genetic algorithms are widely used for fractal image compression problems, but QEA is not used for this kind of problems yet. This paper improves QEA whit change population size and used it in fractal image compression. Utilizing the self-similarity property of a natural image, the partitioned iterated function system (PIFS) will be found to encode an image through Quantum Evolutionary Algorithm (QEA) method Experimental results show that our method has a better performance than GA and conventional fractal image compression algorithms.

[1]  Yang Xuan,et al.  An improved genetic algorithm of solving IFS code of fractal image , 1996, Proceedings of Third International Conference on Signal Processing (ICSP'96).

[2]  Arnaud E. Jacquin,et al.  Image coding based on a fractal theory of iterated contractive image transformations , 1992, IEEE Trans. Image Process..

[3]  Ming-Sheng Wu,et al.  Schema genetic algorithm for fractal image compression , 2007, Eng. Appl. Artif. Intell..

[4]  Jong-Hwan Kim,et al.  Quantum-inspired evolutionary algorithm for a class of combinatorial optimization , 2002, IEEE Trans. Evol. Comput..

[5]  V. K. Koumousis,et al.  A saw-tooth genetic algorithm combining the effects of variable population size and reinitialization to enhance performance , 2006, IEEE Transactions on Evolutionary Computation.

[6]  Ming-Sheng Wu,et al.  Spatial correlation genetic algorithm for fractal image compression , 2006 .

[7]  Qin Jun,et al.  A novel dynamic population based evolutionary algorithm for revised multimodal function optimization problem , 2004, Fifth World Congress on Intelligent Control and Automation (IEEE Cat. No.04EX788).

[8]  Y. Fisher.  Fractal image compression: theory and application , 1995 .

[9]  Suman K. Mitra,et al.  Technique for fractal image compression using genetic algorithm , 1998, IEEE Trans. Image Process..

[10]  Lyman P. Hurd,et al.  Fractal image compression , 1993 .

[11]  M. Barnsley,et al.  Iterated function systems and the global construction of fractals , 1985, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[12]  Lifeng Xi,et al.  A Study of Fractal Image Compression Based on an Improved Genetic Algorithm , 2007 .

[13]  M. Barnsley,et al.  Recurrent iterated function systems , 1989 .

[14]  Li Wang,et al.  A study on the optimal population size of genetic algorithm , 2002, Proceedings of the 4th World Congress on Intelligent Control and Automation (Cat. No.02EX527).

[15]  Faraoun Kamel Mohamed,et al.  Speeding Up Fractal Image Compression by Genetic Algorithms , 2005 .

[16]  David Zhang,et al.  Hybrid image coding based on partial fractal mapping , 2000, Signal Process. Image Commun..

[17]  Ahmed Lehireche,et al.  Genetic fractal image compression , 2003 .

[18]  Lu Xun,et al.  The application of GA in fractal image compression , 2000, Proceedings of the 3rd World Congress on Intelligent Control and Automation (Cat. No.00EX393).

[19]  Xiao Chen,et al.  Fractal image coding method based on genetic algorithms , 1998, Other Conferences.