用结构相似性启发的展开法,实现轻量级图像超分辨率
Structural Similarity-Inspired Unfolding for Lightweight Image Super-Resolution
- 通过展开优化函数,引入结构相似性约束提升细节还原
- 参数量更低、内存占用更少,性能超越当前最先进方法
- 适合部署在资源受限设备的高效超分模型
数据驱动的图像超分辨率主要通过扩展感受野来捕捉上下文信息,但通常依赖更深网络或基于Transformer的注意力机制,导致模型复杂度上升。相比之下,基于展开范式的模型驱动方法可通过精巧模块设计,在保持模型紧凑的同时提升性能。为此,我们提出结构相似性启发的展开(SSIU)方法,旨在融合数据驱动与模型驱动的优势。该方法通过展开受结构相似性约束的超分辨率优化函数,逐步迭代求解。每轮包含多个多尺度门控模块(MSGM)和高效稀疏注意力模块(ESAM),前者施加结构相似性等特征约束,后者实现稀疏激活。此外,设计基于专家混合的特征选择器(MoE-FS),融合多阶段特征以充分利用多层次信息。大量实验验证了所提方法的有效性与高效性:模型在性能上优于现有最先进方法,同时参数量更低、内存消耗更少。
原文摘要 · Abstract (English)
Major efforts in data-driven image super-resolution (SR) primarily focus on expanding the receptive field of the model to better capture contextual information. However, these methods are typically implemented by stacking deeper networks or leveraging transformer-based attention mechanisms, which consequently increases model complexity. In contrast, model-driven methods based on the unfolding paradigm show promise in improving performance while effectively maintaining model compactness through sophisticated module design. Based on these insights, we propose a Structural Similarity-Inspired Unfolding (SSIU) method for efficient image SR. This method is designed through unfolding an SR optimization function constrained by structural similarity, aiming to combine the strengths of both data-driven and model-driven approaches. Our model operates progressively following the unfolding paradigm. Each iteration consists of multiple Mixed-Scale Gating Modules (MSGM) and an Efficient Sparse Attention Module (ESAM). The former implements comprehensive constraints on features, including a structural similarity constraint, while the latter aims to achieve sparse activation. In addition, we design a Mixture-of-Experts-based Feature Selector (MoE-FS) that fully utilizes multi-level feature information by combining features from different steps. Extensive experiments validate the efficacy and efficiency of our unfolding-inspired network. Our model outperforms current state-of-the-art models, boasting lower parameter counts and reduced memory consumption. Our code will be available at: https://github.com/eezkni/SSIU
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。