A Patch Ordering Approach To Single Image Super-Resolution Problem

In this paper, we propose a novel patch ordering approach to single image super-resolution (sr) algorithm which is called as patch ordering approach to single image super resolution (posr). we aimed at selecting more informative high-resolution (hr) and low-resolution (lr) patches for single image sr algorithms based on sparse representation and dictionary learning. our proposed posr algorithm, first ordered hr and lr patches for each training images based on minimization of total variation measure (tv). then, it assigned a sampling step for patch selection in each image. in this way, training patches were extracted based on image texture complexity. this leads to training dictionaries with the high and low resolution more efficiently. unlike other methods which have used additional restrictions in high resolution image reconstruction phase, the proposed method, has only used the basic assumption of sparse representation super resolution. the experimental results for quantitative criteria (psnr, rmse, ssim and elapsed time), human observation as a qualitative measure and computational complexity verify the improvements offered by the proposed posr algorithm.