Example-Based Super-Resolution
IEEE Computer Graphics and Applications
A Wavelet Tour of Signal Processing, Third Edition: The Sparse Way
A Wavelet Tour of Signal Processing, Third Edition: The Sparse Way
A fast approach for overcomplete sparse decomposition based on smoothed l0 norm
IEEE Transactions on Signal Processing
Super resolutionwith probabilistic motion estimation
IEEE Transactions on Image Processing
A fast edge-oriented algorithm for image interpolation
Image and Vision Computing
Image super-resolution via sparse representation
IEEE Transactions on Image Processing
IEEE Transactions on Information Theory
Superresolution restoration of an image sequence: adaptive filtering approach
IEEE Transactions on Image Processing
Image quality assessment: from error visibility to structural similarity
IEEE Transactions on Image Processing
Hi-index | 0.00 |
This paper proposes a different image super-resolution (SR) reconstruction scheme, based on the newly advanced results of sparse representation and the recently presented SR methods via this model. Firstly, we online learn a subsidiary dictionary with the degradation estimation of the given low-resolution image, and concatenate it with main one offline learned from many natural images with high quality. This strategy can strengthen the expressive ability of dictionary atoms. Secondly, the conventional matching pursuit algorithms commonly use a fixed sparsity threshold for sparse decomposition of all image patches, which is not optimal and even introduces annoying artifacts. Alternatively, we employ the approximate L"0 norm minimization to decompose accurately the patch over its dictionary. Thus the coefficients of representation with variant number of nonzero items can exactly weight atoms for those complicated local structures of image. Experimental results show that the proposed method produces high-resolution images that are competitive or superior in quality to results generated by similar techniques.