Smoothing problem (stochastic processes)

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 Norbert Wiener .

A smoother is an algorithm or implementation that implements a solution to such problem. Please refer to the article Recursive Bayesian estimation for more information. The Smoothing problem and Filtering problem are often considered a closely-related pair of problems. They are studied in Bayesian smoothing theory.

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

Example smoothers

Some variants include :

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

Relation between Filtering and Smoothing problems

Smoothing (estimation) and smoothing (convolution) can mean totally different, but sound like they are apparently similar. The concepts are different and are used in different historical contexts. The requirements are very different. Both the smoothing problem (in sense of estimation) and the filtering problem (in sense of estimation) are often confused with smoothing and filtering in other contexts (especially non-stochastic signal processing). These names are used in the context of World War 2 defined by people like Norbert Wiener . They are distinct in the following two senses:

1. Convolution: The smoothing in the sense of convolution (eg, moving average, low-pass filtering, convolution with a kernel, or blurring using Laplace filters in image processing) is simpler. Especially non-stochastic and non-Bayesian signal processing, without any hidden variables.

2. Estimation: The smoothing problem (or Smoothing in the sense of estimation) uses Bayesian and state-space models to estimate the hidden state variables. This is used in the context of World War 2 defined by people like Norbert Wiener, in (stochastic) control theory, radar, signal detection, tracking, etc. The most common use is the Kalman Smoother used with Kalman Filter, which is actually developed by Rauch. The procedure is called Kalman-Rauch recursion. It is one of the main problems defined by Norbert Wiener . Most importantly, in the Filtering problem (sense 2) the information from observation up to the time of the current sample is used. In smoothing (also sense 2) all observation samples (from future) are used. Filtering is causal but smoothing is batch processing of the same problem, namely, estimation of a time-series process based on serial incremental observations.

But the usual and more common smoothing and filtering (in the sense of 1.) do not have such distinction because there is no distinction between hidden and observable.

The distinction between Smoothing (estimation) and Filtering (estimation): In smoothing all observation samples are used (from future). Filtering is causal, whereas smoothing is batch processing of the given data. Filtering is the estimation of a (hidden) time-series process based on serial incremental observations.

See Also

• Smoothing problem is closely related to the Filtering problem.
• Filtering (disambiguation)
• Filtering problem
• Not to be confused with Filter (signal processing)
• Kalman filter most famous filtering algorithm in the sense of 'filtering problem' and 'smoothing problem'.
• Smoothing (not to be confused with the Smoothing problem)
• Smoothing (disambiguation)
• Smoothing problem