Lossy/lossless coding of bi-level images

Bo Martins, Søren Forchhammer

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

    601 Downloads (Pure)


    Summary form only given. We present improvements to a general type of lossless, lossy, and refinement coding of bi-level images (Martins and Forchhammer, 1996). Loss is introduced by flipping pixels. The pixels are coded using arithmetic coding of conditional probabilities obtained using a template as is known from JBIG and proposed in JBIG-2 (Martins and Forchhammer). Our new state-of-the-art results are obtained using the more general free tree instead of a template. Also we introduce multiple refinement template coding. The lossy algorithm is analogous to the greedy `rate-distortion'-algorithm of Martins and Forchhammer but is based on the free tree
    Original languageEnglish
    Title of host publicationData Compression Conference, 1997. DCC '97. Proceedings
    Number of pages454
    Publication date1997
    ISBN (Print)0-8186-7761-9
    Publication statusPublished - 1997
    EventData Compression Conference, 1997. DCC '97. Proceedings½ -
    Duration: 1 Jan 1997 → …


    ConferenceData Compression Conference, 1997. DCC '97. Proceedings½
    Period01/01/1997 → …

    Bibliographical note

    Copyright: 1997 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE


    Dive into the research topics of 'Lossy/lossless coding of bi-level images'. Together they form a unique fingerprint.

    Cite this