Relative Distance Method for Lossless Image Compression on Parallel Architectures - A New Approach for Lossless Image Compression on GPU

Computer graphics and digital imaging have finally reached the goal of photorealism. This comes however with a huge cost in terms of memory and CPU needs. In this paper we present a lossless method for image compression using relative distances between pixel values belonging to separate and independent blocks. In our approach we try to reach a good balance between execution time and image compression rate. In a second step, by considering the parallel characteristics of this algorithm (and nonetheless the trend of multicore processor), a parallel version of this algorithm was implemented using Nvidia CUDA architecture.

[1]  James A. Storer,et al.  Lossless image compression using generalized LZ1-type methods , 1996, Proceedings of Data Compression Conference - DCC '96.

[2]  Jeffrey Scott Vitter,et al.  Parallel Lossless Image Compression Using Huffman and Arithmetic Coding , 1996, Inf. Process. Lett..

[3]  Marco Ferretti,et al.  A parallel pipelined implementation of LOCO-I for JPEG-LS , 1988, Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004..

[4]  Luigi Cinque,et al.  A Parallel Decoder for Lossless Image Compression by Block Matching , 2007, 2007 Data Compression Conference (DCC'07).

[5]  Abraham Lempel,et al.  A universal algorithm for sequential data compression , 1977, IEEE Trans. Inf. Theory.

[6]  Touradj Ebrahimi,et al.  The JPEG2000 still image coding system: an overview , 2000, IEEE Trans. Consumer Electron..

[7]  Jeff Gilchrist,et al.  Parallel Lossless Data Compression Based on the Burrows-Wheeler Transform , 2007, 21st International Conference on Advanced Information Networking and Applications (AINA '07).

[8]  Andrew Chi-Sing Leung,et al.  Discrete Wavelet Transform on Consumer-Level Graphics Hardware , 2007, IEEE Transactions on Multimedia.