Joint Learning for Single-Image Super-Resolution via a Coupled Constraint

被引:144
作者
Gao, Xinbo [1 ]
Zhang, Kaibing [1 ]
Tao, Dacheng [2 ]
Li, Xuelong [3 ]
机构
[1] Xidian Univ, Sch Elect Engn, Xian 710071, Peoples R China
[2] Univ Technol Sydney, Fac Engn & Informat Technol, Ctr Quantum Computat & Intelligent Syst, Sydney, NSW 2007, Australia
[3] Chinese Acad Sci, Xian Inst Opt & Precis Mech, State Key Lab Transient Opt & Photon, Ctr OPT IMagery Anal & Learning OPTIMAL, Xian 710119, Peoples R China
基金
中国国家自然科学基金;
关键词
Grouping patch pairs (GPPs); joint learning; neighbor embedding (NE); super-resolution (SR); HIGH-RESOLUTION IMAGE; QUALITY ASSESSMENT; RECONSTRUCTION; INTERPOLATION; RESTORATION; ALGORITHM;
D O I
10.1109/TIP.2011.2161482
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The neighbor-embedding (NE) algorithm for single-image super-resolution (SR) reconstruction assumes that the feature spaces of low-resolution (LR) and high-resolution (HR) patches are locally isometric. However, this is not true for SR because of one-to-many mappings between LR and HR patches. To overcome or at least to reduce the problem for NE-based SR reconstruction, we apply a joint learning technique to train two projection matrices simultaneously and to map the original LR and HR feature spaces onto a unified feature subspace. Subsequently, the k-nearest neighbor selection of the input LR image patches is conducted in the unified feature subspace to estimate the reconstruction weights. To handle a large number of samples, joint learning locally exploits a coupled constraint by linking the LR-HR counterparts together with the K-nearest grouping patch pairs. In order to refine further the initial SR estimate, we impose a global reconstruction constraint on the SR outcome based on the maximum a posteriori framework. Preliminary experiments suggest that the proposed algorithm outperforms NE-related baselines.
引用
收藏
页码:469 / 480
页数:12
相关论文
共 44 条
[1]  
[Anonymous], COMP VIS PATT REC 20
[2]  
[Anonymous], P IEEE INT C MULT EX
[3]   Limits on super-resolution and how to break them [J].
Baker, S ;
Kanade, T .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2002, 24 (09) :1167-1183
[4]   Max-Min Distance Analysis by Using Sequential SDP Relaxation for Dimension Reduction [J].
Bian, Wei ;
Tao, Dacheng .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2011, 33 (05) :1037-1050
[5]   Biased Discriminant Euclidean Embedding for Content-Based Image Retrieval [J].
Bian, Wei ;
Tao, Dacheng .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2010, 19 (02) :545-554
[6]   Neighbor embedding based super-resolution algorithm through edge detection and feature selection [J].
Chan, Tak-Ming ;
Zhang, Junping ;
Pu, Jian ;
Huang, Hua .
PATTERN RECOGNITION LETTERS, 2009, 30 (05) :494-502
[7]  
Chan TM, 2006, LECT NOTES COMPUT SC, V3832, P756
[8]   Super-resolution through neighbor embedding [J].
Chang, H ;
Yeung, DY ;
Xiong, Y .
PROCEEDINGS OF THE 2004 IEEE COMPUTER SOCIETY CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION, VOL 1, 2004, :275-282
[9]   Quadratic interpolation for image resampling [J].
Dodgson, NA .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 1997, 6 (09) :1322-1326
[10]   Superresolution restoration of an image sequence: Adaptive filtering approach [J].
Elad, M ;
Feuer, A .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 1999, 8 (03) :387-395