Share Email Print

Proceedings Paper

Convergence study of message passing in arbitrary continuous Bayesian networks
Author(s): Wei Sun; K. C. Chang
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Pearl's traditional message passing algorithm developed in 1980s is the first exact inference algorithm for Bayesian networks (BNs). Although it originally was developed for discrete polytree networks only, it has been used widely in networks with loops by providing approximate solutions. In such case, messages propagated in the loops are not exact and this method is called loopy belief propagation. Loopy propagation usually converges and when it converges, it provides good approximate solutions. However, when dealing with arbitrary continuous Bayesian networks, message representations and manipulations need special cares because continuous vairables may have arbitrary distributions and their dependency relationships could be nonlinear. In this paper, we propose a loopy message passing mechanism for arbitrary continuous Bayesian networks called Unscented Message Passing (UMP-BN). UMP-BN combines Pearl's algorithm and an efficient nonlinear transformation technique called Unscented Transformation to provide estimates of the first two moments of the posterior distributions for any hidden continuous variable. We study its convergence properties by investigating various typical situations with different networks. The numerical experiments show promising results.

Paper Details

Date Published: 17 April 2008
PDF: 12 pages
Proc. SPIE 6968, Signal Processing, Sensor Fusion, and Target Recognition XVII, 69680Z (17 April 2008); doi: 10.1117/12.780626
Show Author Affiliations
Wei Sun, George Mason Univ. (United States)
K. C. Chang, George Mason Univ. (United States)

Published in SPIE Proceedings Vol. 6968:
Signal Processing, Sensor Fusion, and Target Recognition XVII
Ivan Kadar, Editor(s)

© SPIE. Terms of Use
Back to Top