DocumentCode
3432052
Title
Lossy/lossless coding of bi-level images
Author
Martins, Bo ; Forchhammer, Soren
Author_Institution
Dept. of Telecommun., Tech. Univ. Denmark, Lyngby, Denmark
fYear
1997
fDate
25-27 Mar 1997
Firstpage
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
Keywords
arithmetic codes; data compression; image coding; probability; trees (mathematics); arithmetic coding; bi-level images; conditional probabilities; free tree; lossless coding; lossy coding; multiple refinement template coding; pixel flipping; rate-distortion-algorithm; refinement coding; template; Image coding;
fLanguage
English
Publisher
ieee
Conference_Titel
Data Compression Conference, 1997. DCC '97. Proceedings
Conference_Location
Snowbird, UT
ISSN
1068-0314
Print_ISBN
0-8186-7761-9
Type
conf
DOI
10.1109/DCC.1997.582116
Filename
582116
Link To Document