Learned layered coding for Successive Refinement in the Wyner-Ziv Problem
Not on the map. Why?
Abstract (arXiv)
We propose a data-driven approach to explicitly learn the progressive encoding of a continuous source, which is successively decoded with increasing levels of quality and with the aid of correlated side information. This setup refers to the successive refinement of the Wyner-Ziv coding problem. Assuming ideal Slepian-Wolf coding, our approach employs recurrent neural networks (RNNs) to learn layered encoders and decoders for the quadratic Gaussian case. The models are trained by minimizing a variational bound on the rate-distortion function of the successively refined Wyner-Ziv coding problem. We demonstrate that RNNs can explicitly retrieve layered binning solutions akin to scalable nested quantization. Moreover, the rate-distortion performance of the scheme is on par with the corresponding monolithic Wyner-Ziv coding approach and is close to the rate-distortion bound.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 9 of its 24 references that are in the map. First posted on arXiv 6 Nov 2023.
Builds on
9 of 24 references.
References · 9
- 2016The Concrete Distribution: A Continuous Relaxation of Discrete Random Variablescited by 1,135
- 2016End-to-end Optimized Image Compressioncited by 673
- 2016Full Resolution Image Compression with Recurrent Neural Networkscited by 170
- 2021Learned Gradient Compression for Distributed Deep Learningcited by 20
- 2022Neural Distributed Image Compression with Cross-Attention Feature Alignmentcited by 15
- 2021Neural Distributed Source Codingcited by 13
- 2023LDMIC: Learning-based Distributed Multi-view Image Codingcited by 13
- 2023Learned Wyner-Ziv Compressors Recover Binningcited by 2
- 2023Federated Neural Compression Under Heterogeneous Datacited by 1
Built on by
Not cited yet.