Reduced-complexity estimation for large-scale hidden Markov models

IEEE Transactions on Signal Processing

Volumn 52, Issue 5, 2004, Pages 1242-1249

  Dey, Subhrakanti ^a   Mareels, Iven ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

Computational complexity; Hidden Markov models; Markov chains; Nearly completely decomposable; State estimation

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; MATRIX ALGEBRA; POLYNOMIALS; PROBLEM SOLVING; STATE ESTIMATION;

HIDDEN MARKOV MODELS; NONLINEAR MATRIX EQUATION; REDUCED-COMPLEXITY ESTIMATION; STATE-TO-OUTPUT TRANSITION MATRIX;

MARKOV PROCESSES;

EID: 2442553912     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSP.2004.826171     Document Type: Article

References (19)

1. F. Delebecque and J. P. Quadrat, "Optimal control of Markov chains admitting strong and weak interactions," Automatica, vol. 17, pp. 281-296, 1981.
2. R. G. Phillips and P. V. Kokotovic, "A singular perturbation approach to modeling and control of Markov chains," IEEE Trans. Automat. Contr., vol. AC-26, pp. 1087-1094, 1981.
3. V. Krishnamurthy, "Adaptive estimation of hidden nearly completely decomposable Markov chains with applications in blind equalization," Int. J. Adaptive Contr. Signal Process., vol. 8, pp. 237-260, Aug. 1994.
4. L. White, R. Mahony, and G. Brushe, "Lumpable hidden Markov models-Model reduction and reduced complexity filtering," IEEE Trans. Automat. Contr., vol. 45, pp. 2297-2306, Dec. 2000.
5. H. A. Simon and A. Ando, "Aggregation of variables in dynamic systems," Econometrica, vol. 29, pp. 111-138, 1961.
6. P. J. Courtois, Decomposability Queueing and Computer System Applications. New York: Academic, 1977.
7. G. Yin and Q. Zhang, Continuous-Time Markov Chains and Applications: A Singular Perturbation Approach. New York: Springer-Verlag, 1998.
8. D. Tse, R. Gallagher, and J. Tsitsiklis, "Statistical multiplexing of multiple time-scale Markov streams," IEEE J. Select. Areas Commun., vol. 13, pp. 1028-1038, Nov./Dec. 1995.
9. C. D. Meyer, "Stochastic complementation, uncoupled Markov chains, and the theory of nearly reducible systems," SIAM Rev., vol. 31, pp. 240-272, June 1989.
10. R. W. Aldhaheri and H. K. Khalil, "Aggregation of the policy iteration method for nearly completely decomposable Markov chains," IEEE Trans. Automat. Contr., vol. 36, pp. 178-187, Feb. 1991.
11. M. Coderch, A. S. Willsky, S. S. Sastry, and D. A. Casatanon, "Hierarchical aggregation of singularly perturbed finite state Markov processes," Stochastics, vol. 8, pp. 259-289, 1983.
12. J. R. Rohlicek and A. S. Willsky, "The reduction of perturbed Markov generators: An algorithm exposing the role of transient states," J. Assoc. Comput. Machinery, vol. 35, pp. 675-696, 1988.
13. F. Delebecque, J. P. Quadrat, and P. V. Kokotovic, "A unified view of aggregation and coherency in networks and Markov chains," Int. J. Contr., vol. 40, pp. 939-952, 1984.
14. G. Yin and S. Dey, "Weak convergence of hybrid filtering problems involving nearly completely decomposable hidden markov chains," SIAM J. Contr. Optimization, vol. 41, no. 8, pp. 1820-1842, 2003.
15. S. Dey, "Reduced-complexity filtering for partially observed nearly completely decompsable Markov chains," IEEE Trans. Signal Processing, vol. 48, pp. 3334-3344, Dec. 2000.
16. L. Shue and S. Dey, "Complexity reduction in fixed-lag smoothing of hidden markov models," IEEE Trans. Signal Processing, vol. 50, pp. 1124-1132, May 2002.
17. L. R. Rabiner, "A tutorial on hidden Markov models and selected applications in speech recognition," Proc. IEEE, vol. 77, pp. 257-285, Feb. 1989.
18. P. Kokotovic, H. K. Khalil, and J. O'Reilly, Singular Perturbation Methods in Control: Analysis and Design. New York: Academic, 1986.
19. L. Shue, B. D. O. Anderson, and S. Dey, "Exponential stability of filters and smoothers for hidden Markov models," IEEE Trans. Signal Processing, vol. 46, pp. 2180-2194, Aug. 1998.