Image Super-Resolution via Sparse Representation over Coupled Dictionary Learning Based on Patch Sharpness

被引:5
作者
Yeganli, Faezeh [1 ]
Nazzal, Mahmoud [1 ]
Unal, Murat [1 ]
Ozkaramanli, Huseyin [1 ]
机构
[1] Eastern Mediterranean Univ, Elect & Elect Engn Dept, Via Mersin 10, Gazimagusa, Turkey
来源
UKSIM-AMSS EIGHTH EUROPEAN MODELLING SYMPOSIUM ON COMPUTER MODELLING AND SIMULATION (EMS 2014) | 2014年
关键词
single-image super-resolution; sparse representation; sharpness measure-based clustering; multiple dictionary pairs;
D O I
10.1109/EMS.2014.67
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper a new algorithm for single-image super-resolution based on sparse representation over a set of coupled low and high resolution dictionary pairs is proposed. The sharpness measure is defined via the magnitude of the gradient operator and is shown to be approximately scale-invariant for low and high resolution patch pairs. It is employed for clustering low and high resolution patches in the training stage and for model selection in the reconstruction stage. A pair of low and high resolution dictionaries is learned for each cluster. The sharpness measure of a low resolution patch is used to select the appropriate cluster dictionary pair for reconstructing the high resolution counterpart. The sparse representation coefficients of low and high resolution patches are assumed to be equal. By multiplying the high resolution dictionary and the sparse coding coefficient of a low resolution patch, the corresponding high resolution patch is reconstructed. Simulation results in terms of PSNR and SSIM and visual comparison, indicate the superior performance of the proposed algorithm compared to the leading super-resolution algorithms in the literature over a set of natural images in sharp edges and corners.
引用
收藏
页码:203 / 208
页数:6
相关论文
共 19 条
[1]   K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation [J].
Aharon, Michal ;
Elad, Michael ;
Bruckstein, Alfred .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2006, 54 (11) :4311-4322
[2]  
[Anonymous], 2006, Digital Image Processing
[3]   Atomic decomposition by basis pursuit [J].
Chen, SSB ;
Donoho, DL ;
Saunders, MA .
SIAM JOURNAL ON SCIENTIFIC COMPUTING, 1998, 20 (01) :33-61
[4]   Image Deblurring and Super-Resolution by Adaptive Sparse Domain Selection and Adaptive Regularization [J].
Dong, Weisheng ;
Zhang, Lei ;
Shi, Guangming ;
Wu, Xiaolin .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2011, 20 (07) :1838-1857
[5]  
Elad M., 2006, IEEE COMP SOC C COMP, P895, DOI DOI 10.1109/CVPR.2006.142
[6]  
Feng JZ, 2011, IEEE IMAGE PROC, P1245, DOI 10.1109/ICIP.2011.6115658
[7]   Sparse signal reconstruction from limited data using FOCUSS: A re-weighted minimum norm algorithm [J].
Gorodnitsky, IF ;
Rao, BD .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 1997, 45 (03) :600-616
[8]   Beta Process Joint Dictionary Learning for Coupled Feature Spaces with Application to Single Image Super-Resolution [J].
He, Li ;
Qi, Hairong ;
Zaretzki, Russell .
2013 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2013, :345-352
[9]  
Kumar J, 2012, INT C PATT RECOG, P3292
[10]   MATCHING PURSUITS WITH TIME-FREQUENCY DICTIONARIES [J].
MALLAT, SG ;
ZHANG, ZF .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 1993, 41 (12) :3397-3415