Indexed by:
Abstract:
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.
Keyword:
Reprint 's Address:
Email:
Version:
Source :
2011 TENTH INTERNATIONAL SYMPOSIUM ON DISTRIBUTED COMPUTING AND APPLICATIONS TO BUSINESS, ENGINEERING AND SCIENCE (DCABES)
Year: 2011
Page: 59-63
Language: English
Cited Count:
SCOPUS Cited Count:
ESI Highly Cited Papers on the List: 0 Unfold All
WanFang Cited Count:
Chinese Cited Count:
30 Days PV: 1
Affiliated Colleges: