IVCVITLGMay 30, 2023

On the Choice of Perception Loss Function for Learned Video Compression

arXiv:2305.19301v219 citations
Originality Incremental advance
AI Analysis

This work addresses the challenge of optimizing video compression for realism in low-latency applications, though it is incremental as it builds on prior approaches to perception loss functions.

The paper tackles the problem of choosing perception loss functions for learned video compression, showing that the choice significantly affects reconstruction quality, especially at low-bit rates, with PLF-JD preserving temporal correlation but increasing distortion compared to PLF-FMD. It also demonstrates that encoded representations trained without a specific PLF can be near-universal, achieving close to optimal reconstructions for either PLF at the decoder.

We study causal, low-latency, sequential video compression when the output is subjected to both a mean squared-error (MSE) distortion loss as well as a perception loss to target realism. Motivated by prior approaches, we consider two different perception loss functions (PLFs). The first, PLF-JD, considers the joint distribution (JD) of all the video frames up to the current one, while the second metric, PLF-FMD, considers the framewise marginal distributions (FMD) between the source and reconstruction. Using information theoretic analysis and deep-learning based experiments, we demonstrate that the choice of PLF can have a significant effect on the reconstruction, especially at low-bit rates. In particular, while the reconstruction based on PLF-JD can better preserve the temporal correlation across frames, it also imposes a significant penalty in distortion compared to PLF-FMD and further makes it more difficult to recover from errors made in the earlier output frames. Although the choice of PLF decisively affects reconstruction quality, we also demonstrate that it may not be essential to commit to a particular PLF during encoding and the choice of PLF can be delegated to the decoder. In particular, encoded representations generated by training a system to minimize the MSE (without requiring either PLF) can be {\em near universal} and can generate close to optimal reconstructions for either choice of PLF at the decoder. We validate our results using (one-shot) information-theoretic analysis, detailed study of the rate-distortion-perception tradeoff of the Gauss-Markov source model as well as deep-learning based experiments on moving MNIST and KTH datasets.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes