Optimizing Learned Image Compression on Scalar and Entropy-Constraint Quantization
Florian Borzechowski, Michael Sch\"afer, Heiko Schwarz, Jonathan Pfaff, Detlev Marpe, Thomas Wiegand

TL;DR
This paper introduces a finetuning method for learned image codecs that improves rate-distortion performance by retraining on quantized latents, especially for entropy-constraint quantizers, without increasing complexity.
Contribution
It proposes a novel retraining step on quantized data to better model quantization noise, enhancing compression efficiency for learned codecs.
Findings
Achieved 1-2% bitrate savings on Kodak dataset.
Improved compression for entropy-constraint quantizers.
No increase in inference complexity.
Abstract
The continuous improvements on image compression with variational autoencoders have lead to learned codecs competitive with conventional approaches in terms of rate-distortion efficiency. Nonetheless, taking the quantization into account during the training process remains a problem, since it produces zero derivatives almost everywhere and needs to be replaced with a differentiable approximation which allows end-to-end optimization. Though there are different methods for approximating the quantization, none of them model the quantization noise correctly and thus, result in suboptimal networks. Hence, we propose an additional finetuning training step: After conventional end-to-end training, parts of the network are retrained on quantized latents obtained at the inference stage. For entropy-constraint quantizers like Trellis-Coded Quantization, the impact of the quantizer is particularly…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsSparse Evolutionary Training
