跳到正文
研踪PaperTrail
← 研踪 PaperTrail

CVF · CVPR 2026:cvf:a895f71d47caa20531e9f605e8669810 · 记录 #1

Block-based Learned Image Compression without Blocking Artifacts

来源日期(仅到年份) 2026
来源记录日期 2026
雷达观测 2026-11-05 03:25
CVF · CVPR 2026 ↗PDF ↗

摘要

Learned image compression (LIC) outperforms traditional codecs but suffers from excessive peak memory usage when handling high-resolution images. Consequently, block-based LIC has been studied to reduce peak memory and peak computational cost, but it often introduces blocking artifacts that degrade visual quality. To mitigate this, the JPEG-AI standard introduced a patch-based scheme in which overlapped blocks are coded independently using empirically determined overlap sizes. However, experimentally searching for optimal overlaps is time-consuming and does not guarantee blocking-free reconstruction. In this paper, we propose an analytic framework that models overlap propagation through convolution and transposed convolution layers to precisely determine the minimal overlaps required for blocking-free reconstruction. Based on the calculated minimum overlaps, we provide a block-based implementation methodology applicable to most CNN-based LIC models. Applied to four CNN-based LIC models on 4K images partitioned into various block sizes (256 x 256, 512 x 512), our method achieves rate-distortion performance identical to full-image coding while reducing average peak memory usage to 13.94% (encoder) and 13.33% (decoder), and average peak computational cost to 2.6% and 1.24%, respectively. Notably, the proposed block-based framework does not require any retraining of the original model. Furthermore, it can also be applied to most CNN-based image-processing neural networks without performance degradation.

论文发现出处

这些页面提供论文线索,不代表同行评审或质量认证。

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

发表信息与关联版本

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

平台记录号代表本站观测到的元数据变化,不是作者修订号。来源日期仅到月份或年份时,按该月或该年首日存档。

记录 #1 · 2026 · 最新观测版本

Block-based Learned Image Compression without Blocking Artifacts

Learned image compression (LIC) outperforms traditional codecs but suffers from excessive peak memory usage when handling high-resolution images. Consequently, block-based LIC has been studied to reduce peak memory and peak computational cost, but it often introduces blocking artifacts that degrade visual quality. To mitigate this, the JPEG-AI standard introduced a patch-based scheme in which overlapped blocks are coded independently using empirically determined overlap sizes. However, experimentally searching for optimal overlaps is time-consuming and does not guarantee blocking-free reconstruction. In this paper, we propose an analytic framework that models overlap propagation through convolution and transposed convolution layers to precisely determine the minimal overlaps required for blocking-free reconstruction. Based on the calculated minimum overlaps, we provide a block-based implementation methodology applicable to most CNN-based LIC models. Applied to four CNN-based LIC models on 4K images partitioned into various block sizes (256 x 256, 512 x 512), our method achieves rate-distortion performance identical to full-image coding while reducing average peak memory usage to 13.94% (encoder) and 13.33% (decoder), and average peak computational cost to 2.6% and 1.24%, respectively. Notably, the proposed block-based framework does not require any retraining of the original model. Furthermore, it can also be applied to most CNN-based image-processing neural networks without performance degradation.

查看此版本解读 →查看此版本原文 ↗