A Universal Scheme for Wyner–Ziv Coding of Discrete Sources

Author

Jalali, Shirin ; Verdú, Sergio ; Weissman, Tsachy

Author_Institution

California Inst. of Technol., Center for the Math. of Inf., Pasadena, CA, USA

Volume

56

Issue

4

fYear

2010

fDate

4/1/2010 12:00:00 AM

Firstpage

1737

Lastpage

1750

Abstract

We consider the Wyner-Ziv (WZ) problem of lossy compression where the decompressor observes a noisy version of the source, whose statistics are unknown. A new family of WZ coding algorithms is proposed and their universal optimality is proven. Compression consists of sliding-window processing followed by Lempel-Ziv (LZ) compression, while the decompressor is based on a modification of the discrete universal denoiser (DUDE) algorithm to take advantage of side information. The new algorithms not only universally attain the fundamental limits, but also suggest a paradigm for practical WZ coding. The effectiveness of our approach is illustrated with experiments on binary images, and English text using a low complexity algorithm motivated by our class of universally optimal WZ codes.

Keywords

signal denoising; source coding; DUDE algorithm; Lempel-Ziv compression; Wyner-Ziv coding; discrete universal denoiser algorithm; lossy compression; sliding-window processing; Channel capacity; Channel coding; Decoding; Distortion; Image reconstruction; Memoryless systems; Noise reduction; Rate-distortion; Signal design; Statistics; Discrete denoising; Wyner–Ziv coding; rate-distortion function; sliding-window coding; universal algorithm;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/TIT.2010.2040889

Filename

5437417