A new rectangular partitioning based lossless binary image compression scheme

In this paper, we propose a lossless binary image compression scheme that can achieve high compression ratio via partitioning the black regions (one\´s) of the input image into rectangles. After partitioning, the top-left and the bottom-right vertices of each rectangle are identified and the coordinates of which are efficiently coded. Three different routines are used in this research. The proposed scheme is targeting images, which contain graphs and tables with solid gridlines in the background on the one hand. While on the other hand it is suitable for text images of languages where many characters have dots "nuqta " on them such as Urdu, Persian, and Arabic with big fonts. The proposed scheme has outperformed CCITT run length coding, modified READ, and REC significantly. Also it is faster and simpler to implement than the method reported in A. Quddus et al (1999)