A universal Wyner-Ziv scheme for discrete sources

Shirin Jalali; Sergio Verdú; Tsachy Weissman

doi:10.1109/ISIT.2007.4557154

A universal Wyner-Ziv scheme for discrete sources

Shirin Jalali, Sergio Verdú, Tsachy Weissman

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

6 Scopus citations

Abstract

We consider the Wyner-Ziv (WZ) problem of rate-distortion coding with decoder side information, for the case where the source statistics are unknown or non-existent. A new family of WZ coding algorithms is proposed and its universal optimality is proven. Encoding is based on a sliding window operation followed by LZ compression, while decoding is based on a natural extension of the Discrete Universal DEnoiser (DUDE) algorithm to the case where side information is present. The effectiveness of our approach is illustrated with experiments on binary images using a low complexity algorithm motivated by our class of universally optimal WZ codes.

Original language	English (US)
Title of host publication	Proceedings - 2007 IEEE International Symposium on Information Theory, ISIT 2007
Pages	1951-1955
Number of pages	5
DOIs	https://doi.org/10.1109/ISIT.2007.4557154
State	Published - 2007
Event	2007 IEEE International Symposium on Information Theory, ISIT 2007 - Nice, France Duration: Jun 24 2007 → Jun 29 2007

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
ISSN (Print)	2157-8101

Other

Other	2007 IEEE International Symposium on Information Theory, ISIT 2007
Country/Territory	France
City	Nice
Period	6/24/07 → 6/29/07

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Information Systems
Modeling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.2007.4557154

Cite this

@inproceedings{9585bc023ac34cc6a1e91d6c489f6a68,

title = "A universal Wyner-Ziv scheme for discrete sources",

abstract = "We consider the Wyner-Ziv (WZ) problem of rate-distortion coding with decoder side information, for the case where the source statistics are unknown or non-existent. A new family of WZ coding algorithms is proposed and its universal optimality is proven. Encoding is based on a sliding window operation followed by LZ compression, while decoding is based on a natural extension of the Discrete Universal DEnoiser (DUDE) algorithm to the case where side information is present. The effectiveness of our approach is illustrated with experiments on binary images using a low complexity algorithm motivated by our class of universally optimal WZ codes.",

author = "Shirin Jalali and Sergio Verd{\'u} and Tsachy Weissman",

year = "2007",

doi = "10.1109/ISIT.2007.4557154",

language = "English (US)",

isbn = "1424414296",

series = "IEEE International Symposium on Information Theory - Proceedings",

pages = "1951--1955",

booktitle = "Proceedings - 2007 IEEE International Symposium on Information Theory, ISIT 2007",

note = "2007 IEEE International Symposium on Information Theory, ISIT 2007 ; Conference date: 24-06-2007 Through 29-06-2007",

}

Jalali, S, Verdú, S & Weissman, T 2007, A universal Wyner-Ziv scheme for discrete sources. in Proceedings - 2007 IEEE International Symposium on Information Theory, ISIT 2007., 4557154, IEEE International Symposium on Information Theory - Proceedings, pp. 1951-1955, 2007 IEEE International Symposium on Information Theory, ISIT 2007, Nice, France, 6/24/07. https://doi.org/10.1109/ISIT.2007.4557154

TY - GEN

T1 - A universal Wyner-Ziv scheme for discrete sources

AU - Jalali, Shirin

AU - Verdú, Sergio

AU - Weissman, Tsachy

PY - 2007

Y1 - 2007

N2 - We consider the Wyner-Ziv (WZ) problem of rate-distortion coding with decoder side information, for the case where the source statistics are unknown or non-existent. A new family of WZ coding algorithms is proposed and its universal optimality is proven. Encoding is based on a sliding window operation followed by LZ compression, while decoding is based on a natural extension of the Discrete Universal DEnoiser (DUDE) algorithm to the case where side information is present. The effectiveness of our approach is illustrated with experiments on binary images using a low complexity algorithm motivated by our class of universally optimal WZ codes.

AB - We consider the Wyner-Ziv (WZ) problem of rate-distortion coding with decoder side information, for the case where the source statistics are unknown or non-existent. A new family of WZ coding algorithms is proposed and its universal optimality is proven. Encoding is based on a sliding window operation followed by LZ compression, while decoding is based on a natural extension of the Discrete Universal DEnoiser (DUDE) algorithm to the case where side information is present. The effectiveness of our approach is illustrated with experiments on binary images using a low complexity algorithm motivated by our class of universally optimal WZ codes.

UR - http://www.scopus.com/inward/record.url?scp=51649126201&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=51649126201&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2007.4557154

DO - 10.1109/ISIT.2007.4557154

M3 - Conference contribution

AN - SCOPUS:51649126201

SN - 1424414296

SN - 9781424414291

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 1951

EP - 1955

BT - Proceedings - 2007 IEEE International Symposium on Information Theory, ISIT 2007

T2 - 2007 IEEE International Symposium on Information Theory, ISIT 2007

Y2 - 24 June 2007 through 29 June 2007

ER -

A universal Wyner-Ziv scheme for discrete sources

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this