Efficient deconvolution methods for astronomical imaging: algorithms and IDL-GPU codes

Abstract

The Richardson-Lucy method is the most popular deconvolution method in astronomy because it preserves the number of counts and the non-negativity of the original object. Regularization is, in general, obtained by an early stopping of Richardson-Lucy iterations. In the case of point-wise objects such as binaries or open star clusters, iterations can be pushed to convergence. However, it is well-known that Richardson-Lucy is an inefficient method. In most cases, acceptable solutions are obtained at the cost of hundreds or thousands of iterations. A general optimization method, referred to as the scaled gradient projection method, has been proposed for the constrained minimization of continuously differentiable convex functions. It is applicable to the non-negative minimization of the Kullback-Leibler divergence. If the scaling suggested by Richardson-Lucy is used in this method, then it provides a considerable increase in the efficiency of Richardson-Lucy. Therefore the aim of this paper is to apply the scaled gradient projection method to a number of imaging problems in astronomy such as single image deconvolution, multiple image deconvolution, and boundary effect correction. The corresponding algorithms are derived and implemented in interactive data language. To attempt to achieve a further increase in efficiency, we also consider an implementation on graphic processing units. The proposed algorithms are tested on simulated images. The acceleration of scaled gradient projection methods achieved with respect to the corresponding Richardson-Lucy methods strongly depends on both the problem and the specific object to be reconstructed, and in our simulations the improvement achieved ranges from about a factor of 4 to more than 30. Moreover, significant accelerations of up to two orders of magnitude have been observed between the serial and parallel implementations of the algorithms.

References in corpus (1)

• Accelerating gradient projection methods for ${\ell }_1$-constrained signal recovery by steplength selection rules

Cited by in corpus (19)

• Variable metric inexact line-search based methods for nonsmooth optimization
• Statistical Analysis and Catalog of Non-polar Coronal Holes Covering the SDO-era using CATCH
• Synchronic coronal hole mapping using multi-instrument EUV images: Data preparation and detection method
• On the convergence of a linesearch based proximal-gradient method for nonconvex optimization
• The influence of diffuse scattered light II. Observations of galaxy haloes and thick discs and hosts of BCGs
• New convergence results for the scaled gradient projection method
• A convergent blind deconvolution method for post-adaptive-optics astronomical imaging
• A new steplength selection for scaled gradient methods with application to image deblurring
• Expanding Bipolar X-ray Structure After the 2006 Eruption of RS Oph
• A method for space-variant deblurring with application to adaptive optics imaging in astronomy
• Non-parametric PSF estimation from celestial transit solar images using blind deconvolution
• A scaled gradient projection method for Bayesian learning in dynamical systems
• A cyclic block coordinate descent method with generalized gradient projections
• JADES: Rest-frame UV-to-NIR Size Evolution of Massive Quiescent Galaxies from Redshift z=5 to z=0.5
• A blind deconvolution method for ground based telescopes and Fizeau interferometers
• Accelerated gradient methods for the X-ray imaging of solar flares
• Evolution of the anti-truncated stellar profiles of S0 galaxies since $z=0.6$ in the SHARDS survey: I - Sample and Methods
• On the filtering effect of iterative regularization algorithms for linear least-squares problems
• $\beta$-SGP: Scaled Gradient Projection with $\beta$-divergence for astronomical image restoration