![Sample our Computer Science journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5928/TOC-Subject-Sample-2021-Computer-Science.jpg"})
Abstract
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.
Acknowledgements
The motion images used in the numerical experiments were provided by Meiah Entertainment Ltd, Hong Kong, China. The numerical tests were performed at the School of Computing and Mathematical Sciences, University of Greenwich, during a visit by the first author. This work was partially supported by Provincial Natural Science Funding, Fujian, China, under Grant No. A0510005, and by Fuzhou University, China, under Grant No. 2005-XQ-16.