Properties of the maximum a posteriori path estimator in hidden Markov models

IEEE Transactions on Information Theory

Volumn 52, Issue 1, 2006, Pages 41-51

  Caliebe, Amke ^a  

^a UNIVERSITY OF KIEL   (Germany)

Author keywords

Central Limit Theorem; Hidden Markov model (HMM); HMM with additive white Gaussian noise; Maximum a posteriori (MAP) estimation; Maximum likelihod sequence estimator; Mean error; Path estimation; Regenerative process; Renewal process; Viterbi algorithm

Indexed keywords

ALGORITHMS; CALCULATIONS; ESTIMATION; INTERSYMBOL INTERFERENCE; MATHEMATICAL MODELS; MAXIMUM LIKELIHOOD ESTIMATION; PATTERN RECOGNITION; PROBABILITY; WHITE NOISE;

ADDITIVE WHITE GAUSSIAN NOISE; CENTRAL LIMIT THEOREM; HIDDEN MARKOV MODEL (HMM); MAXIMUM A POSTERIORI (MAP) ESTIMATION; MAXIMUM-LIKELIHOOD SEQUENCE ESTIMATOR; MEAN ERROR; PATH ESTIMATION; REGENERATIVE PROCESS; RENEWAL PROCESS; VITERBI ALGORITHM;

MARKOV PROCESSES;

EID: 33144483352     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2005.860425     Document Type: Article

References (48)

