On entropy-constrained vector quantization using Gaussian mixture models

IEEE Transactions on Communications

Volumn 56, Issue 12, 2008, Pages 2094-2104

  Zhao, David Y ^a   Samuelsson, Jonas ^b   Nilsson, Mattias ^a  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

^b DOLBY LABORATORIES   (United States)

Author keywords

Arithmetic coding; Entropy constrained; Gaussian mixture model; GMM; Lattice; Vector quantization; VQ

Indexed keywords

BLIND SOURCE SEPARATION; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTATIONAL COMPLEXITY; ENTROPY; IMAGE SEGMENTATION; MAGNETOSTRICTIVE DEVICES; MIXTURES; OBJECT RECOGNITION; PROBABILITY DENSITY FUNCTION; PROGRAMMING THEORY; SPEECH CODING; TRELLIS CODES; VECTOR QUANTIZATION;

ARITHMETIC CODING; GAUSSIAN MIXTURE MODEL; GMM; LATTICE; VQ;

VECTORS;

EID: 58049199404     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOMM.2008.070357     Document Type: Article

References (29)

1. A. D. Subramaniam, "Gaussian mixtures models in compression and communication," Ph.D. dissertation, University of California, San Diego (UCSD), 2004.
2. P. A. Chou, T. Lookabaugh, and R. M. Gray, "Entropy-constrained vector quantization," IEEE Trans. Acoust., Speech, Signal Processing, vol. 37, no. 1, pp. 31-42, Jan. 1989.
3. M. Tasto and P. Wintz, "Image coding by adaptive block quantization," IEEE Trans. Commun., vol. 19, no. 6, pp. 957-972, 1971.
4. A. D. Subramaniam and B. D. Rao, "PDF optimized parametric vector quantization of speech line spectral frequencies," IEEE Trans. Speech and Audio Processing, vol. 11, no. 2, pp. 130-142, Mar. 2003.
5. P. Hedelin and J. Skoglund, "Vector quantization based on Gaussian mixture models," IEEE Trans. Speech and Audio Processing, vol. 8, no. 4, pp. 385-401, July 2000.
6. J. Samuelsson and P. Hedelin, "Recursive coding of spectrum parameters," IEEE Trans. Speech and Audio Processing, vol. 9, no. 5, pp. 492-503, July 2001.
7. A. D. Subramaniam, W. R. Gardner, and B. D. Rao, "Low-complexity source coding using Gaussian mixture models, lattice vector quantization, and recursive coding with application to speech spectrum quantization," IEEE Trans. Audio, Speech and Language Processing, vol. 14, no. 2, pp. 524-532, Mar. 2006.
8. R. A. Redner and H. F. Walker, "Mixture densities, maximum likelihood and the EM algorithm," SIAM Review, vol. 26, no. 2, pp. 195-239, 1984.
9. T. Linder and K. Zeger, "Asymptotic entropy-constrained performance of tessellating and universal randomized lattice quantization," IEEE Trans. Inform. Theory, vol. 40, no. 2, pp. 575-579, Man 1994.
10. A. György, T. Linder, P. Chou, and B. Betts, "Do optimal entropy-constrained quantizers have a finite or infinite number of codewords?" IEEE Trans. Inform. Theory, vol. 49, no. 11, pp. 3031-3037, Nov. 2003.
11. A. Gersho, "Asymptotically optimal block quantization," IEEE Trans. Inform. Theory, vol. 25, no. 4, pp. 373-380, Oct. 1979.
12. R. Pasco, "Source coding algorithms for fast data compression," Ph.D. dissertation, Stanford Univ., 1976.
13. J. Rissanen, "Generalized Kraft inequality and arithmetic coding," IBM J. Research and Development, vol. 20, p. 198, 1976.
14. J. H. Conway and N. J. A. Sloane, "Fast quantizing and decoding algorithms for lattice quantizers and codes," IEEE Trans. Inform. Theory, vol. 28, no. 2, pp. 227-232, Mar. 1982.
15. E. Agrell, T. Eriksson, A. Vardy, and K. Zeger, "Closest point search in lattices," IEEE Trans. Inform. Theory, vol. 48, no. 8, pp. 2201-2214, Aug. 2002.
16. E. Agrell and T. Eriksson, "Optimization of lattices for quantization," IEEE Trans. Inform. Theory, vol. 44, no. 5, pp. 1814-1828, Sept. 1998.
17. K. Popat and R. Picard, "Cluster-based probability model applied to image restoration mid compression," in Proc. IEEE Int. Conf. Acoustics, Speech and Signal Processing, vol. 5, Apr. 1994, pp. 381-384.
18. K. Popat and R. Picard, "Cluster-based probability model and its application to image and texture processing," IEEE Trans. Image Processing, vol. 6, no. 2, pp. 268-284, Feb. 1997.
19. R. Gray, "Gauss mixture vector quantization," in Proc. IEEE Int. Conf. Acoustics, Speech and Signal Processing, vol. 3, 2001, pp. 1769-1772.
20. W. B. Kleijn, " A basis for source coding," Jan. 2003, lecture notes, KTH, Stockholm.
21. W. Klein, R. Plomp, and L. C. W. Pols, "Vowel spectra, vowel spaces, and vowel identification," J. Acoust. Soc. Am., vol. 48, no. 4, pp. 999-1009, 1970.
22. R. Togneri, M. D. Alder, and Y. Attikiouzel, "Dimension and structure of the speech space," in IEE Proc.-I, Commun., Speech and Vision, vol. 139, no. 2, 1992, pp. 123-127.
23. M. Nilsson and W. B. Kleijn, "On the estimation of differential entropy from data located on embedded manifolds," IEEE Trans. Inform. Theory vol. 53, no. 7, pp. 2330-2341, 2007.
24. T. Linder and R. Zamir, "High-resolution source coding for non-difference distortion measures: The rate-distortion function," IEEE Trans. Inform. Theory, vol. 45, no. 2, pp. 533-547, Mar. 1999.
25. T. Linder, R. Zamir, and K. Zeger, "High-resolution source coding for non-difference distortion measures: Multidimensional companding," IEEE Trans. Inform. Theory, vol. 45, no. 2, pp. 548-561, Mar. 1999.
26. R. M. Gray, Source Coding Theory. Kluwer Academic Publisher, 1990.
27. E. Bodden, M. Clasen, and J. Kneis, "Arithmetic Coding in revealed - a guided tour from theory to praxis," in Proseminar Datenkompression 2001. RWTH Aachen University.
28. "AMR speech codec; transcoding functions," 3GPP TS 26.090, 1999.
29. A. P. Dempster, N. Laird, and D. B. Rubin, "Maximum likelihood from incomplete data via the EM algorithm," J. Roy. Statist. Soc. B, vol. 39, no. 1, pp. 1-38, 1977.