This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Super-Resolution Reconstruction of Image Sequences
September 1999 (vol. 21 no. 9)
pp. 817-834

Abstract—In an earlier work, we have introduced the problem of reconstructing a super-resolution image sequence from a given low resolution sequence. We proposed two iterative algorithms, the R-SD and the R-LMS, to generate the desired image sequence. These algorithms assume the knowledge of the blur, the down-sampling, the sequences motion, and the measurements noise characteristics, and apply a sequential reconstruction process. It has been shown that the computational complexity of these two algorithms makes both of them practically applicable. In this paper, we rederive these algorithms as approximations of the Kalman filter and then carry out a thorough analysis of their performance. For each algorithm, we calculate a bound on its deviation from the Kalman filter performance. We also show that the propagated information matrix within the R-SD algorithm remains sparse in time, thus ensuring the applicability of this algorithm. To support these analytical results we present some computer simulations on synthetic sequences, which also show the computational feasibility of these algorithms.

[1] M. Elad and A. Feuer, “Super-Resolution Restoration of Continuous Image Sequence—Adaptive Filtering Approach,” IEEE Trans. Image Processing, vol. 8, no. 3, pp. 387-395, Marc. 1999.
[2] M. Irani and S. Peleg, “Motion Analysis for Image Enhancement: Resolution, Occlusion, and Transparency,” J. Visualization, Computers, and Image Recognition, vol. 4, pp. 324-335, Dec. 1993.
[3] A.J. Patti, M.I. Sezan, and A.M. Tekalp, “High-Resolution Image Reconstruction from a Low-Resolution Image Sequence in the Presence of Time-Varying Motion Blur,” Proc. Int'l Conf. Image Processing, pp. 343-347, Austin, Tex., Nov. 1994.
[4] R.S. Schultz and R.L. Stevenson, “Extraction of High-Resolution Frames from Video Sequences,” IEEE Trans. Image Processing, vol. 5, pp. 996-1,011, June 1996.
[5] H. Shekarforoush, M. Berthod, J. Zerubia, and M. Werman, “Sub-Pixel Bayesian Estimation of Albedo and Height,” Int'l J. Computer Vision, vol. 19, pp. 289-300, 1996.
[6] P. Cheeseman, B. Kanefsky, R. Kraft, J. Stutz, and R. Henson, “Super-Resolved Surface Reconstruction from Multiple Images,” NASA, Ames Research Center, Technical Report FIA-94-12, 1994.
[7] P. Ciaccia, M. Patella, and P. Zezula, “Processing Complex Similarity Queries with Distance-Based Access Methods,” Proc. Sixth Int'l Conf. Extending Database Technology, Mar. 1998.
[8] T. Patti, A.M. Tekalp, and A.M Sezan, “Image Sequence Restoration and De-Interlacing by Motion-Compensated Kalman Filter,” Proc. SPIE—The Int'l Soc. Optical Eng., vol. 1,903, pp. 59-70, 1991.
[9] A.K. Katsagellos, J.N. Driessen, S.N. Efstratiadis, and L.J. Lagendijk, “Spatio-Temporal Motion Compensated Noise Filtering of Image Sequences,” Proc. SPIE—Int'l Soc. Optical Eng., vol. 1,199, pp. 61-70, 1989.
[10] C.K. Chui and G. Chen, Klaman Filtering. Springer-Verlag, 1990.
[11] A.H. Jazwinski, Stochastic Processes and Filtering Theory. Academic Press, 1970.
[12] P.S. Maybeck, Stochastic Models, Estimation and Control, vols. I-II.New York: Academic Press, 1979.
[13] L.A. Hageman and D.M. Young, Applied Iterative Methods. Academic Press, 1981.
[14] D.P. Bertsekas, Nonlinear Programming. Belmont, Mass.: Athena Scientific, 1995.
[15] S. Haykin, Adaptive Filter Theory. Prentice Hall, 1986.

Index Terms:
Image restoration, super resolution, dynamic estimation, kalman filter, adaptive filters, recursive least squares (RLS), least mean squares (LMS), steepest descent (SD).
Citation:
Michael Elad, Arie Feuer, "Super-Resolution Reconstruction of Image Sequences," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 21, no. 9, pp. 817-834, Sept. 1999, doi:10.1109/34.790425
Usage of this product signifies your acceptance of the Terms of Use.