DocumentCode
2019699
Title
A Universal Wyner-Ziv Scheme for Discrete Sources
Author
Mali, S. ; Verdu, Sergio ; Weissman, T.
Author_Institution
Stanford Univ., Stanford
fYear
2007
fDate
24-29 June 2007
Firstpage
1951
Lastpage
1955
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.
Keywords
computational complexity; decoding; pulse compression; rate distortion theory; signal denoising; statistical analysis; DUDE algorithm; LZ compression; WZ coding algorithms; decoder side information; discrete sources; discrete universal denoiser algorithm; encoding; low complexity algorithm; rate-distortion coding; sliding window operation; universal Wyner-Ziv scheme; unknown statistics; Channel capacity; Decoding; Distortion; Image coding; Image reconstruction; Memoryless systems; Noise reduction; Rate-distortion; Signal design; Statistics;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2007. ISIT 2007. IEEE International Symposium on
Conference_Location
Nice
Print_ISBN
978-1-4244-1397-3
Type
conf
DOI
10.1109/ISIT.2007.4557154
Filename
4557154
Link To Document