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.
Cite
CITATION STYLE
Sahni, S., Vemuri, B. C., Chen, F., & Kapoor, C. (1999). Variable-bit-length coding: An effective coding method. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1614, pp. 665–674). Springer Verlag. https://doi.org/10.1007/3-540-48762-x_82
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
