Jump to content

Smoothing problem (stochastic processes)

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Sohale (talk | contribs) at 15:32, 20 March 2017 (Example smoothers: book info). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

The Smoothing problem (not to be confused with smoothing in signal processing and other contexts) refers to Recursive Bayesian estimation also known as Bayes filter is the problem of estimating an unknown probability density function recursively over time using incremental incoming measurements. It is one of the main problems defined by Wiener.

A smoother is an algorithm or implementation that implements a solution to such problem.

Not to be confused with blurring and smoothing using methods such as moving average. See smoothing.

The Smoothing problem and Filtering problem are often considered a closely-related pair of problems.

Bayesian smoothing theory

Example smoothers

Some variants include [1]:

  • Rauch–Tung–Striebel (RTS) smoother
  • RTS smoother (ERTSS)
  • Gauss–Hermite RTS smoother (GHRTSS)
  • Cubature RTS smoother (CRTSS)

References

  1. ^ Simo Särkkä. Bayesian Filtering and Smoothing. Publisher: Cambridge University Press (5 Sept. 2013) Language: English ISBN-10: 1107619289 ISBN-13: 978-1107619289