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 | |
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 → … |