The Infinite Factorial Hidden Markov Model
Jurgen Van Gael, Yee Whye Teh, Zoubin Ghahramani · UCL Discovery (University College London) · 2008
We introduce a new probability distribution over a potentially infinite number of binary Markov chains which we call the Markov Indian buffet process. This process extends the IBP to allow temporal dependencies in the hidden variables. We use this stochastic process to build a nonparametric extension of the factorial hidden Markov model. After constructing an inference scheme which combines slice sampling and dynamic programming we demonstrate how the infinite factorial hidden Markov model can be used for blind source separation.