By Topic

A "follow the perturbed leader"-type algorithm for zero-delay quantization of individual sequences

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Gyorgy, A. ; Dept. of Math. & Stat., Queen''s Univ., Kingston, Ont., Canada ; Linder, T. ; Lugosi, G.

Zero-delay lossy source coding schemes are considered for individual sequences. Performance is measured by the distortion redundancy, defined as the difference between the normalized cumulative mean squared distortion of the scheme and the normalized cumulative distortion of the best scalar quantizer of the same rate which is matched to the entire sequence to be encoded. Recently, Weissman and Merhav constructed a randomized scheme which, for any bounded individual sequence of length n, achieves a distortion redundancy O(n-13/logn). However, this scheme has prohibitive complexity (both space and time) which makes practical implementation infeasible. In this paper, we present an efficiently computable algorithm based on a "follow the perturbed leader"-type prediction method by Kalai and Vempala. Our algorithm achieves distortion redundancy O(n-14/ logn), which is somewhat worse than that of the scheme by Merhav and Weissman, but it has computational complexity that is linear in the sequence length n, and requires O(n14/) storage capacity.

Published in:

Data Compression Conference, 2004. Proceedings. DCC 2004

Date of Conference:

23-25 March 2004