arXiv:2502.20161eess.IVcs.CV2025-02CVPR被引 8

解决深度图像压缩中率失真优化不平衡问题,提升压缩效率

Balanced Rate-Distortion Optimization in Learned Image Compression

  • 将率失真优化转为多目标问题,自适应调整梯度以平衡率与失真
  • 实验显示可降低约2%的BD-Rate,训练开销可控
  • 适合从头训练或微调现有压缩模型,方法灵活实用

基于深度学习的图像压缩(LIC)虽取得显著进展,但标准率失真(R-D)优化常因率与失真目标梯度差异导致更新不平衡,致使某一目标主导,影响整体压缩效率。为此,本文将R-D优化重构为多目标优化(MOO)问题,提出两种平衡的R-D优化策略:第一种采用粗到精的梯度下降路径,适用于从零训练LIC模型;第二种将重构问题建模为带等式约束的二次规划,适合微调已有模型。实验表明,两种方法均能提升LIC模型的R-D性能,实现约2%的BD-Rate降低,且附加训练成本可接受,显著改善优化过程的均衡性与效率。代码将在https://gitlab.com/viper-purdue/Balanced-RD公开。

原文摘要 · Abstract (English)

Learned image compression (LIC) using deep learning architectures has seen significant advancements, yet standard rate-distortion (R-D) optimization often encounters imbalanced updates due to diverse gradients of the rate and distortion objectives. This imbalance can lead to suboptimal optimization, where one objective dominates, thereby reducing overall compression efficiency. To address this challenge, we reformulate R-D optimization as a multi-objective optimization (MOO) problem and introduce two balanced R-D optimization strategies that adaptively adjust gradient updates to achieve more equitable improvements in both rate and distortion. The first proposed strategy utilizes a coarse-to-fine gradient descent approach along standard R-D optimization trajectories, making it particularly suitable for training LIC models from scratch. The second proposed strategy analytically addresses the reformulated optimization as a quadratic programming problem with an equality constraint, which is ideal for fine-tuning existing models. Experimental results demonstrate that both proposed methods enhance the R-D performance of LIC models, achieving around a 2\% BD-Rate reduction with acceptable additional training cost, leading to a more balanced and efficient optimization process. Code will be available at https://gitlab.com/viper-purdue/Balanced-RD.

图像压缩率失真优化深度学习多目标优化

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。