https://hal.inria.fr/hal-00912053James, Matthew R.Matthew R.JamesANU - Australian National University - Department of engineering - ANU - Australian National UniversityKrishnamurthy, VikramVikramKrishnamurthyANU - Australian National University - Department of engineering - ANU - Australian National UniversityLe Gland, FrançoisFrançoisLe GlandMEFISTO - CRISAM - Inria Sophia Antipolis - Méditerranée - Inria - Institut National de Recherche en Informatique et en AutomatiqueTime discretization of continuous time filters for HMM parameters estimationHAL CCSD1992[MATH.MATH-PR] Mathematics [math]/Probability [math.PR]Le Gland, Francois2013-12-20 19:20:532022-02-04 03:11:372013-12-20 19:20:53enConference papers10.1109/CDC.1992.3710261We propose numerical techniques for parameter estimation of fast-sampled homogeneous Markov chains observed in white Gaussian noise. Recently, continuous-time filters that estimate the quantities used in the EM algorithm for MLE parameter estimation were obtained by Elliott. Our numerical work is based on the robust discretization of these filters. The advantage of using filters in the EM algorithm is that they have negligible memory requirements; indeed, independent of the number of observations. In comparison, standard discrete time EM algorithms (Baum-Welch re-estimation equations) are based on smoothers and require the use of the forward-backward algorithm, which is a fixed-interval algorithm and has memory requirements proportional to the number of observations. Although the computational complexity of our filters at each time instant is 0(N^4) (for a N state Markov chain) compared to O(N^2) for the forward-backward scheme, the filters are suitable for parallel implementation. A careful analysis of our techniques might reduce the computational complexity. We present simulations to illustrate the satisfactory performance of our algorithms.