A Bit Allocation Method for Sparse Source Coding - Archive ouverte HAL Access content directly
Journal Articles IEEE Transactions on Image Processing Year : 2014

A Bit Allocation Method for Sparse Source Coding


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.
Fichier principal
Vignette du fichier
final_bitalloc_double_col.pdf (1.85 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00796891 , version 1 (05-03-2013)
hal-00796891 , version 2 (10-10-2013)
hal-00796891 , version 3 (14-10-2013)
hal-00796891 , version 4 (25-02-2014)


  • 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, 2014, 23 (1), pp.137-152. ⟨hal-00796891v4⟩
606 View
588 Download


Gmail Facebook X LinkedIn More