Skip to main content
  • 1745 Accesses

Abstract

When processing signal data with a digital computer one is always faced with the problem that this data on the one hand needs to be stored as compactly as possible and on the other hand must be represented with sufficient accuracy. As digital representations are necessarily always also finite, it is, therefore, the goal of a so-called vector quantizer to map vectors from the input data space onto a finite set of typical reproduction vectors. Through this mapping ideally no information should be lost which is relevant for the further processing of the data. Therefore, one tries to reduce the effort for storage and transmission of vector-valued data by eliminating redundant information contained therein.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

4.5 Bibliographical Remarks

  1. Dempster AP, Laird NM, Rubin DB (1977) Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society, Series B 39(1):1–22

    MATH  MathSciNet  Google Scholar 

  2. Furui S (2000) Digital Speech Processing, Synthesis, and Recognition. Signal Processing and Communications Series, Marcel Dekker, New York, Basel pp. 395–396

    Google Scholar 

  3. Gersho A, Gray RM (1992) Vector Quantization and Signal Compression. Communications and Information Theory, Kluwer Academic Publishers, Boston

    Google Scholar 

  4. Huang X, Ariki Y, Jack M (1990) Hidden Markov Models for Speech Recognition. No. 7 in Information Technology Series, Edinburgh University Press, Edinburgh pp. 29–35

    Google Scholar 

  5. Huang X, Acero A, Hon HW (2001) Spoken Language Processing: A Guide to Theory, Algorithm, and System Development. Prentice Hall, Englewood Cliffs, New Jersey Chap. 4.4, pp. 163–175

    Google Scholar 

  6. Jelinek F (1997) Statistical Methods for Speech Recognition. MIT Press, Cambridge, MA p. 11

    Google Scholar 

  7. Linde Y, Buzo A, Gray RM (1980) An algorithm for vector quantizer design. IEEE Trans on Communications 28(1):84–95

    Article  Google Scholar 

  8. MacQueen J (1967) Some methods for classification and analysis of multivariate observations. In: Cam LML, Neyman J (eds) Proc. Fifth Berkeley Symposium on Mathematical Statistics and Probability, vol 1, pp 281–296

    Google Scholar 

  9. Rabiner LR, Juang BH (1993) Fundamentals of Speech Recognition. Prentice-Hall, Englewood Cliffs, New Jersey p. 125

    Google Scholar 

Download references

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

(2008). Vector Quantization. In: Markov Models for Pattern Recognition. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71770-6_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-71770-6_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-71766-9

  • Online ISBN: 978-3-540-71770-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics