Performance analysis of the TLS algorithm for image reconstruction from a sequence of undersampled noisy and blurred frames
- 17 December 2002
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3, 571-574 vol.3
- https://doi.org/10.1109/icip.1994.413741
Abstract
A theoretical analysis is proposed to evaluate the robustness of the total least square (TLS) algorithm for image reconstruction from a sequence of undersampled noisy and blurred frames in the wavenumber domain. Since the data samples in the wavenumber domain are complex-valued, the results from the TLS theory developed for the case of real-valued data are adapted to the situation at hand. It is shown that the image quality can be improved as more frames become available. In the case of blurred frames, higher resolution images may be reconstructed using the TLS algorithm with post-deblurring. Finally, computer simulation results are provided to demonstrate the robustness of the TLS algorithm for image reconstruction.<>Keywords
This publication has 5 references indexed in Scilit:
- Recursive implementation of total least squares algorithm for image reconstruction from noisy, undersampled multiframesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1993
- Improved resolution from subpixel shifted picturesCVGIP: Graphical Models and Image Processing, 1992
- The Total Least Squares ProblemPublished by Society for Industrial & Applied Mathematics (SIAM) ,1991
- Recursive reconstruction of high resolution image from noisy undersampled multiframesIEEE Transactions on Acoustics, Speech, and Signal Processing, 1990
- Improving image resolution using subpixel motionPattern Recognition Letters, 1987