Skip to Main content Skip to Navigation
Conference papers

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.
Complete list of metadatas

Cited literature [10 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00734456
Contributor : Mounir Kaaniche <>
Submitted on : Friday, September 21, 2012 - 10:21:29 PM
Last modification on : Wednesday, April 8, 2020 - 3:26:56 PM
Document(s) archivé(s) le : Saturday, December 22, 2012 - 3:39:10 AM

File

RD_optimization.pdf
Publisher files allowed on an open archive

Identifiers

  • 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. ⟨hal-00734456⟩

Share

Metrics

Record views

816

Files downloads

342