Skip to main content

A Simple Algorithm for Ordering and Compression of Vector Codebooks

  • Conference paper
  • First Online:
Book cover Computer Analysis of Images and Patterns (CAIP 2001)

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

Included in the following conference series:

  • 1311 Accesses

Abstract

The problem of storage or transmission of codevectors is an essential issue in vector quantization with custom codebook. The proposed technique for compression of codebooks relies on structuring and ordering properties of a binary split algorithm used for codebook design. A simple algorithm is presented for automatic ordering of the codebook entries in order to group similar codevectors. This similarity is exploited in efficient compression of the codebook content by the means of lossless differential coding and lossy DCT-based coding. Experimental results of two compression experiments are reported and show that a small compression gain can be achieved in this way.

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

Access this chapter

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. Linde, Y., Buzo, A., Gray, R.M.: An Algorithm for Vector Quantizer Design. IEEE Trans. on Communications (1980) 84–89

    Google Scholar 

  2. MacQueen, J.B.: Some Methods for Classification and Analysis of Multivariate Observations. In: Proc. 5th Berkeley Symp. Math. Statistics and Probability (1967) 281–297

    Google Scholar 

  3. Morgan, J.N., Sonquist, J.A.: Problem in the Analysis of Survey Data, and a Proposal. J. Amer, Static. Assoc. 58 (1963) 415–434

    Article  MATH  Google Scholar 

  4. Orchard, M., Bouman, C: Color Quantization of Images. IEEE Trans. on Sig. Proc. 39 (1991) 2677–2690

    Article  Google Scholar 

  5. Wu, X., Zhang, K.: A Better Tree-Structured Vector Quantizer. Proc. IEEE Data Compression Conf, IEEE Computer Society Press, LA (1991) 392–401

    Chapter  Google Scholar 

  6. Dionysian, R., Ercegovac, M.: Vector quantization with compressed codebooks. Signal Processing: Image Communication 9 (1996) 79–88

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bartkowiak, M., Łuczak, A. (2001). A Simple Algorithm for Ordering and Compression of Vector Codebooks. In: Skarbek, W. (eds) Computer Analysis of Images and Patterns. CAIP 2001. Lecture Notes in Computer Science, vol 2124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44692-3_13

Download citation

  • DOI: https://doi.org/10.1007/3-540-44692-3_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42513-7

  • Online ISBN: 978-3-540-44692-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics