• 131 Accesses

Abstract

A Markov model describes a sequence of possible states with random transition between states where the probability of the current state depends only on the preceding state and is independent of the way the preceding state was reached. The state space can be continuous or discrete, but we restrict our analysis to the case of a discrete state space. A state-space grid with \(N\) grid points can be used to obtain an approximate representation of a continuous state space. This representation has a one-to-one correspondence between the discrete state space and the set of integers \(\left\{1, 2, \dots ,N\right\}\).

If the states of the system can only be observed indirectly through measurements that randomly depend on the state, we have a hidden Markov model (HMM).

The HMM can be used to estimate the state of a dynamic system when no state-space model of the system is available provided that the probabilities of transition between states and measurements are known.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free ship** worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    In much of the literature, \({p}_{ij}\) denotes the probability of transition from state \(i\) to state \(j\). We use a notation that is more suited to a state equation with state matrix \(A=\left[{p}_{ij}\right].\)

  2. 2.

    The example is from the MATLAB manual.

  3. 3.

    S.R. Eddy, “Hidden Markov Models,” Current Opinion in Structural Biology, Vol. 6, pp361-365, 1996.

Bibliography

  1. DeGroot, M. H., & Schervish, M. J. (2002). Probability and statistics. Addison-Wesley.

    Google Scholar 

  2. Fraser, A. M. (2008). Hidden Markov models & dynamical systems. SIAM.

    Book  Google Scholar 

  3. Moon, T. K., & Stirling, W. C. (2000). Mathematical methods and algorithms for signal processing. Prentice-Hall.

    Google Scholar 

  4. Papoulis, A., & Pillai, S. U. (2002). Probability, random variables, and stochastic processes. McGraw-Hill.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to M. Sami Fadali .

Rights and permissions

Reprints and permissions

Copyright information

© 2024 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Fadali, M.S. (2024). Hidden Markov Models. In: Introduction to Random Signals, Estimation Theory, and Kalman Filtering. Springer, Singapore. https://doi.org/10.1007/978-981-99-8063-5_14

Download citation

Publish with us

Policies and ethics

Navigation