Related Experiment Video
Updated: Dec 26, 2025

A Novel Bayesian Change-point Algorithm for Genome-wide Analysis of Diverse ChIPseq Data Types
Published on: December 10, 2012
Extension of emission expectation maximization lookalike algorithms to Bayesian algorithms
Gengsheng L Zeng1,2, Ya Li3
11Department of Engineering, Utah Valley University, 800 W University Parkway, Orem, UT 84058 USA.
Abstract:
We recently developed a family of image reconstruction algorithms that look like the emission maximum-likelihood expectation-maximization (ML-EM) algorithm. In this study, we extend these algorithms to Bayesian algorithms. The family of emission-EM-lookalike algorithms utilizes a multiplicative update scheme. The extension of these algorithms to Bayesian algorithms is achieved by introducing a new simple factor, which contains the Bayesian information. One of the extended algorithms can be applied to emission tomography and another to transmission tomography. Computer simulations are performed and compared with the corresponding un-extended algorithms. The total-variation norm is employed as the Bayesian constraint in the computer simulations. The newly developed algorithms demonstrate a stable performance. A simple Bayesian algorithm can be derived for any noise variance function. The proposed algorithms have properties such as multiplicative updating, non-negativity, faster convergence rates for bright objects, and ease of implementation. Our algorithms are inspired by Green's one-step-late algorithm. If written in additive-update form, Green's algorithm has a step size determined by the future image value, which is an undesirable feature that our algorithms do not have.
Related Concept Videos
Propagation of Uncertainty from Random Error
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Maxwell-Boltzmann Distribution: Problem Solving
This distribution function f(v) is defined by saying that the expected number N (v1,v2) of particles with speeds between v1 and v2 is given by
Propagation of Uncertainty from Systematic Error
Expected Value
Expected Frequencies in Goodness-of-Fit Tests

