Limits on Super-Resolution and How to Break Them
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
Theoretical Analysis on Reconstruction-Based Super-Resolution for an Arbitrary PSF
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02
A frequency domain approach to registration of aliased images with application to super-resolution
EURASIP Journal on Applied Signal Processing
Generalizing the Nonlocal-means to super-resolution reconstruction
IEEE Transactions on Image Processing
Analysis of multiframe super-resolution reconstruction for image anti-aliasing and deblurring
Image and Vision Computing
Statistical Analysis of the LMS Algorithm Applied to Super-Resolution Image Reconstruction
IEEE Transactions on Signal Processing
Extraction of high-resolution frames from video sequences
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
IEEE Transactions on Image Processing
Fast and robust multiframe super resolution
IEEE Transactions on Image Processing
An image super-resolution algorithm for different error levels per frame
IEEE Transactions on Image Processing
Statistical performance analysis of super-resolution
IEEE Transactions on Image Processing
IEEE Transactions on Image Processing
A Bayesian approach to image expansion for improved definition
IEEE Transactions on Image Processing
Hi-index | 0.00 |
From the perspective of linear algebra, the performance of super-resolution reconstruction (SR) depends on the conditioning of the linear system characterizing the degradation model. This is analyzed in the Fourier domain using the perturbation theory. By proposing a new SR error bound in terms of the point spread function (PSF), we reveal that the blur function dominates the condition number (CN) of degradation matrix, and the advantage of non-integer magnification factors (MFs) over the integer ones comes from sampling zero crossings of the DFT of the PSF. We also explore the effect of regularization by integrating it into the SR model, and investigate the influence of the optimal regularization parameter. A tighter error bound is derived given the optimal regularization parameter. Two curves of error bounds vs. MFs are presented, and verified by processing real images. It explains that with proper regularization, SR at the integer MFs is still valid.