检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:印珏泽 周宁宁[1] YIN Jue-Ze;ZHOU Ning-Ning(School of Computer Science,Nanjing University of Posts and Telecommunications,Nanjing 210023,China)
出 处:《计算机系统应用》2023年第2期111-118,共8页Computer Systems & Applications
摘 要:针对单幅图像超分辨率(single image super-resolution,SISR)重建算法存在低分辨率图像(LR)到高分辨率图像(HR)的映射学习具有不适定性,深层神经网络收敛慢且缺乏对高频信息的学习能力以及在深层神经网络传播过程中图像特征信息存在丢失的问题.本文提出了基于对偶回归和残差注意力机制的图像超分辨率重建网络.首先,通过对偶回归约束映射空间.其次,融合通道和空间注意力机制构造了残差注意力模块(RCSAB),加快模型收敛速度的同时,有效增强了对高频信息的学习.最后,融入密集特征融合模块,增强了特征信息流动性.在Set5、Set14、BSD100、Urban100四种基准数据集上与目前主流的单幅图像超分辨率算法进行对比,实验结果表明该方法无论是在客观质量评价指标还是主观视觉效果均优于对比算法.The single image super-resolution(SISR)reconstruction algorithm is ill-posed in the mapping learning from low-resolution(LR)image to high-resolution(HR)image,and the deep neural network has slow convergence and lacks the ability to learn high-frequency information.Moreover,image feature information tends to be lost during deep neural network propagation.In order to address these issues,this study proposes an image super-resolution reconstruction network based on dual regression and residual attention mechanism.Firstly,the mapping space is constrained by dual regression.Secondly,a residual attention module(RCSAB)is constructed by combining channel and spatial attention mechanisms,which not only accelerates the model convergence speed and effectively strengthens the learning of highfrequency information.Finally,a dense feature fusion module is introduced to enhance the fluidity of feature information.In addition,a comparison with the mainstream SISR algorithms is carried out on four benchmark datasets,namely,Set5,Set14,BSD100,and Urban100,and experimental results demonstrate that the proposed method is superior to other algorithms in terms of objective evaluation metrics and subjective visual effects.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.222.24.251