Lossy/lossless coding of bi-level images

Bo Martins; Søren Forchhammer

doi:10.1109/DCC.1997.582116

Lossy/lossless coding of bi-level images

Bo Martins, Søren Forchhammer

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

624 Downloads (Orbit)

Abstract

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 language	English
Title of host publication	Data Compression Conference, 1997. DCC '97. Proceedings
Number of pages	454
Publisher	IEEE
Publication date	1997
ISBN (Print)	0-8186-7761-9
DOIs	https://doi.org/10.1109/DCC.1997.582116
Publication status	Published - 1997
Event	Data Compression Conference, 1997. DCC '97. Proceedings½ - Duration: 1 Jan 1997 → …

Conference

Conference	Data Compression Conference, 1997. DCC '97. Proceedings½
Period	01/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

Access to Document

10.1109/DCC.1997.582116

MartinsFinal published version, 78.3 KB

OpenUrl availability

Full text

Cite this

@inproceedings{224876606fc7432e8d8e7d504745f5e0,

title = "Lossy/lossless coding of bi-level images",

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

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

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; Data Compression Conference, 1997. DCC '97. Proceedings½ ; Conference date: 01-01-1997",

year = "1997",

doi = "10.1109/DCC.1997.582116",

language = "English",

isbn = "0-8186-7761-9",

booktitle = "Data Compression Conference, 1997. DCC '97. Proceedings",

publisher = "IEEE",

address = "United States",

}

TY - GEN

T1 - Lossy/lossless coding of bi-level images

AU - Martins, Bo

AU - Forchhammer, Søren

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

PY - 1997

Y1 - 1997

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

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

U2 - 10.1109/DCC.1997.582116

DO - 10.1109/DCC.1997.582116

M3 - Article in proceedings

SN - 0-8186-7761-9

BT - Data Compression Conference, 1997. DCC '97. Proceedings

PB - IEEE

T2 - Data Compression Conference, 1997. DCC '97. Proceedings½

Y2 - 1 January 1997

ER -

Lossy/lossless coding of bi-level images

Abstract

Conference

Bibliographical note

Access to Document

OpenUrl availability

Fingerprint

Cite this