Viterbi versus Kalman

  • #1
HI All,

Would someone be-able to clarify the key differences between the kalman filter (including smoothing) and Viterbi algorithm when modelling a dynamic hidden Markov chain from a results point of view.

I understand that the Viterbi algorithm will give the MAP estimate of hidden state variables given all observations, resulting in the single most likely state sequence. The kalman filter will give the individual most probable states given all observables which can be concatenated to give the most likely (in a MMSE sense) states given observations.

I am slightly confused as to which algorithm performs the best. The Viterbi algorithm is used in a discrete model, the Kalman will approach the same result as the Viterbi if the system is continuous, what if however the kalman filter you are using assumes a discrete state space but the underlying physical process is continuous?

Thanks for any help
 

Answers and Replies

Related Threads on Viterbi versus Kalman

  • Last Post
Replies
2
Views
2K
  • Last Post
Replies
2
Views
3K
  • Last Post
Replies
1
Views
597
  • Last Post
Replies
8
Views
2K
Replies
2
Views
2K
Replies
5
Views
20K
Replies
1
Views
2K
  • Last Post
Replies
3
Views
2K
  • Last Post
Replies
10
Views
15K
Top