1. P. L. Ainsleigh, N. Kehtarnavaz, and R. L. Streit, "Hidden Gauss-Markov models for signal classification," IEEE Trans. Signal Process., vol. 50, no. 6, pp. 1355-1367, Jun. 2002.
2. G. Alsmeyer, Erneuerungstheorie: Analyse stochastischer Regenerationsschemata. Stuttgart, Germany: Teubner, 1991.
3. C. Andrieu and A. Doucet, "Simulated annealing for maximum a posteriori parameter estimation of hidden Markov models," IEEE Trans. Inf. Theory, vol. 46, no. 3, pp. 994-1004, May 2000.
4. S. Asmussen, Applied Probability and Queues. New York: Wiley, 1987.
5. L. E. Baum, T. Petrie, G. Soules, and N. Weiss, "A maximization technique occurring in the statistical analysis of probabilistic functions of Markov chains," Ann. Math. Statist., vol. 41, pp. 161-171, 1970.
6. R. E. Bellman, Dynamic Programming. Princeton, NJ: Princeton Univ. Press, 1957.
7. P. J. Bickel, Y. Ritov, and T. Rydén, "Asymptotic normality of the maximum-likelihood estimator for general hidden Markov models," Ann. Statist., vol. 26, pp. 1614-1635, 1998.
8. P. J. Bickel, Y. Ritov, and T. Rydén, "Hidden Markov model likelihoods and their derivatives behave like IID ones," Ann. Inst. H. Poincaré Probab. Statist., vol. 38, pp. 825-846, 2002.
9. V. Bruhn, "Ein Überblick über die mathematischen Grundlagen des Hidden-Markov-Modells," Diplomarbeit der mathematisch-naturwissenschaftlichen Fakultät Kiel, Kiel, Germany, 1992.
10. A. Caliebe and U. Rösler, "Convergence of the maximum a posteriori path estimator in hidden Markov models," IEEE Trans. Inf. Theory, vol. 48, no. 7, pp. 1750-1758, Jul. 2002.
11. Y. Chen and R. S. Blum, "Efficient algorithms for sequence detection in non-Gaussian noise with intersymbol interference," IEEE Trans. Commun., vol. 48, no. 8, pp. 1249-1252, Aug. 2000.
12. D. Colquhoun, C. J. Hatton, and A. G. Hawkes, "The quality of maximum likelihood estimates of ion channel rate constants," J. Physiol., vol. 547, pp. 699-728, 2003.
13. P. A. Devijer and J. Kittler, Pattern Recognition: A Statistical Approach. London, U.K.: Prentice-Hall Int., 1982.
14. R. Douc and C. Matias, "Asymptotics of the maximum likelihood estimator for general hidden Markov models," Bernoulli, vol. 7, pp. 381-420, 2001.
15. Y. Ephraim and N. Merhav, "Hidden Markov processes," IEEE Trans. Inf. Theory, vol. 48, no. 6, pp. 1518-1569, Jun. 2002.
16. Y. Ephraim, A. Dembo, and L. R. Rabiner, "A minimum discrimination information approach for hidden Markov modeling," IEEE Trans. Inf. Theory, vol. 35, no. 5, pp. 1001-1013, Sep. 1989.
17. G. D. Forney Jr., "Maximum-likelihood sequence estimation of digital sequences in the presence of intersymbol interference," IEEE Trans. Inf. Theory, vol. IT-18, no. 3, pp. 363-378, May 1972.
18. G. D. Forney Jr., "The Viterbi algorithm," Proc. IEEE, vol. 61, no. 3, pp. 268-276, Mar. 1973.
19. G. D. Forney Jr., "Convolutional codes. II. Maximum-likelihood decoding," Inf. Contr., vol. 25, pp. 222-266, 1974.
20. G. J. Foschini, "Performance bound for maximum-likelihood reception of digital data," IEEE Trans. Inf. Theory, vol. IT-21, no. 1, pp. 47-50, Jan. 1975.
21. D. R. Fredkin and J. A. Rice, "Bayesian restoration of single-channel patch clamp recordings," Biometrics, vol. 48, pp. 427-488, 1992.
22. D. R. Fredkin and J. A. Rice, "Fast evaluation of the likelihood of an HMM: Ion channel currents with filtering and colored noise," IEEE Trans. Signal Process., vol. 49, no. 3, pp. 625-633, Mar. 2001.
23. E. Gassiat and S. Boucheron, "Optimal error exponents in hidden Markov model order estimation," IEEE Trans. Inf. Theory, vol. 49, no. 4, pp. 964-980, Apr. 2003.
24. U.-P. Hansen, O. Cakan, M. Abshagen-Keunecke, and A. Farokhi, "Gating models of the anomalous mole-fraction effect of single-channel current in Chara," J. Membrane Biol., vol. 192, pp. 45-63, 2003.
25. F. Harary, R. Z. Norman, and D. Cartwright, Structural Models: An Introduction to the Theory of Directed Graphs. New York: Wiley, 1965.
26. J. A. Heller and I. M. Jacobs, "Viterbi decoding for satellite and space communication," IEEE Trans. Commun. Technol., vol. COM-19, no. 5, pp. 835-848, Oct. 1971.
27. X. D. Huang, Y. Ariki, and M. A. Jack, Hidden Markov Models for Speech Recognition. Edinburgh, U.K.: Edinburgh Univ. Press, 1990.
28. F. L. Jensen and N. V. Petersen, "Asymptotic normality of the maximum likelihood estimator in state space models," Ann. Statist., vol. 27, pp. 514-535, 1999.
29. J. A. Kogan, "Hidden Markov models estimation via the most informative stopping times for the Viterbi algorithm," in Image Models (and Their Speech Model Cousins), The IMA Volumes in Mathematics and Its Applications, S. E. Levinson and L. Shepp, Eds. New York: Springer-Verlag, 1996, vol. 80, pp. 115-130.
30. B. G. Leroux, "Maximum-likelihood estimation for hidden Markov models," Stochastic Process. Appl., vol. 40, pp. 127-143, 1992.
31. W. K. Ma, K. M. Wong, and P. C. Ching, "On computing Verdú's upper bound for a class of maximum-likelihood multiuser detection and sequence detection problems," IEEE Trans. Inf. Theory, vol. 47, no. 7, pp. 3049-3053, Nov. 2001.
32. X. Ma and A. Kavčić', "Path partitions and forward-only trellis algorithms," IEEE Trans. Inf. Theory, vol. 49, no. 1, pp. 38-52, Jan. 2003.
33. B. A. Mazur and D. P. Taylor, "Demodulation and carrier synchronization of multi-h phase codes," IEEE Trans. Commun., vol. COM-29, no. 3, pp. 257-266, Mar. 1981.
34. R. J. McEliece, "On the bcjr trellis for linear block codes," IEEE Trans. Inf. Theory, vol. 42, no. 4, pp. 1072-1092, Jul. 1996.
35. J. K. Omura, "On the Viterbi decoding algorithm," IEEE Trans. Inf. Theory, vol. IT-15, no. 1, pp. 177-179, Jan. 1969.
36. W. Quian and D. M. Titterington, "Estimation of parameters in hidden Markov models," Phil. Trans. Roy. Soc. London A, vol. 337, pp. 407-428, 1991.
37. J. Raviv, "Decision making in Markov chains applied to the problem of pattern recognition," IEEE Trans. Inf. Theory, vol. IT-13, no. 4, pp. 536-551, Oct. 1967.
38. C. P. Robert, T. Rydén, and D. M. Titterington, "Bayesian inference in hidden Markov models through the reversible jump Markov chain Monte Carlo method," J. Roy. Statist. Soc. B, vol. 62, pp. 57-75, 2000.
39. C. P. Robert and D. M. Titterington, "Reparameterization strategies for hidden Markov models and Bayesian approaches to maximum-likelihood estimation," Statist. Comp., vol. 8, pp. 145-158, 1998.
40. T. Rydén, "Consistent and asymptotically normal parameter estimates for hidden Markov models," Ann. Statist., vol. 22, pp. 1884-1895, 1994.
41. H. Strik, "Automatic speech recognition: A statistical affair," Annu. Rep. Int. Statist., vol. 6, pp. 10-14, 1999.
42. M. Y. Svertchkov, "On wide-sense regeneration," in Stability Problems for Stochastic Models (Lecture Notes in Mathematics). Berlin, Germany: Springer-Verlag, 1993, vol. 1546, pp. 167-169.
43. L. Venkataramanan, R. Kuc, and F. J. Sigworth, "Identification of hidden Markov models for ion channel currents - Part III: Bandlimited, sampled data," IEEE Trans. Signal Process., vol. 48, no. 7, pp. 376-385, Jul. 2000.
44. S. Verdú, "Maximum likelihood sequence detection for intersymbol interference channels: A new upper bound on error probability," IEEE Trans. Inf. Theory, vol. IT-33, no. 1, pp. 62-68, Jan. 1987.
45. A. J. Viterbi, "Error bounds for convolutional codes and an asymptotically optimum decoding algorithm," IEEE Trans. Inf. Theory, vol. IT-13, no. 2, pp. 260-269, Apr. 1967.
46. A. J. Viterbi and J. P. Odenwalder, "Further results on optimal decoding of convolutional codes," IEEE Trans. Inf. Theory, vol. IT-15, no. 6, pp. 732-734, Nov. 1969.
47. L. Wei and H. H. Qi, "Near-optimal limited-search detection on ISI/CDMA channels and decoding of long convolutional codes," IEEE Trans. Inf. Theory, vol. 46, no. 4, pp. 1459-1482, Jul. 2000.
48. J. Zheng, L. Vankataramanan, and F. J. Sigworth, "Hidden Markov model analysis of intermediate gating steps associated with the pore gate of Shaker potassium channels," J. Gen. Physiol., vol. 118, pp. 547-562, 2001.