English

Correcting the Sub-optimal Bit Allocation

Computer Vision and Pattern Recognition 2022-10-11 v2

Abstract

In this paper, we investigate the problem of bit allocation in Neural Video Compression (NVC). First, we reveal that a recent bit allocation approach claimed to be optimal is, in fact, sub-optimal due to its implementation. Specifically, we find that its sub-optimality lies in the improper application of semi-amortized variational inference (SAVI) on latent with non-factorized variational posterior. Then, we show that the corrected version of SAVI on non-factorized latent requires recursively applying back-propagating through gradient ascent, based on which we derive the corrected optimal bit allocation algorithm. Due to the computational in-feasibility of the corrected bit allocation, we design an efficient approximation to make it practical. Empirical results show that our proposed correction significantly improves the incorrect bit allocation in terms of R-D performance and bitrate error, and outperforms all other bit allocation methods by a large margin. The source code is provided in the supplementary material.

Cite

@article{arxiv.2209.14575,
  title  = {Correcting the Sub-optimal Bit Allocation},
  author = {Tongda Xu and Han Gao and Yuanyuan Wang and Hongwei Qin and Yan Wang and Jingjing Liu and Ya-Qin Zhang},
  journal= {arXiv preprint arXiv:2209.14575},
  year   = {2022}
}
R2 v1 2026-06-28T02:20:49.097Z