vix.ing · top · new · best · stats · spec

When Does the Richardson-Lucy Deconvolution Converge ?

1994/09/29 by Hongguang Bi, Bi, Hongguang, Gerhard Boerner +2
Computer Science · Engineering · Physics and Astronomy · #Astrophysics (astro-ph) #Explainable Artificial Intelligence (XAI) #FOS: Physical sciences #Gaussian Processes and Bayesian Inference #Reservoir Engineering and Simulation Methods #astro-ph

paper · pdf · doi:10.48550/arxiv.astro-ph/9409093

uuencoded tar+compressed file containing an 6 page paper + 7 figures, to be published soon in A&A, present address: Dept. of Physics, Univ. of Arizona, USA

arxiv created 1994/09/29 · openalex publication_date 1994/09/29 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

(\rl = Richardson-Lucy) We propose a simulation-based bootstrap method to access global significance levels of deconvolution models in the \rl and other iterative restoration algorithms that converge locally. These significance levels allow one to check at each iterative step how good the model is and when iterations can be stopped. Adding more iterations in the deconvolution improves the fitting but is very slow at later time; while too much entropy or smoothness will be lost in the models. A good deconvolution model should firstly have a significance level as high as possible (≥ 20%), and secondly, be as smooth as possible. We have used two examples to illustrate how such models can be derived in practice. We point out that maximizing the sum of the likelihood of fitting and \em a priori entropy does not guarantee an acceptable significance level for the resulting model. If one's \em a priori knowledge is too poor, the model may not be able to fit the data at a reasonable significance level. Instead, a maximum-entropy-like iterative restoration algorithm can be performed later by acquiring \em a priori knowledge from the \rl restoration. However, this is necessary only when it does increase the levels significantly.

Related