Variable-Bit-Lengthn Coding: An Effective Coding Method

Authors:
Sartaj Sahni;Baba C. Vemuri;F. Chen;C. Kapoor
Affiliations:
-;-;-;-
Venue:
VISUAL '99 Proceedings of the Third International Conference on Visual Information and Information Systems
Year:
1999

Citing 4
Cited 0

Arithmetic coding for data compression

Communications of the ACM
Digital Image Compression: Algorithms and Standards

Digital Image Compression: Algorithms and Standards
Digital Compression of Still Images and Video

Digital Compression of Still Images and Video
A Technique for High-Performance Data Compression

Computer

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a new coding scheme for lossless compression. This scheme, variable-bit-length coding, stores different grayscale values using a different number of bits. The compression performance of variable-bit-length coding coupled with a preprocessing method called remapping is compared with the compression performance of well known coding methods such as Huffman coding, arithmetic coding, and LZW coding. On the bechmark suite of 10 images used by us, remapping with variable-bit-length coding obtained maximum compression more often than did any other coding method.