On Codecell Convexity of Optimal Multiresolution Scalar Quantizers for Continuous Sources

It has been shown by earlier results that for fixed rate multiresolution scalar quantizers and for mean squared error distortion measure, codecell convexity precludes optimality for certain discrete sources. However it was unknown whether the same phenomenon can occur for any continuous source. In this paper, examples of continuous sources (even with bounded continuous densities) are presented for which optimal fixed rate multiresolution scalar quantizers cannot have only convex codecells, proving that codecell convexity precludes optimality also for such regular sources.

[1]  Sorina Dumitrescu,et al.  Optimal Two-Description Scalar Quantizer Design , 2004, Algorithmica.

[3]  Sorina Dumitrescu,et al.  On global optimality of gradient descent algorithms for fixed-rate scalar multiple description quantizer design , 2005, Data Compression Conference.

[4]  W. Marsden.  I and J , 2012 .

[5]  Michelle Effros,et al.  Codecell contiguity in optimal fixed-rate and entropy-constrained network scalar quantizers , 2002, Proceedings DCC 2002. Data Compression Conference.

[6]  Tamás Linder,et al.  Codecell convexity in optimal entropy-constrained vector quantization , 2003, IEEE Transactions on Information Theory.

[7]  Tamás Linder,et al.  Do optimal entropy-constrained quantizers have a finite or infinite number of codewords? , 2003, IEEE Trans. Inf. Theory.

[8]  Vinay A. Vaishampayan,et al.  Design of multiple description scalar quantizers , 1993, IEEE Trans. Inf. Theory.

[9]  Sorina Dumitrescu,et al.  On optimal multi-resolution scalar quantization , 2002, Proceedings DCC 2002. Data Compression Conference.

[10]  T. Linder.  LEARNING-THEORETIC METHODS IN VECTOR QUANTIZATION , 2002 .

[11]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[12]  Allen Gersho,et al.  Vector quantization and signal compression , 1991, The Kluwer international series in engineering and computer science.

[13]  A. Wyner,et al.  Source coding for multiple descriptions , 1980, The Bell System Technical Journal.

[14]  Robert M. Gray,et al.  An Algorithm for Vector Quantizer Design , 1980, IEEE Trans. Commun..

[15]  Michelle Effros,et al.  Rapid near-optimal VQ design with a deterministic data net , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[16]  Nariman Farvardin,et al.  Fixed-rate successively refinable scalar quantizers , 1996, Proceedings of Data Compression Conference - DCC '96.

[17]  Michelle Effros,et al.  Quantization as histogram segmentation: globally optimal scalar quantizer design in network systems , 2002, Proceedings DCC 2002. Data Compression Conference.

[18]  David Pollard,et al.  Quantization and the method of k -means , 1982, IEEE Trans. Inf. Theory.

[19]  Sorina Dumitrescu,et al.  Lagrangian Optimization of Two-Description Scalar Quantizers , 2007, IEEE Transactions on Information Theory.

[20]  T. Linder,et al.  Codecell convexity in optimal entropy-constrained vector quantization , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[21]  Michelle Effros,et al.  Quantization as Histogram Segmentation: Optimal Scalar Quantizer Design in Network Systems , 2008, IEEE Transactions on Information Theory.

[22]  Tamás Linder,et al.  On the structure of optimal entropy-constrained scalar quantizers , 2002, IEEE Trans. Inf. Theory.

[23]  Sorina Dumitrescu,et al.  Algorithms for optimal multi-resolution quantization , 2004, J. Algorithms.

[24]  Sorina Dumitrescu,et al.  On Properties of Locally Optimal Multiple Description Scalar Quantizers With Convex Cells , 2009, IEEE Transactions on Information Theory.