Skip to Main content Skip to Navigation
Journal articles

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 metadata

Cited literature [44 references]  Display  Hide  Download
Contributor : Mounir Kaaniche Connect in order to contact the contributor
Submitted on : Tuesday, February 25, 2014 - 4:18:45 PM
Last modification on : Thursday, September 29, 2022 - 2:21:15 PM
Long-term archiving on: : Sunday, May 25, 2014 - 11:37:34 AM


Files produced by the author(s)


  • HAL Id : hal-00796891, version 4


Mounir Kaaniche, Aurélia Fraysse, Béatrice Pesquet-Popescu, Jean-Christophe Pesquet. A Bit Allocation Method for Sparse Source Coding. IEEE Transactions on Image Processing, Institute of Electrical and Electronics Engineers, 2014, 23 (1), pp.137-152. ⟨hal-00796891v4⟩



Record views


Files downloads