Iterative Relaxed Collaborative Representation With Adaptive Weights Learning for Noise Robust Face Hallucination

被引:20
作者
Liu, Licheng [1 ]
Li, Shutao [1 ]
Chen, C. L. Philip [2 ,3 ,4 ]
机构
[1] Hunan Univ, Coll Elect & Informat Engn, Changsha 410082, Hunan, Peoples R China
[2] Univ Macau, Fac Sci & Technol, Macau 999078, Peoples R China
[3] Dalian Maritime Univ, Nav Coll, Dalian 116026, Peoples R China
[4] Chinese Acad Sci, Inst Automat, State Key Lab Management & Control Complex Syst, Beijing 100080, Peoples R China
基金
中国国家自然科学基金;
关键词
Relaxed collaborative representation; face hallucination; locality regularization; adaptively weights learning; noise robust coding; IMAGE SUPERRESOLUTION; SPARSE REPRESENTATION; RECOGNITION; ALGORITHM; EQUATIONS; SYSTEMS; MODEL;
D O I
10.1109/TCSVT.2018.2829758
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In recent years, the collaborative representation (CR)-based techniques have been widely employed for face hallucination. However, the conventional CR model becomes less efficient in handling noisy low-resolution face images. In this paper, an iterative relaxed CR (iRCR) model with adaptive weights learning is presented to enhance the resolution of face images corrupted by noise. The core idea of iRCR is that a diagonal weight matrix is incorporated into the objective function, which helps to debase the influence of noise in representation. Different from existing collaborative methods with reweighting strategy where the weights require manually tuning, the weights in iRCR are adaptively learned to stay more consistent with the model error. Moreover, considering the local manifold structure property and nonlocal prior of small patches, the locality regularization and collaborative regularization are incorporated into a unified framework. This enables the proposed iRCR not only to capture the true topology structure of patch manifold but also to exploit the meaningful patterns among the whole training samples for reconstruction. Experimental results on both face dataset and real-world images demonstrate the superiority of our proposed method over several state-of-the-art face hallucination methods.
引用
收藏
页码:1284 / 1295
页数:12
相关论文
共 59 条
  • [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], 2015, IEEE T CIRCUITS SYST
  • [3] [Anonymous], KNOWLEDGE DATA ENG I
  • [4] Baker S., 2000, Proceedings Fourth IEEE International Conference on Automatic Face and Gesture Recognition (Cat. No. PR00580), P83, DOI 10.1109/AFGR.2000.840616
  • [5] From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
    Bruckstein, Alfred M.
    Donoho, David L.
    Elad, Michael
    [J]. SIAM REVIEW, 2009, 51 (01) : 34 - 81
  • [6] Super-resolution of face images using kernel PCA-based prior
    Chakrabarti, Ayan
    Rajagopalan, A. N.
    Chellappa, Rama
    [J]. IEEE TRANSACTIONS ON MULTIMEDIA, 2007, 9 (04) : 888 - 892
  • [7] 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
  • [8] Image Super-Resolution Using Deep Convolutional Networks
    Dong, Chao
    Loy, Chen Change
    He, Kaiming
    Tang, Xiaoou
    [J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2016, 38 (02) : 295 - 307
  • [9] Learning a Deep Convolutional Network for Image Super-Resolution
    Dong, Chao
    Loy, Chen Change
    He, Kaiming
    Tang, Xiaoou
    [J]. COMPUTER VISION - ECCV 2014, PT IV, 2014, 8692 : 184 - 199
  • [10] For most large underdetermined systems of equations, the minimal l1-norm near-solution approximates the sparsest near-solution
    Donoho, David L.
    [J]. COMMUNICATIONS ON PURE AND APPLIED MATHEMATICS, 2006, 59 (07) : 907 - 934