Deterministic annealing algorithm for entropy-constrained vector quantizer design

Kenneth Rose, David Miller

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Scopus citations

Abstract

In this paper, we develop a deterministic annealing approach for the design of entropy-constrained vector quantizers. Here, the quantization problem is reformulated within a probabilistic setting and the principle of maximum entropy is invoked. The resulting method is connected to statistical physics in two important respects. First, there is annealing in the process controlled by a `temperature' parameter, useful for avoiding local optima of the cost. Second, the number of distinct codevectors grows by a sequence of phase transitions as the temperature is varied. When the temperature is lowered to zero, the method searches for the optimal entropy-constrained vector quantizer. Conditions for bifurcation in the process provide insights into the `right' codebook size for a given problem.

Original languageEnglish (US)
Title of host publicationConference Record of the Asilomar Conference of Signals, Systems & Computers
PublisherPubl by IEEE
Pages1651-1655
Number of pages5
ISBN (Print)0818641207
StatePublished - 1993
EventProceedings of the 27th Asilomar Conference on Signals, Systems & Computers - Pacific Grove, CA, USA
Duration: Nov 1 1993Nov 3 1993

Publication series

NameConference Record of the Asilomar Conference of Signals, Systems & Computers
Volume2
ISSN (Print)1058-6393

Other

OtherProceedings of the 27th Asilomar Conference on Signals, Systems & Computers
CityPacific Grove, CA, USA
Period11/1/9311/3/93

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'Deterministic annealing algorithm for entropy-constrained vector quantizer design'. Together they form a unique fingerprint.

Cite this