A new efficient algorithm for lossless binary image compression

Binary image compression is desirable for a wide range of applications, such as digital libraries, map archives, fingerprint databases, facsimile, etc. In this paper, we present a new highly efficient algorithm for lossless binary image compression. The proposed algorithm introduces a new method, Direct Redundancy Elimination, to efficiently exploit the two-dimensional redundancy of an image, as well as a novel Dynamic Context Model to improve the efficiency of arithmetic coding. Simulation results show that the proposed algorithm has comparable compression ratio to JBIG standard. In many cases, the proposed algorithm outperforms the JBIG standard.