Conference paper
Lossy/lossless coding of bi-level images
In
Data Compression Conference, 1997. Dcc '97. Proceedings
—
1997, pp. 454
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
| Language: | English |
|---|---|
| Publisher: | IEEE |
| Year: | 1997 |
| Pages: | 454 |
| Proceedings: | Data Compression Conference, 1997. DCC '97. Proceedings½ |
| ISBN: | 0818677619 and 9780818677618 |
| ISSN: | 23750383 and 10680314 |
| Types: | Conference paper |
| DOI: | 10.1109/DCC.1997.582116 |
| ORCIDs: | Forchhammer, Søren |
Keywords
