Adaptive estimation of hidden semi-Markov chains with parameterised transition probabilities and exponential decaying states


Autoria(s): Ford, Jason J.; Krishnamurpthy, Vikram; Moore, John B.
Data(s)

01/10/1993

Resumo

This paper develops maximum likelihood (ML) estimation schemes for finite-state semi-Markov chains in white Gaussian noise. We assume that the semi-Markov chain is characterised by transition probabilities of known parametric from with unknown parameters. We reformulate this hidden semi-Markov model (HSM) problem in the scalar case as a two-vector homogeneous hidden Markov model (HMM) problem in which the state consist of the signal augmented by the time to last transition. With this reformulation we apply the expectation Maximumisation (EM ) algorithm to obtain ML estimates of the transition probabilities parameters, Markov state levels and noise variance. To demonstrate our proposed schemes, motivated by neuro-biological applications, we use a damped sinusoidal parameterised function for the transition probabilities.

Formato

application/pdf

Identificador

http://eprints.qut.edu.au/78150/

Relação

http://eprints.qut.edu.au/78150/2/78150.pdf

Ford, Jason J., Krishnamurpthy, Vikram, & Moore, John B. (1993) Adaptive estimation of hidden semi-Markov chains with parameterised transition probabilities and exponential decaying states. In Conference on Intelligent Signal Processing and Communication Systems (ISPACS), October 1993, Sendai, Japan.

Direitos

Copyright 1993 [please consult the author]

Fonte

School of Electrical Engineering & Computer Science; Science & Engineering Faculty

Palavras-Chave #090602 Control Systems Robotics and Automation
Tipo

Conference Paper