提出连续块拼接方法,消除块压缩的伪影并降低计算开销。
Continuous Patch Stitching for Block-wise Image Compression
- 无填充并行重叠拼接,保证块间连续性。
- 在同等性能下计算资源不足现有模型一半。
- 适合高分辨率图像高效压缩场景。
近期,学习型图像压缩方法已超越传统手写标准编解码器。然而,其推理通常需整图输入,计算开销大,尤其在高分辨率压缩时;若分块压缩,则现有方法会产生块伪影。为此,本文提出一种新的连续块拼接(CPS)框架,实现无缝块拼接并数学上消除块伪影,显著降低压缩所需计算资源。该框架全程采用无填充操作,结合新提出的并行重叠拼接策略,提供通用上界以保证连续性。在此基础上,进一步设计偶数尺寸核的功能残差块实现下采样与上采样,以及保持特征尺寸的瓶颈残差块以增加网络深度。实验表明,本框架在性能上达到当前最佳水平,同时计算资源需求不足现有模型的一半。代码将在接受后发布。
原文摘要 · Abstract (English)
Most recently, learned image compression methods have outpaced traditional hand-crafted standard codecs. However, their inference typically requires to input the whole image at the cost of heavy computing resources, especially for high-resolution image compression; otherwise, the block artefact can exist when compressed by blocks within existing learned image compression methods. To address this issue, we propose a novel continuous patch stitching (CPS) framework for block-wise image compression that is able to achieve seamlessly patch stitching and mathematically eliminate block artefact, thus capable of significantly reducing the required computing resources when compressing images. More specifically, the proposed CPS framework is achieved by padding-free operations throughout, with a newly established parallel overlapping stitching strategy to provide a general upper bound for ensuring the continuity. Upon this, we further propose functional residual blocks with even-sized kernels to achieve down-sampling and up-sampling, together with bottleneck residual blocks retaining feature size to increase network depth. Experimental results demonstrate that our CPS framework achieves the state-of-the-art performance against existing baselines, whilst requiring less than half of computing resources of existing models. Our code shall be released upon acceptance.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。