We propose a coding algorithm for lossy compression of digital halftones produced by clustered-dot dithering. Our scheme is based on pixel ordering and run-length coding, and has small memory and computation requirements. Data reduction techniques give an efficient, but imperfect, representation of the run lengths, allowing low-rate coding along with a good approximation to the original dot structure. Experiments with 1024/spl times/1024 images, 8/spl times/8 dithering cells, and 600 dpi printing have shown that the algorithm maintains good image quality while achieving rates of about 0.1 bits per pixel.<>
Lossy compression of clustered-dot halftones
Proceedings of 1st International Conference on Image Processing ; 3 ; 836-840 vol.3
1994-01-01
430793 byte
Conference paper
Electronic Resource
English
Lossy Compression of Clustered-Dot Halftones
British Library Conference Proceedings | 1994
|Misregistration sensitivity in clustered-dot color halftones
British Library Online Contents | 2008
|British Library Online Contents | 2014
|Efficient transmission of halftones via facsimile
British Library Online Contents | 1996
|Tone-dependent noise model for high-quality halftones
British Library Online Contents | 2013
|