期刊文献+

运用稀疏表示法进行单幅图像超分辨的内点方法(英文) 被引量:1

An Interior Point Method for Image Super-resolution via Sparse Representation
在线阅读 下载PDF
导出
摘要 稀疏表示法在单幅图像超分辨率重建问题中受到广泛的关注。本文介绍了一种使用稀疏表示进行超分辨率图像重建的方案。该方案首先由低分辨率的输入图像块求取稀疏表示系数,然后根据此系数生成对应的高分辨率图像块,最后由高分辨率块重建出整幅图像。在求取稀疏表示系数时,本文采用了一种借助预处理共轭梯度算法计算搜索方向的内点方法。仿真结果表明,本方案在视觉感受和客观量化两方面都比现有的双三次插值法和最小角度回归(LARS)法具有更好的性能。与双三次插值法和LARS法相比,本方法所得图像的均方根误差(RMSE)值通常可以分别改善0.29和0.7。 A lot of attention has been paid to sparse representation in single image super-resolution. A scheme is employed to implement the image super-resolution via sparse representation. First, the sparse representation from low-resolution / input patches is sought by sparse representation algorithms. Then the corresponding high-resolution outputs are generated from them. Finally, the whole high-resolution image from patches is reconstructed. To get the sparse coefficients, an Interior Point Method (1PM) is adopted, which uses preconditioned conjugate gradients algorithm to compute the search direction. Simulation results show that our scheme outperforms the existing bicubic interpolation, Least Angle Regression (LARS) and other algorithms in both visually and qualitative evaluations. Typical Root-Mean-Square Error (RMSE) reduction of 0.29 and 0.7 is achieved over Bicubic and LARS algorithms, respectively.
出处 《光电工程》 CAS CSCD 北大核心 2012年第6期125-130,共6页 Opto-Electronic Engineering
基金 国家自然科学基金(61075013) 中国博士后科学基金资助项目(20100471671)
关键词 稀疏表示 图像超分辨率重建 内点法 预处理共轭梯度法 sparse representation image super-resolution reconstruction interior point method preconditioned conjugate gradients
  • 相关文献

参考文献13

  • 1SUN Jian, XU Zong-ben, SHUM Heung-yeung. Image super-resolution using gradient profile prior [C]//IEEE Conference on Computer Vision and Pattern Recognition, Anchorage, Alaska, USA, June 24-26, 2008: 1-8.
  • 2FREEMAN W T, JONES T R, PASZTOR E C. Example-based super-resolution [J]. IEEE Computer Graphics and Applications(S0272-1716), 2002, 22(2): 56-65.
  • 3CHANG Hong, YEUNG Dit-yan, XIONG Yi-min. Super-resolution through neighbor embedding [J]. Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, Washington, D C, USA, June 27-July02, 2004, 1: 275-282.
  • 4MALLTAT S G, ZHANG Zhi-feng. Matching pursuits with time-frequency dictionaries [J]. IEEE Transactions on Signal Processing(S1053-587X), 1993, 41(12): 3397-3415.
  • 5PATI Y C, REZAIIFAR R, KRISHNAPRASAD P S. Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition [C]// 1993 Conference Record of The Twenty-Seventh Asilomar Conference on Signals, Systems and Computers, Nov 1-3, 1993, 1: 40-44.
  • 6DONOHO D L, TSAIG Y, DRORI I, et al. Sparse solution of underdetermined system of linear equations by stagewise orthogonal matching pursuit [J]. IEEE Transactions on Information Theory(S0018-9448), 2012, 58(2): 1094-1121.
  • 7CHEN S S, DONOHO D L, SAUNDERS M A. Atomic decomposition by basis pursuit [J]. SIAM Journal on Scientific Computing(S1064-8275), 1999, 20(1): 33-61.
  • 8EFRON B, HASTIE T, JOHNSTONE I, et al. Least angle regression [J]. Annals of Statistics(S0090-5364), 2004, 32(2): 407-451.
  • 9DAUBECHIES I, DEVORE R, FORNASIER M, et al. Iteratively reweighted least squares minimization for sparse recovery [J]. Communications on Pure and Applied Mathematies(S 1097-0312), 2010, 63(1): 1-38.
  • 10KOH K, KIM S J, BOYD S. An interior-point method for large-scale el-regularized logistic regression [J]. Journal of Machlnelearning research(S1532-4435), 2007, 8(8): 1519-1555.

同被引文献21

  • 1ELAD M, AHARON M. Image denoising via sparse and redundant representation over learned dictionaries [J]. IEEE Transactions on Image Processing(S1057-7149), 2006, 15(12): 3736-3745.
  • 2ZHAO M, LI S T. Hybrid inpainting algorithm based on sparse representation and fast inpainting method [J]. International Journal of Digital Content Teehnology and its Applications(S1975-9339), 2011, 5(7): 239-247.
  • 3YANG J C, WRIGHT J, HUANG T, et al. Image super-resolution as sparse representation of raw image patches [C]//IEEE Computer Vision and Pattern Recognition (CVPR), June 23-28, 2008, 6:1-81.
  • 4YANG J C, WRIGHT J, HUANG T, et al. Image super-resolution via sparse representation [J]. IEEE Transactions on Image Processing(S1057-7149), 2010, 19(10: 2861-2873.
  • 5YANG J C, WANG Z W, LIN Z, et al. Coupled dictionary training for image super-resolution [J]. IEEE Transactions on Image Processing(S1057-7149), 2012, 21(8): 3467-3478.
  • 6ZEYDE R, ELAD M, PROTTER M. On single image scale-up using sparse-representations [C]// Lecture Notes in Computer Science: Curves & Surfaces, Avignon, France, 2010: 1-22.
  • 7GAO S H, TSANG I W H, CHIA L T, et al. Local features are not lonely-Laplacian sparse coding for image classification [C]// CVPR, 2010, 6: 3551-3561.
  • 8WANG J J, YANG J C, YU K, et al. Locality-constrained linear coding for image classification [C]//CVPR, 2010, 6: 3360-3367.
  • 9DONG W S, ZHANG L, SHI G M. Centralized sparse representation for image restoration [C]// IEEE International Conference on Computer Vision (ICCV), Nov 6-13, 2011, 11: 1259-1266.
  • 10WRIGHT J, MAY. Dense error correction via ll minimization [J]. IEEE Transactions on Information Theory(S0018-9448), 2010, 56(7): 3540-3560.

引证文献1

二级引证文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部