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.
Liste complète des métadonnées

Cited literature [44 references]  Display  Hide  Download

https://hal-upec-upem.archives-ouvertes.fr/hal-00796891
Contributor : Mounir Kaaniche <>
Submitted on : Tuesday, February 25, 2014 - 4:18:45 PM
Last modification on : Wednesday, February 20, 2019 - 1:29:06 AM
Document(s) archivé(s) le : Sunday, May 25, 2014 - 11:37:34 AM

File

final_bitalloc_double_col.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00796891, version 4

Citation

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

Share

Metrics

Record views

831

Files downloads

329