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.<>


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Lossy compression of clustered-dot halftones


    Contributors:


    Publication date :

    1994-01-01


    Size :

    430793 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Lossy Compression of Clustered-Dot Halftones

    Vander Kam, R. A. / Gray, R. M. / IEEE; Signal Processing Society | British Library Conference Proceedings | 1994


    Misregistration sensitivity in clustered-dot color halftones

    Oztan, B. / Sharma, G. / Loce, R.P. | British Library Online Contents | 2008


    Parametrically controlled stochastically seeded clustered halftones: design strategies and applications

    Bernal, E.A. / Loce, R.P. / Wang, S.-G. et al. | British Library Online Contents | 2014


    Efficient transmission of halftones via facsimile

    Hei Tao Fung / Parker, K. J. | British Library Online Contents | 1996


    Tone-dependent noise model for high-quality halftones

    Fung, Y.-H. / Chan, Y.-H. | British Library Online Contents | 2013