Super-Resolution Algorithm Based on Discrete Fourier Transform

Super-resolution (SR) processing reconstructs a high-resolution image from a set of low-resolution images for same scene. Spatial domain approaches in the super resolution algorithm were widely used. In this paper, we purposed an algorithm that converts the spatial domain into the frequency domain through the 2-dimension DFT for four low-resolution images. Utilizing the horizontal and vertical DFT (Discrete Fourier Transform) phase spectrum carry the horizontal and vertical direction feature information in frequency domain, we can make a high resolution image presented more visible details. We verify accuracy and efficiency from experimental results.

[1]  Michael Elad,et al.  Fast and robust multiframe super resolution , 2004, IEEE Transactions on Image Processing.

[2]  Takeo Kanade,et al.  Limits on Super-Resolution and How to Break Them , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[3]  J. D. van Ouwerkerk,et al.  Image super-resolution survey , 2006, Image Vis. Comput..

[4]  Harry Shum,et al.  Face Hallucination: Theory and Practice , 2007, International Journal of Computer Vision.

[5]  Liangpei Zhang,et al.  A MAP Approach for Joint Motion Estimation, Segmentation, and Super Resolution , 2007, IEEE Transactions on Image Processing.

[6]  William T. Freeman,et al.  Learning Low-Level Vision , 1999, Proceedings of the Seventh IEEE International Conference on Computer Vision.

[7]  Michael Elad,et al.  Advances and challenges in super‐resolution , 2004, Int. J. Imaging Syst. Technol..

[8]  William T. Freeman,et al.  Example-Based Super-Resolution , 2002, IEEE Computer Graphics and Applications.

[9]  Moon Gi Kang,et al.  Super-resolution image reconstruction: a technical overview , 2003, IEEE Signal Process. Mag..