Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

A Bit Allocation Method for Sparse Source Coding

Abstract : In this paper, we develop an efficient bit allocation strategy for subband-based image coding systems. More specifically, our objective is to design a new optimization algorithm based on a rate-distortion optimality criterion. To this end, we consider the uniform scalar quantization of a class of mixed distributed sources following a Bernoulli-Generalized Gaussian distribution. This model appears to be particularly well-adapted for image data which have a sparse representation in a wavelet basis. In this context, we propose new approximations of the entropy and the distortion functions by using piecewise affine and exponential forms, respectively. Thanks to these approximations, we reformulate the bit allocation problem as a convex optimization one. Solving the resulting problem allows us to derive the optimal quantization step for each subband. Experimental results show the benefits that can be drawn from the proposed bit allocation method in a typical transform-based coding application.
Complete list of metadatas
Contributor : Mounir Kaaniche <>
Submitted on : Tuesday, March 5, 2013 - 11:24:29 AM
Last modification on : Wednesday, September 16, 2020 - 4:44:13 PM
Long-term archiving on: : Thursday, June 6, 2013 - 3:56:51 AM


Publisher files allowed on an open archive


  • HAL Id : hal-00796891, version 1



Mounir Kaaniche, Aurélia Fraysse, Béatrice Pesquet-Popescu, Jean-Christophe Pesquet. A Bit Allocation Method for Sparse Source Coding. 2013. ⟨hal-00796891v1⟩



Record views


Files downloads