loading...
On Global Optimality of Gradient Descent Algorithms for Fixed-Rate Scalar Multiple Description Quantizer Design
Snowbird, Utah March 29-March 31
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/DCC.2005.60Data Compression Conference (DCC'05)
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Sorina Dumitrescu, McMaster University, Hamilton, ON, Canada
Xiaolin Wu, McMaster University, Hamilton, ON, Canada
We prove that Trushkin's sufficient conditions for the global optimality of a locally optimal fixed-rate scalar quantizer also ensure the global optimality of a locally optimal fixed-rate multiple description scalar quantizer of convex codecells, with respect to a fixed index assignment. This result also holds for the fixed-rate multiresolution scalar quantizer of convex codecells. As a consequence the well-known log-concave pdf condition can be extended to the multiple description and multiresolution case.
Citation:
Sorina Dumitrescu, Xiaolin Wu, "On Global Optimality of Gradient Descent Algorithms for Fixed-Rate Scalar Multiple Description Quantizer Design," dcc, pp.388-397, Data Compression Conference (DCC'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.