Image Super-Resolution via Double Sparsity Regularized Manifold Learning

被引:81
作者
Lu, Xiaoqiang [1 ]
Yuan, Yuan [1 ]
Yan, Pingkun [1 ]
机构
[1] Chinese Acad Sci, Ctr Opt Imagery Anal & Learning, Xian Inst Opt & Precis Mech, State Key Lab Transient Opt & Photon, Xian 710119, Peoples R China
基金
中国国家自然科学基金;
关键词
Double sparsity; manifold learning; single-image super-resolution (SR); sparse coding; QUALITY ASSESSMENT; ALGORITHM; REPRESENTATIONS; INTERPOLATION; ROBUST;
D O I
10.1109/TCSVT.2013.2244798
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Over the past few years, high resolutions have been desirable or essential, e. g., in online video systems, and therefore, much has been done to achieve an image of higher resolution from the corresponding low-resolution ones. This procedure of recovering/rebuilding is called single-image super-resolution (SR). Performance of image SR has been significantly improved via methods of sparse coding. That is to say, the image frame patch can be sparse linear combinations of basis elements. However, most of these existing methods fail to consider the local geometrical structure in the space of the training data. To take this crucial issue into account, this paper proposes a method named double sparsity regularized manifold learning (DSRML). DSRML can preserve the properties of the aforementioned local geometrical structure by employing manifold learning, e. g., locally linear embedding. Based on a large amount of experimental results, DSRML is demonstrated to be more robust and more effective than previous efforts in the task of single-image SR.
引用
收藏
页码:2022 / 2033
页数:12
相关论文
共 42 条
  • [1] K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation
    Aharon, Michal
    Elad, Michael
    Bruckstein, Alfred
    [J]. IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2006, 54 (11) : 4311 - 4322
  • [2] [Anonymous], 2009, Advances in Neural Information Processing Systems
  • [3] Limits on super-resolution and how to break them
    Baker, S
    Kanade, T
    [J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2002, 24 (09) : 1167 - 1183
  • [4] Belkin M, 2002, ADV NEUR IN, V14, P585
  • [5] Robust uncertainty principles:: Exact signal reconstruction from highly incomplete frequency information
    Candès, EJ
    Romberg, J
    Tao, T
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (02) : 489 - 509
  • [6] Neighbor embedding based super-resolution algorithm through edge detection and feature selection
    Chan, Tak-Ming
    Zhang, Junping
    Pu, Jian
    Huang, Hua
    [J]. PATTERN RECOGNITION LETTERS, 2009, 30 (05) : 494 - 502
  • [7] Chan TM, 2006, LECT NOTES COMPUT SC, V3832, P756
  • [8] Super-resolution through neighbor embedding
    Chang, H
    Yeung, DY
    Xiong, Y
    [J]. PROCEEDINGS OF THE 2004 IEEE COMPUTER SOCIETY CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION, VOL 1, 2004, : 275 - 282
  • [9] Atomic decomposition by basis pursuit
    Chen, SSB
    Donoho, DL
    Saunders, MA
    [J]. SIAM JOURNAL ON SCIENTIFIC COMPUTING, 1998, 20 (01) : 33 - 61
  • [10] A direct formulation for sparse PCA using semidefinite programming
    d'Aspremont, Alexandre
    El Ghaoui, Laurent
    Jordan, Michael I.
    Lanckriet, Gert R. G.
    [J]. SIAM REVIEW, 2007, 49 (03) : 434 - 448