A new algorithm for monochromatic image compression

This paper presents a new algorithm for image compression which makes use of a variation of the run-length encoding and Huffman codes. This algorithm was tested on monochromatic images of letters and documents. A comparative study with other compression methods is presented. In the best case, our algorithm is almost 53% more efficient than the version of the Lempel-Ziv-Welch algorithm used in GIF files.