Two-level context based compression of binary images

Variable order models coupled to an arithmetic coder have proved a successful paradigm for text compression. The author explores the usefulness of a similar scheme for binary images. An algorithm due to Langdon and Rissanen (IEEE Trans. vol.COM-6, p.158-67 of 1981) is used as test bed for an experimental investigation, and with a two-level scheme based upon a conditioning context of 18 pixels a compression gain of about 20% can be achieved. Other experiments show that, for the test data used, this compression is at most about 30% inefficient.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>