BINARY IMAGE COMPRESSION USING EFFICIENT PARTITIONING INTO RECTANGULAR REGIONS

In this paper, a new binary image coding technique is presented, In th e new technique, the black regions in the input image are first partit ioned into a number of nonoverlapping rectangles. The partitioning can be achieved using one of two different algorithms. The first algorith m can partition the input image into the minimum number of nonoverlapp ing rectangles at the expense of complex implementation, The second al gorithm gives a near optimal partitioning with very simple implementat ion, After the black regions of the input image are partitioned into r ectangles, the coordinates of two opposite vertices of each rectangle are compressed using a simple procedure that allows the decoder to rec onstruct the original image, Test images of different types, sizes, an d complexities are used to demonstrate the improvement of the new tech nique over the other currently available binary image compression tech niques.