Recent studies reveal a significant theoretical link between variational
autoencoders (VAEs) and rate-distortion theory, notably in utilizing VAEs to
estimate the theoretical upper bound of the information rate-distortion
function of images. Such estimated theoretical bounds substantially exceed the
performance of existing neural image codecs (NICs). To narrow this gap, we
propose a theoretical bound-guided hierarchical VAE (BG-VAE) for NIC. The
proposed BG-VAE leverages the theoretical bound to guide the NIC model towards
enhanced performance. We implement the BG-VAE using Hierarchical VAEs and
demonstrate its effectiveness through extensive experiments. Along with
advanced neural network blocks, we provide a versatile, variable-rate NIC that
outperforms existing methods when considering both rate-distortion performance
and computational complexity. The code is available at BG-VAE.

基于理论边界指导的分层变分自动编码器 (BG-VAE) 通过引导神经图像编解码器 (NIC) 模型，利用率失真理论上边界来提升性能。通过实验证明，BG-VAE 在考虑率失真性能和计算复杂度时优于现有方法。

基于理论边界导向的分层 VAE 神经图像编解码器

Theoretical Bound-Guided Hierarchical VAE for Neural Image Codecs

Despite a short history, neural image codecs have been shown to surpass
classical image codecs in terms of rate-distortion performance. However, most
of them suffer from significantly longer decoding times, which hinders the
practical applications of neural image codecs. This issue is especially
pronounced when employing an effective yet time-consuming autoregressive
context model since it would increase entropy decoding time by orders of
magnitude. In this paper, unlike most previous works that pursue optimal RD
performance while temporally overlooking the coding complexity, we make a
systematical investigation on the rate-distortion-complexity (RDC) optimization
in neural image compression. By quantifying the decoding complexity as a factor
in the optimization goal, we are now able to precisely control the RDC
trade-off and then demonstrate how the rate-distortion performance of neural
image codecs could adapt to various complexity demands. Going beyond the
investigation of RDC optimization, a variable-complexity neural codec is
designed to leverage the spatial dependencies adaptively according to
industrial demands, which supports fine-grained complexity adjustment by
balancing the RDC tradeoff. By implementing this scheme in a powerful base
model, we demonstrate the feasibility and flexibility of RDC optimization for
neural image codecs.

本文通过量化解码复杂度作为优化目标，系统研究了神经图像编解码器的速率 - 失真 - 复杂度（RDC）优化，并设计了一个可变复杂度的神经编解码器，支持精细的复杂度调整，展示了 RDC 优化在神经图像编解码器中的可行性和灵活性。