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 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. >
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
