Improving resolution by image registration
CVGIP: Graphical Models and Image Processing
Approximate nearest neighbor queries in fixed dimensions
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Example-Based Super-Resolution
IEEE Computer Graphics and Applications
Fundamental Limits of Reconstruction-Based Superresolution Algorithms under Local Translation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Image upsampling via imposed edge statistics
ACM SIGGRAPH 2007 papers
-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
IEEE Transactions on Signal Processing
Hi-index | 0.00 |
We propose a super-resolution method that exploits selfsimilarities and group structural information of image patches using only one single input frame. The super-resolution problem is posed as learning the mapping between pairs of low-resolution and high-resolution image patches. Instead of relying on an extrinsic set of training images as often required in example-based super-resolution algorithms, we employ a method that generates image pairs directly from the image pyramid of one single frame. The generated patch pairs are clustered for training a dictionary by enforcing group sparsity constraints underlying the image patches. Super-resolution images are then constructed using the learned dictionary. Experimental results show the proposed method is able to achieve the state-of-the-art performance.