On Approximate Nonlinear Gaussian Message Passing on Factor Graphs

Abstract

Factor graphs have recently gained increasing attention as a unified framework for representing and constructing algorithms for signal processing, estimation, and control. One capability that does not seem to be well explored within the factor graph tool kit is the ability to handle deterministic nonlinear transformations, such as those occuring in nonlinear filtering and smoothing problems, using tabulated message passing rules. In this contribution, we provide general forward (filtering) and backward (smoothing) approximate Gaussian message passing rules for deterministic nonlinear transformation nodes in arbitrary factor graphs fulfilling a Markov property, based on numerical quadrature procedures for the forward pass and a Rauch-Tung-Striebel-type approximation of the backward pass. These message passing rules can be employed for deriving many algorithms for solving nonlinear problems using factor graphs, as is illustrated by the proposition of a nonlinear modified Bryson-Frazier (MBF) smoother based on the presented message passing rules.

OriginalspracheEnglisch
Titel2018 IEEE Statistical Signal Processing Workshop (SSP)
Seitenumfang5
Herausgeber (Verlag)IEEE
Erscheinungsdatum29.08.2018
Seiten513-517
Aufsatznummer8450699
ISBN (Print)978-1-5386-1570-6, 978-1-5386-1572-0
ISBN (elektronisch)978-1-5386-1571-3
DOIs
PublikationsstatusVeröffentlicht - 29.08.2018
Veranstaltung20th IEEE Statistical Signal Processing Workshop - Freiburg im Breisgau, Deutschland
Dauer: 10.06.201813.06.2018
Konferenznummer: 139091

Fingerprint

Untersuchen Sie die Forschungsthemen von „On Approximate Nonlinear Gaussian Message Passing on Factor Graphs“. Zusammen bilden sie einen einzigartigen Fingerprint.

Zitieren