Improved resolution from subpixel shifted pictures
CVGIP: Graphical Models and Image Processing
Digital video processing
Super-Resolution Reconstruction of Image Sequences
IEEE Transactions on Pattern Analysis and Machine Intelligence
Digital Image Restoration
Limits on Super-Resolution and How to Break Them
IEEE Transactions on Pattern Analysis and Machine Intelligence
Is Super-Resolution with Optical Flow Feasible?
ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part I
IEEE Transactions on Pattern Analysis and Machine Intelligence
Fundamental Limits of Reconstruction-Based Superresolution Algorithms under Local Translation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Extraction of high-resolution frames from video sequences
IEEE Transactions on Image Processing
Superresolution video reconstruction with arbitrary sampling lattices and nonzero aperture time
IEEE Transactions on Image Processing
Joint MAP registration and high-resolution image estimation using a sequence of undersampled images
IEEE Transactions on Image Processing
IEEE Transactions on Image Processing
IEEE Transactions on Image Processing
A computationally efficient superresolution image reconstruction algorithm
IEEE Transactions on Image Processing
High resolution image formation from low resolution frames using Delaunay triangulation
IEEE Transactions on Image Processing
Storage-efficient quasi-Newton algorithms for image super-resolution
DSP'09 Proceedings of the 16th international conference on Digital Signal Processing
Performance of reconstruction-based super-resolution with regularization
Journal of Visual Communication and Image Representation
Variational method for super-resolution optical flow
Signal Processing
Hi-index | 0.01 |
Novel theoretical results for the super-resolution reconstruction (SRR) are presented under the case of arbitrary image warping. The SRR model is reasonably separated into two parts of anti-aliasing and deblurring. The anti-aliasing part is proved to be well-posed. The ill-posedness of the entire SRR process is shown to be mainly caused by the deblurring part. The motion estimation error results in a multiplicative perturbation to the warping matrix, and the perturbation bound is derived. The common regularization algorithms used in SRR are analyzed through the discrete Picard condition, which provides a theoretical measure for limits on SRR. Experiments and examples are supplied to validate the presented theories.