A convex programming bit allocation method for sparse sources

Abstract : 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.
Type de document :
Communication dans un congrès
Proceedings of the IEEE International Picture Coding Symposium (PCS), May 2012, Poland. pp.853-856, 2012
Liste complète des métadonnées

Littérature citée [10 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-00734456
Contributeur : Mounir Kaaniche <>
Soumis le : vendredi 21 septembre 2012 - 22:21:29
Dernière modification le : jeudi 9 février 2017 - 15:19:55
Document(s) archivé(s) le : samedi 22 décembre 2012 - 03:39:10

Fichier

RD_optimization.pdf
Fichiers éditeurs autorisés sur une archive ouverte

Identifiants

  • HAL Id : hal-00734456, version 1

Citation

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, 2012. 〈hal-00734456〉

Partager

Métriques

Consultations de la notice

576

Téléchargements de fichiers

121