DocumentCode :
397416
Title :
Codecell convexity in optimal entropy-constrained vector quantization
Author :
György, András ; Linder, Tamas
Author_Institution :
Comput. & Autom. Res. Inst., Hungarian Acad. of Sci., Budapest, Hungary
fYear :
2003
fDate :
29 June-4 July 2003
Firstpage :
460
Abstract :
Properties of optimal entropy-constrained vector quantizers (ECVQs) are studied for the mean squared error (MSB) distortion measure. It is known that restricting an ECVQ to have convex codecells may preclude its optimality for some sources with discrete distribution and show that for sources with continuous distribution, any finite-level ECVQ can be replaced by another finite-level ECVQ with convex codecells that has equal or better performance. This paper also considers the problem of existence of optimal ECVQs for continuous source distributions.
Keywords :
entropy; mean square error methods; probability; vector quantisation; ECVQ; MSB; continuous source distributions; convex codecells; discrete distribution; mean squared error distortion measure; optimal entropy-constrained vector quantizer; Automation; Computer errors; Councils; Distortion measurement; Entropy; Informatics; Laboratories; Q measurement; Random variables; Vector quantization;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 2003. Proceedings. IEEE International Symposium on
Print_ISBN :
0-7803-7728-1
Type :
conf
DOI :
10.1109/ISIT.2003.1228477
Filename :
1228477
Link To Document :
بازگشت