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

https://hal-upec-upem.archives-ouvertes.fr/hal-00796891
Contributor : Mounir Kaaniche <>
Submitted on : Tuesday, March 5, 2013 - 11:24:29 AM
Last modification on : Thursday, October 17, 2019 - 12:36:09 PM
Long-term archiving on : Thursday, June 6, 2013 - 3:56:51 AM

File

bit_alloc_single_col.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-00796891, version 1

Collections

Citation

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

Share

Metrics

Record views

112

Files downloads

83