DocumentCode
1948230
Title
Towards entropy constrained lattice vector quantization
Author
Antonini, Marc ; Raffy, Philippe ; Barlaud, Michel
Author_Institution
Lab. I3S URA, Nice Univ., France
Volume
1
fYear
1995
fDate
23-26 Oct 1995
Firstpage
121
Abstract
In most of the quantization applications, we need variable rate vector quantizers. In 1988, Chou, Lookabaugh and Gray designed vector quantizers having minimum distortion subject to an entropy constraint. For this purpose, they used a generalization of Lloyd algorithm to n dimensions, called the ECVQ algorithm. We propose to use lattices in order to design entropy constrained lattice vector quantizers (ECLVQ). Low resolution (nonasymptotical) distortion and rate approximation models are given and a generalization of the distortion formula to entropy constraint is formulated. These works generalize those of Gibson (see IEEE Trans. on Inform. Theory, vol.IT-39, no.3, p.786-804, 1993) on fixed rate quantizers, to any cubic lattice Zn subject to entropy constraint
Keywords
entropy codes; rate distortion theory; variable rate codes; vector quantisation; ECLVQ; ECVQ algorithm; Lloyd algorithm; cubic lattice; distortion formula; entropy constrained lattice vector quantization; fixed rate quantizers; low resolution distortion; minimum distortion quantizers; nonasymptotical distortion; rate approximation models; variable rate vector quantizers; Algorithm design and analysis; Bit rate; Entropy; Iterative algorithms; Lattices; Probability density function; Rate distortion theory; Shape; Vector quantization;
fLanguage
English
Publisher
ieee
Conference_Titel
Image Processing, 1995. Proceedings., International Conference on
Conference_Location
Washington, DC
Print_ISBN
0-8186-7310-9
Type
conf
DOI
10.1109/ICIP.1995.529054
Filename
529054
Link To Document