提出可自适应优化的格子向量量化方法,提升神经图像压缩性能。
Learning Optimal Lattice Vector Quantizers for End-to-end Neural Image Compression
- 基于隐变量统计特性学习最优格子量化码本
- 在保持计算效率的同时显著改善率失真性能
- 适合追求高效高质图像压缩的研究者与工程师
当前端到端神经图像压缩普遍采用均匀标量量化,因其计算复杂度低。而格子向量量化(LVQ)虽能更有效捕捉特征间依赖关系且计算开销接近标量量化,但传统结构针对均匀分布设计,无法适配神经压缩中隐变量的真实分布。本文提出一种新学习方法,根据待压缩隐变量样本统计特性,构建率失真最优的格子向量量化(OLVQ)码本。该方法使LVQ结构更好地匹配实际分布,在不牺牲计算效率的前提下,显著提升现有神经图像压缩方案的率失真表现。
原文摘要 · Abstract (English)
It is customary to deploy uniform scalar quantization in the end-to-end optimized Neural image compression methods, instead of more powerful vector quantization, due to the high complexity of the latter. Lattice vector quantization (LVQ), on the other hand, presents a compelling alternative, which can exploit inter-feature dependencies more effectively while keeping computational efficiency almost the same as scalar quantization. However, traditional LVQ structures are designed/optimized for uniform source distributions, hence nonadaptive and suboptimal for real source distributions of latent code space for Neural image compression tasks. In this paper, we propose a novel learning method to overcome this weakness by designing the rate-distortion optimal lattice vector quantization (OLVQ) codebooks with respect to the sample statistics of the latent features to be compressed. By being able to better fit the LVQ structures to any given latent sample distribution, the proposed OLVQ method improves the rate-distortion performances of the existing quantization schemes in neural image compression significantly, while retaining the amenability of uniform scalar quantization.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。