Welcome to IEEE Xplore 2.0: On the fundamental limits of reconstruction-based super-resolution algorithms

Cart | Sitemap | Help

Abstract


	BROWSE	SEARCH	IEEE XPLORE GUIDE	SUPPORT

View TOC

On the fundamental limits of reconstruction-based super-resolution algorithms
Zhouchen Lin Heung-Yeung Shum
Microsoft Res., China;

This paper appears in: Computer Vision and Pattern Recognition, 2001. CVPR 2001. Proceedings of the 2001 IEEE Computer Society Conference on
Publication Date: 2001
Volume: 1, On page(s): I-1171- I-1176 vol.1
ISSN: 1063-6919
ISBN: 0-7695-1272-0
INSPEC Accession Number: 7176990
Digital Object Identifier: 10.1109/CVPR.2001.990663
Current Version Published: 2003-04-15

Abstract
Super-resolution is a technique that produces higher resolution images from low resolution images (LRIs). In practice, the improvement in resolution is limited. The aim of this paper is to address the problem of whether fundamental limits exist for super-resolution? Specifically, this paper provides explicit limits for a major class of super-resolution algorithms, called reconstruction-based algorithms, under both real and synthetic conditions. Our analysis is based on perturbation theory of linear systems. We also show that a sufficient number of LRIs can be determined to reach the limit. Both real and synthetic experiments are carried out to verify our analysis.

Index Terms
Available to subscribers and IEEE members.

References
Available to subscribers and IEEE members.

Citing Documents
Available to subscribers and IEEE members.

You are not logged in.

Guests may access Abstract records free of charge.