By Topic

Parallel Implementation of Fractal Image Compression in Web Service Environment

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)
Yan Fang ; Coll. of Comput. & Inf., Fujian Agric. & Forestry Univ., Fuzhou, China ; Hang Cheng ; MeiQing Wang

Fractal image compression algorithm has some problems, such as high computational complexity and long time consumption. In this paper the parallel implementation of fractal image compression algorithm in Web service environment is discussed. The experiments show this algorithm can greatly reduce the compression time and achieve a high speedup at the same quality of decompressed image. The proposed algorithm can achieve the speedup of about 500 times with a little loss of lenna image's PSNR and two node computers against fractal full search algorithm.

Published in:

Distributed Computing and Applications to Business, Engineering and Science (DCABES), 2011 Tenth International Symposium on

Date of Conference:

14-17 Oct. 2011