Binary text image compression using overlapping rectangular partitioning

In this paper a new lossless binary text image coding technique based on ov erlapping partitioning is presented. In this technique, the black regions i n the image are first partitioned into a number of overlapping and nonoverl apping rectangles. This partitioning algorithm gives, in general, fewer rec tangles than those obtained using nonoverlapping partitioning. After partit ioning, the two opposite vertices of each rectangle are compressed using a simple encoding technique. For binary text images (of different languages a nd fonts) the overlapping partitioning proposed here yields compression rat ios better than the nonoverlapping partitioning. In addition, the proposed sche me is suitable for texts consisting of different languages, fonts and sizes. (C) 1999 Elsevier Science B.V. All rights reserved.