Volume 416, Number 1, March II 2004
|Page(s)||403 - 410|
|Published online||26 February 2004|
A simple but efficient algorithm for multiple-image deblurring
Chip Computers Consulting srl, Viale Don L. Sturzo 82, S.Liberale di Marcon, 30020 Venice, Italy
2 ESA-VILSPA, Apartado 50727, 28080 Madrid, Spain e-mail: email@example.com
3 Department of Mathematics and Computer Science, Emory University, Atlanta, GA 30322, USA e-mail: firstname.lastname@example.org
4 Department of Mathematical and Computer Sciences, Colorado School of Mines, Golden CO 80401, USA e-mail: ltenorio@Mines.EDU
Corresponding author: R. Vio, email@example.com
Accepted: 19 November 2003
We consider the simultaneous deblurring of a set of noisy images whose point spread functions are different but known and spatially invariant, and with Gaussian noise. Currently available iterative algorithms that are typically used for this type of problem are computationally expensive, which makes their application for very large images impractical. We present a simple extension of a classical least-squares (LS) method where the multi-image deblurring is efficiently reduced to a computationally efficient single-image deblurring. In particular, we show that it is possible to remarkably improve the ill-conditioning of the LS problem by means of stable operations on the corresponding normal equations, which in turn speed up the convergence rate of the iterative algorithms. The performance and limitations of the method are analyzed through numerical simulations. Its connection with a column weighted least-squares approach is also considered in an appendix.
Key words: methods: data analysis / methods: statistical / techniques: image processing
© ESO, 2004
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.