Pith. sign in

REVIEW

Learned layered coding for Successive Refinement in the Wyner-Ziv Problem

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2311.03061 v1 pith:6CPWT3YQ submitted 2023-11-06 cs.LG cs.ITmath.IT

classification cs.LGcs.ITmath.IT
keywords codingwyner-zivapproachlayeredproblemrate-distortionboundexplicitly
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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.

Discussion (0). Sign in to comment.

Pith tools