Bi-level image compression with tree coding

Bo Martins, Søren Forchhammer

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

    613 Downloads (Pure)


    Presently, tree coders are the best bi-level image coders. The current ISO standard, JBIG, is a good example. By organising code length calculations properly a vast number of possible models (trees) can be investigated within reasonable time prior to generating code. Three general-purpose coders are constructed by this principle. A multi-pass free tree coding scheme produces superior compression results for all test images. A multi-pass fast free template coding scheme produces much better results than JBIG for difficult images, such as halftonings. Rissanen's algorithm `Context' is presented in a new version that without sacrificing speed brings it close to the multi-pass coders in compression performance
    Original languageEnglish
    Title of host publicationProceedings of the Data Compression Conference
    Publication date1996
    ISBN (Print)08-18-67358-3
    Publication statusPublished - 1996
    EventData Compression Conference 1996 - Snowbird, UT, United States
    Duration: 31 Mar 19963 Apr 1996


    ConferenceData Compression Conference 1996
    Country/TerritoryUnited States
    CitySnowbird, UT
    Internet address

    Bibliographical note

    Copyright 1996 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 'Bi-level image compression with tree coding'. Together they form a unique fingerprint.

    Cite this