By Topic

Fractal Image Compression Based on Particle Swarm Optimization and Chaos Searching

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Vahdati, G. ; Comput. Eng. Dept., Islamic Azad Univ., Mashhad, Iran ; Yaghoobi, M. ; Akbarzadeh-T, M.R.

Fractal image compression explores the self-similarity property of a natural image and utilizes the partitioned iterated function system (PIFS) to encode it. This technique is of great interest both in theory and application. However, it is time-consuming in the encoding process and such drawback renders it impractical for real time applications. The time is mainly spent on the search for the best-match block in a large domain pool. In order to solve the high complexity of the conventional encoding scheme for fractal image compression, a Chaotic particle swarm optimization (CPSO), based on the characteristics of fractal and partitioned iterated function system (PIFS) is proposed in this paper. Simulations show that the encoding time of our method is over 125 times faster than that of the full search method, while the retrieved Lena image quality is still acceptable.

Published in:

Computational Intelligence and Communication Networks (CICN), 2010 International Conference on

Date of Conference:

26-28 Nov. 2010