A convex programming bit allocation method for sparse sources - Archive ouverte HAL Access content directly
Conference Papers Year : 2012

A convex programming bit allocation method for sparse sources


The objective of this paper is to design an efficient bit allocation algorithm in the subband coding context based on an analytical approach. More precisely, we consider the uniform scalar quantization of subband coefficients modeled by a Generalized Gaussian distribution. This model appears to be particularly well-adapted for data having a sparse representation in the wavelet domain. Our main contribution is to reformulate the bit allocation problem as a convex programming one. For this purpose, we firstly define new convex approximations of the entropy and distortion functions. Then, we derive explicit expressions of the optimal quantization parameters. Finally, we illustrate the application of the proposed method to wavelet-based coding systems.
Fichier principal
Vignette du fichier
RD_optimization.pdf (166.83 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-00734456 , version 1 (21-09-2012)


  • HAL Id : hal-00734456 , version 1


Mounir Kaaniche, Aurélia Fraysse, Beatrice Pesquet-Popescu, Jean-Christophe Pesquet. A convex programming bit allocation method for sparse sources. Proceedings of the IEEE International Picture Coding Symposium (PCS), May 2012, Poland. pp.853-856. ⟨hal-00734456⟩
286 View
154 Download


Gmail Facebook Twitter LinkedIn More