Context. The Richardson-Lucy (RL) method is the most popular deconvolution method in Astronomy because it preserves the number of counts and the nonnegativity of the original object. Regularization is, in general, obtained by an early stopping of RL 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 RL is not an efficient method: in most cases and, in particular, for low noise levels, acceptable solutions are obtained at the cost of hundreds or thousands of iterations. Therefore, several approaches for accelerating RL have been proposed. They are mainly based on the remark that RL is a scaled gradient method for the minimization of the Kullback-Leibler (KL) divergence, or Csiszar I-divergence, which represents the data-fidelity function in the case of Poisson noise. In this framework, a line search along the descent direction is considered for reducing the number of iterations.Aims. In a recent paper, a general optimization method, denoted as scaled gradient projection (SGP) method , has been proposed for the constrained minimization of continuously differentiable convex functions. It is applicable to the nonnegative minimization of the KL divergence. If the scaling suggested by RL is used in this method, then it provides a considerable speedup of RL. Therefore the aim of this paper is to apply SGP to a number of imaging problems in Astronomy such as single image deconvolution, multiple image deconvolution and boundary effect correction.Methods. Deconvolution methods are proposed by applying SGP to the minimization of the KL divergence for the imaging problems mentioned above and the corresponding algorithms are derived and implemented in IDL. For all the algorithms several stopping rules are introduced, including one based on a recently proposed discrepancy principle for Poisson data. For a further increase of efficiency, implementation on GPU (Graphic Processing Unit) is also considered.Results. The proposed algorithms are tested on simulated images. The speedup of SGP methods with respect to the corresponding RL methods strongly depends on the problem and on the specific object to be reconstructed, and in our simulationsit ranges from about 4 to more than 30. Moreover, significant speedups up to two orders of magnitude have been observed between the serial and parallel implementations of the algorithms. The codes are available upon request.
Efficient deconvolution methods for astronomical imaging: algorithms and IDL-GPU codes / Prato, Marco; Cavicchioli, Roberto; Zanni, Luca; P., Boccacci; M., Bertero. - In: ASTRONOMY & ASTROPHYSICS. - ISSN 0004-6361. - STAMPA. - 539(2012), pp. A133-A133. [10.1051/0004-6361/201118681]
|Data di pubblicazione:||2012|
|Titolo:||Efficient deconvolution methods for astronomical imaging: algorithms and IDL-GPU codes|
|Autore/i:||Prato, Marco; Cavicchioli, Roberto; Zanni, Luca; P., Boccacci; M., Bertero|
|Digital Object Identifier (DOI):||http://dx.doi.org/10.1051/0004-6361/201118681|
|Codice identificativo ISI:||WOS:000303262000140|
|Codice identificativo Scopus:||2-s2.0-84857859355|
|Citazione:||Efficient deconvolution methods for astronomical imaging: algorithms and IDL-GPU codes / Prato, Marco; Cavicchioli, Roberto; Zanni, Luca; P., Boccacci; M., Bertero. - In: ASTRONOMY & ASTROPHYSICS. - ISSN 0004-6361. - STAMPA. - 539(2012), pp. A133-A133. [10.1051/0004-6361/201118681]|
|Tipologia||Articolo su rivista|
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris