用可学习掩码实现细粒度渐进图像压缩,提升重建质量并降低计算开销。
Efficient Progressive Image Compression with Variance-aware Masking
- 通过基质与顶质隐表示的差值构建残差表示,实现逐元素级渐进压缩。
- 在相同比特率下,重建质量优于主流方法,且参数量和解码时间大幅减少。
- 适合对低延迟、高效率图像传输有需求的应用场景,如实时视频通信。
学习型渐进图像压缩正日益受到关注,因为它允许接收端在解码更多比特时获得更优的图像重建效果。本文提出一种渐进式图像压缩方法:首先将图像表示为基质质量与顶质质量的隐表示对;接着编码两者之间的逐元素差值作为残差隐表示。通过引入无额外参数的掩码系统,按重要性从高到低排序残差元素,并将其划分为互补组件,可分别传输至解码器以实现不同重建质量。接收端可独立用超先验架构预测的均值替换未传输的顶质隐表示元素,确保任意中间质量水平下的可靠重建。此外,我们设计了速率增强模块(REMs),利用已解码组件优化熵参数估计。实验结果表明,本方法在性能上媲美当前最优方案,同时显著降低计算复杂度、解码时间和参数数量。
原文摘要 · Abstract (English)
Learned progressive image compression is gaining momentum as it allows improved image reconstruction as more bits are decoded at the receiver. We propose a progressive image compression method in which an image is first represented as a pair of base-quality and top-quality latent representations. Next, a residual latent representation is encoded as the element-wise difference between the top and base representations. Our scheme enables progressive image compression with element-wise granularity by introducing a masking system that ranks each element of the residual latent representation from most to least important, dividing it into complementary components, which can be transmitted separately to the decoder in order to obtain different reconstruction quality. The masking system does not add further parameters nor complexity. At the receiver, any elements of the top latent representation excluded from the transmitted components can be independently replaced with the mean predicted by the hyperprior architecture, ensuring reliable reconstructions at any intermediate quality level. We also introduced Rate Enhancement Modules (REMs), which refine the estimation of entropy parameters using already decoded components. We obtain results competitive with state-of-the-art competitors, while significantly reducing computational complexity, decoding time, and number of parameters.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。