End-to-end Learned Image Compression with Fixed Point Weight Quantization
Heming Sun, Zhengxue Cheng, Masaru Takeuchi, Jiro Katto

TL;DR
This paper introduces a fixed-point quantized learned image compression model that significantly reduces model size with minimal loss, outperforming traditional codecs like BPG in MS-SSIM.
Contribution
It is the first to fully explore and evaluate LIC with 8-bit fixed-point weights, proposing novel quantization and fine-tuning schemes.
Findings
75% model size reduction compared to 32-bit models
Small coding loss due to quantization
Outperforms BPG in MS-SSIM
Abstract
Learned image compression (LIC) has reached the traditional hand-crafted methods such as JPEG2000 and BPG in terms of the coding gain. However, the large model size of the network prohibits the usage of LIC on resource-limited embedded systems. This paper presents a LIC with 8-bit fixed-point weights. First, we quantize the weights in groups and propose a non-linear memory-free codebook. Second, we explore the optimal grouping and quantization scheme. Finally, we develop a novel weight clipping fine tuning scheme. Experimental results illustrate that the coding loss caused by the quantization is small, while around 75% model size can be reduced compared with the 32-bit floating-point anchor. As far as we know, this is the first work to explore and evaluate the LIC fully with fixed-point weights, and our proposed quantized LIC is able to outperform BPG in terms of MS-SSIM.
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
TopicsAdvanced Data Compression Techniques · Advanced Vision and Imaging · Image and Signal Denoising Methods
