Limits on super-resolution and how to break them

Citations Over TimeTop 1% of 2002 papers

Abstract

Nearly all super-resolution algorithms are based on the fundamental constraints that the super-resolution image should generate low resolution input images when appropriately warped and down-sampled to model the image formation process. (These reconstruction constraints are normally combined with some form of smoothness prior to regularize their solution.) We derive a sequence of analytical results which show that the reconstruction constraints provide less and less useful information as the magnification factor increases. We also validate these results empirically and show that, for large enough magnification factors, any smoothness prior leads to overly smooth results with very little high-frequency content. Next, we propose a super-resolution algorithm that uses a different kind of constraint in addition to the reconstruction constraints. The algorithm attempts to recognize local features in the low-resolution images and then enhances their resolution in an appropriate manner. We call such a super-resolution algorithm a hallucination or reconstruction algorithm. We tried our hallucination algorithm on two different data sets, frontal images of faces and printed Roman text. We obtained significantly better results than existing reconstruction-based algorithms, both qualitatively and in terms of RMS pixel error.

Related Papers

• → An Object Detection and Pose Estimation Approach for Position Based Visual Servoing(2017)5 cited
• → Self-monitoring to improve robustness of 3D object tracking for robotics(2011)4 cited
• → 3-D tracking of a moving object by an active stereo vision system(2002)9 cited
• → Robust object tracking based on RGB-D camera(2014)
• → Image Demosaicking using Super Resolution Techniques(2022)