Kullback proximal algorithms for maximum-likelihood estimation

DOI10.1109/18.857792MaRDI QIDQ2705920zbMATH OpenOpenAlexFDO

Authors Stéphane Chrétien, Alfred O. III Hero

Publication date 19 March 2001

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

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

zbMATH Keywords

emission tomographyexpectation-maximization algorithmKullback-Leibler divergencemaximum-likelihood image reconstructionproximal point algorithm

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) General topics in the theory of algorithms (68W01) Biomedical imaging and signal processing (92C55) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Abstract: Accelerated algorithms for maximum likelihood image reconstruction are essential for emerging applications such as 3D tomography, dynamic tomographic imaging, and other high dimensional inverse problems. In this paper, we introduce and analyze a class of fast and stable sequential optimization methods for computing maximum likelihood estimates and study its convergence properties. These methods are based on a {it proximal point algorithm} implemented with the Kullback-Liebler (KL) divergence between posterior densities of the complete data as a proximal penalty function. When the proximal relaxation parameter is set to unity one obtains the classical expectation maximization (EM) algorithm. For a decreasing sequence of relaxation parameters, relaxed versions of EM are obtained which can have much faster asymptotic convergence without sacrifice of monotonicity. We present an implementation of the algorithm using Mor'{e}'s {it Trust Region} update strategy. For illustration the method is applied to a non-quadratic inverse problem with Poisson distributed data.

Recommendations

• An Analysis of the EM Algorithm and Entropy-Like Proximal Point Methods
• Space alternating penalized Kullback proximal point algorithms for maximizing likelihood with nondifferentiable penalty
• On EM algorithms and their proximal generalizations
• On properties of the iterative maximum likelihood reconstruction method
• Convergence analysis of an accelerated expectation-maximization algorithm for ill-posed integral equations

Cited in

(17)

• A new smoothing-regularization approach for a maximum-likelihood estimation problem
• Proximal algorithms in statistics and machine learning
• Space alternating penalized Kullback proximal point algorithms for maximizing likelihood with nondifferentiable penalty
• Sparse mixture models inspired by ANOVA decompositions
• PCA reduced Gaussian mixture models with applications in superresolution
• A primal-dual iterative algorithm for a maximum likelihood estimation problem
• Maximum likelihood estimation of K-distribution parameters via the expectation-maximization algorithm
• Sequential algorithms for parameter estimation based on the Kullback-Leibler information measure
• On properties of the iterative maximum likelihood reconstruction method
• The Kaczmarz algorithm, row action methods, and statistical learning algorithms
• scientific article; zbMATH DE number 762971 (Why is no real title available?)
• String-averaging expectation-maximization for maximum likelihood estimation in emission tomography
• Analysis of a generalised expectation-maximisation algorithm for Gaussian mixture models: a control systems perspective
• Multivariate myriad filters based on parameter estimation of Student-t distributions
• On EM algorithms and their proximal generalizations
• Statistical estimation of delays in a multicast tree using accelerated EM
• A mixture of experts regression model for functional response with functional covariates

Describes a project that uses

Uses Software

• L-BFGS

This page was built for publication: Kullback proximal algorithms for maximum-likelihood estimation

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