Hidden Markov models

Hidden Markov models

by Robert J. Elliott, Lakhdar Aggoun, John B. Moore

Part of 29

1995

Browse books you can read free on Readfeed

No club is reading this yet — be the first to start one

Start a club free
About
The aim of this book is to present graduate students with a thorough survey of reference probability models and their applications to optimal estimation and control. These new and powerful methods are particularly useful in signal processing applications where signal models are only partially known and are in noisy environments. Well-known results, including Kalman filters and the Wonham filter, emerge as special cases. The authors begin with discrete time and discrete state spaces. From there, they proceed to cover continuous time, and progress from linear models to nonlinear models, and from completely known models to only partially known models. Readers are assumed to have a basic grounding in probability and systems theory, such as might be gained from the first year of graduate study, but otherwise this account is self-contained. Throughout, the authors have taken care to demonstrate engineering applications which show the usefulness of these methods.

Discuss Hidden Markov models with other readers

Join or start a book club for Hidden Markov models on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.

Frequently asked questions

How do I join a book club for Hidden Markov models?

Sign up free on Readfeed, then browse public clubs or start your own club with Hidden Markov models as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.

Can I discuss Hidden Markov models with other readers online?

Yes. Readfeed book clubs let you chat live, share progress, and join discussions about Hidden Markov models with readers worldwide — whether your club is virtual, in-person, or hybrid.

Is Readfeed free?

Yes. Creating an account and joining book clubs is free. Sign up to find readers who love the same books and start discussing today.