A convex programming bit allocation method for sparse sources
Résumé
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.
| Origine | Fichiers éditeurs autorisés sur une archive ouverte |
|---|
Loading...