Cart
Design of parallel algorithms for fractal video compression
- DOI:
- 10.1080/00207160601168456
pages 193-202
Available online: 21 May 2007Abstract
The intrinsic independent features of the optimal codebook cubes searching process in fractal video compression systems are examined and exploited. The design of a suitable parallel algorithm reflecting the concept is presented. The Message Passing Interface (MPI) is chosen to be the communication tool for the implementation of the parallel algorithm on distributed memory parallel computers. Experimental results show that the parallel algorithm is able to reduce the compression time and achieve a high speed-up without changing the compression ratio and the quality of the decompressed image. A scalability test was also performed, and the results show that this parallel algorithm is scalable.
Keywords
- Recommend to:
- A friend
First page preview
Details
- Citation information:
- Available online: 21 May 2007
Author affiliations
- a College of Mathematics and Computer Science, Fuzhou University, Fuzhou, Fujian, 350002, P.R. China
- b School of Computing and Mathematical Sciences, University of Greenwich, Old Royal Naval College, Park Row, Greenwich, London, SE10 9LS, UK
Librarians
- Librarians' area
- Pricing
- Institutional account
- Access entitlements
- Co-branding
- IP ranges
- Link resolver preferences
- Usage reports