Single-Image Super-Resolution by Subdictionary Coding and Kernel Regression
- 24 February 2016
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 47 (9), 1-11
- https://doi.org/10.1109/tsmc.2016.2523947
Abstract
In this paper, we present a new learning-based single-image super-resolution (SR) approach, inspired by existing sparse representation-based methods. As a promising image modeling theory, sparse representation has been effectively applied to solve the image SR problem, usually with the use of pretrained coupled or semi-coupled dictionaries. In our proposed method, we train independent dictionaries for high-resolution (HR) and low-resolution (LR) image patches to endow them more flexibility of expression. We use local subdictionaries to adaptively code image patches, which can characterize image local structures better and ensure the sparsity property of the image. Furthermore, we use kernel regression to relate HR and LR coding coefficients to capture and map the intrinsic nonlinear relationship between them. Such mapping is of central importance in the image SR problem, because high-order statistics play a significant role in the reconstruction of the detail structure of an HR image. The proposed model is generic for image SR in terms of two categories of blurring kernel. Experimental results show that our method can effectively reconstruct image details and outperform state-of-the-art algorithms in both quantitative and visual comparisons.Keywords
Funding Information
- National Natural Science Foundation of China (61271393, 61301183)
- China Post-Doctoral Science Foundation (2013M540947, 2014T70083)
- Special Foundation for the Development of Strategic Emerging Industries of Shenzhen (JCYJ20140417115840272, JCYJ20150331151358138)
This publication has 37 references indexed in Scilit:
- $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse RepresentationIEEE Transactions on Signal Processing, 2006
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solutionCommunications on Pure and Applied Mathematics, 2006
- Super-resolution image reconstruction: a technical overviewIEEE Signal Processing Magazine, 2003
- Example-based super-resolutionIEEE Computer Graphics and Applications, 2002
- New edge-directed interpolationIEEE Transactions on Image Processing, 2001
- Regularity-preserving image interpolationIEEE Transactions on Image Processing, 1999
- Emergence of simple-cell receptive field properties by learning a sparse code for natural imagesNature, 1996
- Support-vector networksMachine Learning, 1995
- Cubic convolution interpolation for digital image processingIEEE Transactions on Acoustics, Speech, and Signal Processing, 1981
- Multiple Range and Multiple F TestsBiometrics, 1955