Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Variable-Bit-Length Coding: An Effective Coding Method

  • Conference paper
  • First Online:
Visual Information and Information Systems (VISUAL 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1614))

Included in the following conference series:

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.

This research was support, in part, by the National Institute of Health under grant R01LM05944-03.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. J. Clarke, Digital Compression of Still Images and Video, New York, Academic Press, 1995.

    Google Scholar 

  2. D. Huffman, “A Method for the Construction of Minimum Redundancy Codes”, Proc. IRE, Vol 40, pp. 1098–1101, 1952.

    Article  Google Scholar 

  3. Weidong Kou, Digital Image Compression-Algorithms and Standards, Kluwer Academic Publishers, 1995.

    Google Scholar 

  4. T. Welch, “A Technique for High-Performance Data Compression”, IEEE Computer, June 1994, 8–19.

    Google Scholar 

  5. I. H. Witten, R.M. Neal, and J. G. Cleary, “Arithmetic coding for data compression”, Commum. ACM, vol. 30, pp. 520–540, June 1987.

    Article  Google Scholar 

  6. J. Ziv and A. Lempel, “A Universal Algorithm for Sequential Data Compression”, IEEE Trans. on Information theory, Vol. 24, No. 5, pp. 530–536, 1978.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sahni, S., Vemuri, B.C., Chen, F., Kapoor, C. (1999). Variable-Bit-Length Coding: An Effective Coding Method. In: Huijsmans, D.P., Smeulders, A.W.M. (eds) Visual Information and Information Systems. VISUAL 1999. Lecture Notes in Computer Science, vol 1614. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48762-X_82

Download citation

  • DOI: https://doi.org/10.1007/3-540-48762-X_82

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66079-8

  • Online ISBN: 978-3-540-48762-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics