Issue No. 01 - January (2004 vol. 26)
<p><b>Abstract</b>—Superresolution is a technique that can produce images of a higher resolution than that of the originally captured ones. Nevertheless, improvement in resolution using such a technique is very limited in practice. This makes it significant to study the problem: “<it>Do fundamental limits exist for superresolution</it>?” In this paper, we focus on a major class of superresolution algorithms, called the <it>reconstruction-based algorithms</it>, which compute high-resolution images by simulating the image formation process. Assuming local translation among low-resolution images, this paper is the first attempt to determine the <it>explicit</it> limits of reconstruction-based algorithms, under both real and synthetic conditions. Based on the perturbation theory of linear systems, we obtain the superresolution limits from the conditioning analysis of the coefficient matrix. Moreover, we determine the number of low-resolution images that are sufficient to achieve the limit. Both real and synthetic experiments are carried out to verify our analysis.</p>
Superresolution, reconstruction-based algorithms, conditioning analysis, fundamental limits, magnification factor.
Heung-Yeung Shum, Zhouchen Lin, "Fundamental Limits of Reconstruction-Based Superresolution Algorithms under Local Translation", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 26, no. , pp. 83-97, January 2004, doi:10.1109/TPAMI.2004.10003