Lossless Text Image Compression using Two Dimensional Run Length Encoding

Hilal H Nuha

doi:10.15575/join.v4i2.330

Lossless Text Image Compression using Two Dimensional Run Length Encoding

Authors

Hilal H Nuha Telkom University, Indonesia http://orcid.org/0000-0002-3018-6788

DOI:

https://doi.org/10.15575/join.v4i2.330

Keywords:

Lossless compression, Huffman Encoding, Run-length Encoding, Text Image

Abstract

Text images are used in many types of conventional data communication where texts are not directly represented by digital character such as ASCII but represented by an image, for instance facsimile file or scanned documents. We propose a combination of Run Length Encoding (RLE) and Huffman coding for two dimensional binary image compression namely 2DRLE. Firstly, each row in an image is read sequentially. Each consecutive recurring row is kept once and the number of occurrences is stored. Secondly, the same procedure is performed column-wise to the image produced by the first stage to obtain an image without consecutive recurring row and column. The image from the last stage is then compressed using Huffman coding. The experiment shows that the 2DRLE achieves a higher compression ratio than conventional Huffman coding for image by achieving more than 8:1 of compression ratio without any distortion.

References

M. Hart, "The history and philosophy of Project Gutenberg," in Project Gutenberg, Project Gutenberg, 1992, pp. 1-11.

Broder, Andrei and M. Mitzenmacher, "Pattern-based compression of text images," in Proceedings of Data Compression Conference-DCC'96, Snowbird, 1996.

M. D. Reavy and C. G. Boncelet, "An algorithm for compression of bilevel images," IEEE Transactions on Image Processing, vol. 10, no. 5, pp. 669-676, 2001.

Y. Ye and P. Cosman, "Dictionary design for text image compression with JBIG2," IEEE Transactions on Image Processing, vol. 10, no. 6, pp. 818-828, 2001.

M. Reyes, X. Zhao, D. Neuhoff and T. Pappas, "Lossy compression of bilevel images based on Markov random fields," in IEEE International Conference on Image Processing Vol. 2, San Antonio, 2007.

Y. Guo, C. Lu, J. Allebach and C. Bouman, "Model-based iterative restoration for binary document image compression with dictionary learning," in IEEE Conference on Computer Vision and Pattern Recognition, Honolulu, 2017.

E. L. Hauck, "Data compression using run length encoding and statistical encoding". U.S. Patent Patent 4,626,829, 2 December 1986.

V. Watson, "Run-length encoding". US Patent Patent 10/143,542., 24 July 2003.

Downloads

Published

2020-02-14

Issue

Vol. 4 No. 2 (2019)

Section

Article

Citation Check

License

You are free to:

Share — copy and redistribute the material in any medium or format for any purpose, even commercially.
The licensor cannot revoke these freedoms as long as you follow the license terms.

Under the following terms:

Attribution — You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
NoDerivatives — If you remix, transform, or build upon the material, you may not distribute the modified material.
No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.

Notices:

You do not have to comply with the license for elements of the material in the public domain or where your use is permitted by an applicable exception or limitation.
No warranties are given. The license may not give you all of the permissions necessary for your intended use. For example, other rights such as publicity, privacy, or moral rights may limit how you use the material.

This work is licensed under a Creative Commons Attribution-NoDerivatives 4.0 International License