Regularization of multiplicative iterative algorithms with nonnegative constraint

DOI10.1088/0266-5611/30/3/035012zbMATH Open1368.65083arXiv1212.3258OpenAlexW2005340674MaRDI QIDQ5411978FDOQ5411978

Federico Benvenuto, Michele Piana

Publication date: 25 April 2014

Published in: Inverse Problems (Search for Journal in Brave)

Abstract: In this paper we propose a new statistical stopping rule for constrained maximum likelihood iterative algorithms applied to ill-posed inverse problems. To this aim we extend the definition of Tikhonov regularization in a statistical framework and prove that the application of the proposed stopping rule to the Iterative Space Reconstruction Algorithm (ISRA) in the Gaussian case and Expectation Maximization (EM) in the Poisson case leads to well defined regularization methods according to the given definition. We also prove that, if an inverse problem is genuinely ill-posed in the sense of Tikhonov, the same definition is not satisfied when ISRA and EM are optimized by classical stopping rule like Morozov's discrepancy principle, Pearson's test and Poisson discrepancy principle. The stopping rule is illustrated in the case of image reconstruction from data recorded by the Reuven Ramaty High Energy Solar Spectroscopic Imager (RHESSI). First, by using a simulated image consisting of structures analogous to those of a real solar flare we validate the fidelity and accuracy with which the proposed stopping rule recovers the input image. Second, the robustness of the method is compared with the other classical stopping rules and its advantages are shown in the case of real data recorded by RHESSI during two different flaring events.

Full work available at URL: https://arxiv.org/abs/1212.3258

Recommendations

• Stopping rules for iterative methods in nonnegatively constrained deconvolution
• A general method to devise maximum-likelihood signal restoration multiplicative algorithms with non-negativity constraints.
• Penalized maximum likelihood image restoration with positivity constraints: multiplicative algorithms
• scientific article; zbMATH DE number 788231
• Multiplicative Algorithms for Maximum Penalized Likelihood Inversion with Non Negative Constraints and Generalized Error Distributions

zbMATH Keywords

expectation maximizationregularizationPoisson noisestopping rulesincompatible inverse problems

Mathematics Subject Classification ID

Point estimation (62F10) Sequential estimation (62L12) Numerical solution to inverse problems in abstract spaces (65J22)

Cited In (7)

• A general method to devise maximum-likelihood signal restoration multiplicative algorithms with non-negativity constraints.
• A robust inversion method according to a new notion of regularization for Poisson data with an application to nanoparticle volume determination
• A mathematical model for image saturation with an application to the restoration of solar images via adaptive sparse deconvolution
• Predictive risk estimation for the expectation maximization algorithm with Poisson data
• The ML–EM algorithm in continuum: sparse measure solutions
• Multiplicative Algorithms for Maximum Penalized Likelihood Inversion with Non Negative Constraints and Generalized Error Distributions
• Some applications of the iterative regularization principle to mathematical programming problems

This page was built for publication: Regularization of multiplicative iterative algorithms with nonnegative constraint

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5411978)