A New Method Which Combines Arithmetic Coding with RLE for Lossless Image Compression
Med Karim Abdmouleh, Atef Masmoudi, Med Salim Bouhlel
DOI: 10.4236/jsea.2012.51007   PDF   HTML   XML   6,089 Downloads   10,986 Views   Citations


This paper presents a new method of lossless image compression. An image is characterized by homogeneous parts. The bit planes, which are of high weight are characterized by sequences of 0 and 1 are successive encoded with RLE, whereas the other bit planes are encoded by the arithmetic coding (AC) (static or adaptive model). By combining an AC (adaptive or static) with the RLE, a high degree of adaptation and compression efficiency is achieved. The proposed method is compared to both static and adaptive model. Experimental results, based on a set of 12 gray-level images, demonstrate that the proposed scheme gives mean compression ratio that are higher those compared to the conventional arithmetic encoders.

Share and Cite:

M. Abdmouleh, A. Masmoudi and M. Bouhlel, "A New Method Which Combines Arithmetic Coding with RLE for Lossless Image Compression," Journal of Software Engineering and Applications, Vol. 5 No. 1, 2012, pp. 41-44. doi: 10.4236/jsea.2012.51007.

Conflicts of Interest

The authors declare no conflicts of interest.


[1] S. Mahapatra, J. L. Nunez, C. Feregrino and S. Jones, “Parallel Implementation of a Multialphabet Arithmetic Coding Algorithm,” IEE Colloquium on Data Compression: Methods and Implementations, IEE Savoy Place, London, November 1999, pp. 91-95.
[2] M. Hai, J. Zhang and X. Ni, “An Improved Arithmetic Coding Algorithm,” Journal of Shanghai University (English Edition), Vol. 8, No. 4, 2004, pp. 455-457. doi:10.1007/s11741-004-0056-9
[3] A. Masmoudi, W. Puech and M. S. Bouhlel, “A New Joint Lossless Compression and Encryption Scheme Combining a Binary Arithmetic Coding with a Pseudo Random Bit Generator,” International Journal of Computer Science & Information Security, Vol. 8, No. 1, 2010, pp. 170-175.
[4] ISO/IEC FCD 15444-1, JPEG2000 Image Compression Standard, 1999.
[5] Joint Video Team JVT of ISO/IEC MPEG and ITU-T VCEG, Joint Committee Draft (CD), May 2002.
[6] P. G. Howard and J. S. Vitter, “New Methods for Lossless Image Compression Using Arithmetic Coding,” Information Processing & Management, Vol. 28, No. 6, 1992, pp. 765-779.
[7] P. G. Howard and J. S. Vitter, “Parallel Lossless Image Compression Using Huffman and Arithmetic Coding,” Information Processing Letters, Vol. 59, No. 2, 1996, pp. 65-73. doi:10.1016/0020-0190(96)00090-7
[8] B. Carpentieri, “A New Lossless Image Compression Algorithm Based on Arithmetic Coding,” Lecture Notes in Computer Science, Vol. 13, No. 11, 1997, pp. 54-61. doi:10.1007/3-540-63508-4_105
[9] P. G. Howard and J. S. Vitter, “Arithmetic Coding for Data Compression,” Proceedings of the IEEE, Vol. 82, No. 6, 1994, pp. 857-865. doi:10.1109/5.286189
[10] G. G. Langdon, “An Introduction to Arithmetic Coding,” IBM Journal of Research and Development, Vol. 28, No. 2, 1984, pp. 135-149. doi:10.1147/rd.282.0135
[11] A. Moffat, R. M. Neal and I. H. Witten, “Arithmetic Coding Revisited,” ACM Transactions on Information Systems, Vol. 16, No. 3, 1998, pp. 256-294.
[12] I. H. Witten, R. M. Neal and J. G. Cleary, “Arithmetic Coding for Data Compression,” Communications of the ACM, Vol. 30, No. 6, 1987, pp. 520-540.
[13] “The Waterloo Fractal Compression Project. Waterloo Repertoire Grey Set 2,” University of Waterloo, Ontario. http://links.uwaterloo.ca/Repository.html

Copyright © 2022 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.