Entropy constrained halftoning by tree coding

An entropy constraint is introduced into a tree coding halftoner, so that one can control the degree of compressibility of the bi-level output images. The algorithm essentially trades image quality with compressibility as indicated by rate distortion theory. We demonstrate that this algorithm can generate halftone images that are of higher quality than error diffusion, and yet are also more amenable to compression than error diffused images