Content deleted Content added
1. Make the examples of smoothers more precise. |
No edit summary |
||
(6 intermediate revisions by 5 users not shown) | |||
Line 1:
{{technical|date=November 2017}}
The '''
A smoother is often a two-pass process, composed of forward and backward passes. Consider doing estimation (prediction/retrodiction) about an ongoing process (e.g. tracking a missile) based on incoming observations. When new observations arrive, estimations about past needs to be updated to have a smoother (more accurate) estimation of the whole estimated path until now (taking into account the newer observations). Without a backward pass (for [[retrodiction]]), the sequence of predictions in an online filtering algorithm does not look smooth. In other words, retrospectively, it is as if we are using future observations for improving estimation of a point in past, when those observations about future points become available. Note that time of estimation (which determines which observations are available) can be different to the time of the point that the prediction is about (that is subject to prediction/retrodiction). The observations about later times can be used to update and improved the estimations about earlier times. Doing so leads to smoother-looking estimations (retrodiction) about the whole path.
==Example smoothers ==▼
Some variants include:<ref name="Sarkka-book">Simo Särkkä. Bayesian Filtering and Smoothing. Publisher: Cambridge University Press (5 Sept. 2013)
Language: English
Line 21 ⟶ 16:
== The confusion in terms and the relation between Filtering and Smoothing problems==
{{Cleanup section|reason=this section needs reorganization and also needs additional citations.|date=December 2021}}
Smoothing (estimation) and smoothing (convolution) despite being labelled with the same name in English language, can mean totally 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, often a name of various types of convolution). These names are used in the context of World War 2 with problems framed by people like [[Norbert Wiener]].<ref name="wiener-report"/><ref name="wiener-book" /> One source of confusion is the [[Wiener Filter]] is in form of a simple convolution. However, in Wiener's filter, two time-series are given. When the filter is defined, a straightforward convolution is the answer. However, in later developments such as Kalman filtering, the nature of filtering is different to convolution and it deserves a different name.
Line 31 ⟶ 27:
The distinction is described in the following two senses:
1. Convolution: The smoothing in the sense of
2. Estimation: The
It is one of the main problems solved by [[Norbert Wiener]].<ref name="wiener-report"/><ref name="wiener-book"/>
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.
Line 42 ⟶ 38:
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.
* [[Filtering problem]]
*
* [[Kalman filter]],
* [[Smoothing (disambiguation)]]▼
* [[Generalized filtering]]
==References==
|