Near-Optimal Rates for Limited-Delay Universal Lossy Source Coding

András György 1 Gergely Neu 2
2 SEQUEL - Sequential Learning
LIFL - Laboratoire d'Informatique Fondamentale de Lille, Inria Lille - Nord Europe, LAGIS - Laboratoire d'Automatique, Génie Informatique et Signal
Abstract : We consider the problem of limited-delay lossy coding of individual sequences. Here, the goal is to design (fixed-rate) compression schemes to minimize the normalized expected distortion redundancy relative to a reference class of coding schemes, measured as the difference between the average distortion of the algorithm and that of the best coding scheme in the reference class. In compressing a sequence of length T, the best schemes available in the literature achieve an O(T^-1/3) normalized distortion redundancy relative to finite reference classes of limited delay and limited memory, and the same redundancy is achievable, up to logarithmic factors, when the reference class is the set of scalar quantizers. It has also been shown that the distortion redundancy is at least of order T^-1/2 in the latter case, and the lower bound can easily be extended to sufficiently powerful (possibly finite) reference coding schemes. In this paper, we narrow the gap between the upper and lower bounds, and give a compression scheme whose normalized distortion redundancy is O(ln(T)/ T^1/2) relative to any finite class of reference schemes, only a logarithmic factor larger than the lower bound. The method is based on the recently introduced shrinking dartboard prediction algorithm, a variant of exponentially weighted average prediction. The algorithm is also extended to the problem of joint source-channel coding over a (known) stochastic noisy channel and to the case when side information is also available to the decoder (the Wyner–Ziv setting). The same improvements are obtained for these settings as in the case of a noiseless channel. Our method is also applied to the problem of zero-delay scalar quantization, where O(ln(T)/ T^1/2) normalized distortion redundancy is achieved relative to the (infinite) class of scalar quantizers of a given rate, almost achieving the known lower bound of order 1/ T^-1/2. The computationally efficient algorithms known for scalar quantization and the Wyner–Ziv setting carry over to our (improved) coding schemes presented in this paper.
Document type :
Journal articles
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01079327
Contributor : Gergely Neu <>
Submitted on : Monday, November 3, 2014 - 3:03:00 PM
Last modification on : Thursday, February 21, 2019 - 10:52:49 AM
Long-term archiving on : Wednesday, February 4, 2015 - 10:10:35 AM

Files

quant_it_fin.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

András György, Gergely Neu. Near-Optimal Rates for Limited-Delay Universal Lossy Source Coding. IEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers, 2014, pp.2823-2834. ⟨10.1109/TIT.2014.2307062⟩. ⟨hal-01079327⟩

Share

Metrics

Record views

292

Files downloads

428