Bi-level image compression with tree coding

Bo Martins; Søren Forchhammer

doi:10.1109/DCC.1996.488332

Bi-level image compression with tree coding

Bo Martins, Søren Forchhammer

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

653 Downloads (Pure)

Abstract

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 language	English
Title of host publication	Proceedings of the Data Compression Conference
Publisher	IEEE
Publication date	1996
Pages	270-279
ISBN (Print)	08-18-67358-3
DOIs	https://doi.org/10.1109/DCC.1996.488332
Publication status	Published - 1996
Event	Data Compression Conference 1996 - Snowbird, UT, United States Duration: 31 Mar 1996 → 3 Apr 1996 http://www.informatik.uni-trier.de/~ley/db/conf/dcc/dcc96.html

Conference

Conference	Data Compression Conference 1996
Country/Territory	United States
City	Snowbird, UT
Period	31/03/1996 → 03/04/1996
Internet address	http://www.informatik.uni-trier.de/~ley/db/conf/dcc/dcc96.html

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.

Access to Document

10.1109/DCC.1996.488332

MartinsFinal published version, 615 KB

OpenUrl availability

Full text

Cite this

@inproceedings{fd8b97fc82434fd7890d4237f1c61f93,

title = "Bi-level image compression with tree coding",

abstract = "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",

author = "Bo Martins and S{\o}ren Forchhammer",

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.; Data Compression Conference 1996, DCC '96 ; Conference date: 31-03-1996 Through 03-04-1996",

year = "1996",

doi = "10.1109/DCC.1996.488332",

language = "English",

isbn = "08-18-67358-3",

pages = "270--279",

booktitle = "Proceedings of the Data Compression Conference",

publisher = "IEEE",

address = "United States",

url = "http://www.informatik.uni-trier.de/~ley/db/conf/dcc/dcc96.html",

}

TY - GEN

T1 - Bi-level image compression with tree coding

AU - Martins, Bo

AU - Forchhammer, Søren

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

PY - 1996

Y1 - 1996

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

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

U2 - 10.1109/DCC.1996.488332

DO - 10.1109/DCC.1996.488332

M3 - Article in proceedings

SN - 08-18-67358-3

SP - 270

EP - 279

BT - Proceedings of the Data Compression Conference

PB - IEEE

T2 - Data Compression Conference 1996

Y2 - 31 March 1996 through 3 April 1996

ER -

Bi-level image compression with tree coding

Abstract

Conference

Bibliographical note

Access to Document

OpenUrl availability

Fingerprint

Cite this