Bayes algorithm
Function
context | Ku:(X×X)→R |
context | Wz:X→R |
definition | Γ:(X→R)→X→R |
definition | belout[belin](x):=N∗Wz(x)∫AKu(x,x′)belin(x′)dx′ |
this is the algorithm for the case where all the ingredient have these types. In practice, Coming up with an initial bel is a also part of the task.
N∗ is supposed to be the normalization of the whole term on the right of it - a normalization to the sum/integral of belin. In practice, the latter should normalize to 1.
Discussion
Ku(x,x′) ought to capture the propagation, possibly determined by actions u.
Wz ought to capture a redistribution of believe, due to some observation z.
The relation with Bayes rule is discussed in Conditional probability.
Note
Of course may move Wz under the integral too.
Kalman filter
This is when the true state evolution is given by a linear relation
xk=Fkxk−1.
(+possibly by a noise term)
and when the sensor is set to measure zk=Hkxk.
(the H-matrix can be a projection, thus taking into account that you only measure particular features of the truth, and you can't catch em all.)
and you apply the Bayes Filter with
Pu(xk,xk−1)=p(xk∣xk−1,uk)=N(Fkxk−1+Bkuk,Qk)
Oz(xk)=p(zk∣xk)=N(Hkxk,Rk)
where N(x,σ2) is the normal distribution, except of course with multivariate arguments.
Theorems
Reference
Wikipedia: Gamma function