Rateless lossy compression via the extremes

• Published in: 2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton) pp. 88 - 92
• Main Authors: No, Albert, Weissman, Tsachy
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.09.2014
• Subjects: Complete separability; Decoding; extreme value theory; Indexes; infinitesimal successive refinability; order statistics; rate distortion code; Rate distortion theory; Rate-distortion; rateless code; Source coding; spherical distribution; uniform random orthogonal matrix; Vectors
• DOI: 10.1109/ALLERTON.2014.7028440

We begin by presenting a simple lossy compressor operating at near-zero rate: The encoder merely describes the indices of the few maximal source components, while the decoder's reconstruction is a natural estimate of the source components based on this information. This scheme turns out to be near-optimal for the memoryless Gaussian source in the sense of achieving the zero-rate slope of its distortion-rate function. Motivated by this finding, we then propose a scheme comprising of iterating the above lossy compressor on an appropriately transformed version of the difference between the source and its reconstruction from the previous iteration. The proposed scheme achieves the rate distortion function of the Gaussian memoryless source (under squared error distortion) when employed on any finite-variance ergodic source. It further possesses desirable properties we respectively refer to as infinitesimal successive refinability, ratelessness, and complete separability. Its storage and computation requirements are of order no more than n 2 /log β n per source symbol for β > 0 at both the encoder and decoder. Though the details of its derivation, construction, and analysis differ considerably, we discuss similarities between the proposed scheme and the recently introduced SPARC of Venkataramanan et al.