title: 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 paper, we propose new approximations of the entropy and the distortion functions using piecewise affine and exponential forms, respectively. Because of these approximations, bit allocation is reformulated as a convex optimization problem. 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.
authors.forename: Mounir
authors.initials: M
authors.lastname: Kaaniche
authors.forename: Aurélia
authors.initials: A
authors.lastname: Fraysse
authors.forename: Béatrice
authors.initials: B
authors.lastname: Pesquet-Popescu
authors.forename: Jean-Christophe
authors.initials: JC
authors.lastname: Pesquet
mesh_terms: D000465:Algorithms; D016477:Artifacts; D003627:Data Interpretation, Statistical; D007089:Image Enhancement / Q000379:methods*; D007090:Image Interpretation, Computer-Assisted / Q000379:methods*; D015203:Reproducibility of Results; D018401:Sample Size; D012680:Sensitivity and Specificity; D012815:Signal Processing, Computer-Assisted