| 基于稀疏表示的图像超分辨率重建快速算法 |
| |
| 引用本文： | 孙玉宝,韦志辉,肖亮,张铮嵘. 基于稀疏表示的图像超分辨率重建快速算法[J]. 系统工程与电子技术, 2010, 32(12): 2696-2700. DOI: 10.3969/j.issn.1001-506X.2010.12.41 |
| |
| 作者姓名： | 孙玉宝 韦志辉 肖亮 张铮嵘 |
| |
| 作者单位： | 1. 南京理工大学计算机科学与技术学院， 江苏 南京 210094;2. 中国人民解放军总参谋部第六十研究所三维仿真实验室, 江苏 南京210016 |
| |
| 基金项目： | 国家高技术研究发展计划(863计划)，国家自然科学基金，江苏省研究生创新基金资助课题 |
| |
| 摘 要： | 基于图像在过完备字典下的稀疏表示，建立了稀疏性正则化的多帧图像超分辨凸变分模型。模型中的正则项刻画了理想图像的稀疏性先验约束，保真项度量其在退化模型下与观测图像的一致性。基于线性化Bregman方法，将正则项替换为其Bregman距离，对保真项进行线性化，从而可将原问题解耦，进而提出求解该模型的两步迭代算法:第一步为仅对正则项的阈值收缩操作，第二步为仅对保真项的梯度下降操作。此方法大幅度降低了计算复杂性，并能够对噪声保持鲁棒。实验结果表明,只需较少次数的迭代就可获得很好的超分辨重建结果，验证了本文模型与算法的有效性。
|
| 关 键 词： | 超分辨率 稀疏表示 过完备字典 线性化Bregman |
Fast image super-resolution reconstruction algorithm using sparse representations |
| |
| SUN Yu-bao,WEI Zhi-hui,XIAO Liang,ZHANG Zheng-rong. Fast image super-resolution reconstruction algorithm using sparse representations[J]. System Engineering and Electronics, 2010, 32(12): 2696-2700. DOI: 10.3969/j.issn.1001-506X.2010.12.41 |
| |
| Authors: | SUN Yu-bao WEI Zhi-hui XIAO Liang ZHANG Zheng-rong |
| |
| Affiliation: | 1. School of Computer Science and Technology, Nanjing Univ. of Science and Technology, Nanjing 210094, China;;2. Lab. of Three Dimensional Simulation, 60th Inst. of General Staff Dept. of PLA, Nanjing 210016, China |
| |
| Abstract: | In terms of sparse representations of the underlying image in an over-complete dictionary, a sparsity regularized convex variational model for multi-frame image super-resolution is proposed. The regularization term constrains the underlying image to have a sparse representation in a proper over-complete dictionary. The fidelity term restricts the consistency with the measured image in terms of the data degradation model. Furthermore, by replacing the regularization term with its Bregman distance and linearizing the fidelity term, this convex variational problem is decoupled and a fast two step numerical iteration algorithm is proposed to solve it in terms of the linearized Bregman method. The first step is threshold shrinkage with respect to only the regularization term and the second step is to use the gradient descent dealing with only the fidelity term, thus the numerical complexity is decreased rapidly and is robust to noise. Numerical results for optics images demonstrate that only a few iterations can obtain very well results, thus both our super-resolution model and numerical algorithm are effective. |
| |
| Keywords: | super-resolution sparse representation over-complete dictionary linearized Bregman method |
| 本文献已被 万方数据 等数据库收录！ |
| 点击此处可从《系统工程与电子技术》浏览原始摘要信息 |
|
点击此处可从《系统工程与电子技术》下载全文 |
