2026-09-19T12:57:08Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/624612022-01-13T07:54:29Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Munther A. Dahleh.
Atwi, Aliaa
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2011-04-25T16:02:42Z
2011-04-25T16:02:42Z
2010
2010
http://hdl.handle.net/1721.1/62461
711203161
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2010.
Cataloged from PDF version of thesis.
Includes bibliographical references (p. 65-66).
Quickest Detection is the problem of detecting abrupt changes in the statistical behavior of an observed signal in real-time. The literature has focused much attention on the problem for i.i.d. observations. In this thesis, we assess the feasibility of two HMM quickest detection frameworks recently suggested for detecting rare events in a real data set. The first method is a dynamic programming based Bayesian approach, and the second is a non-Bayesian approach based on the cumulative sum algorithm. We discuss implementation considerations for each method and show their performance through simulations for a real data set. In addition, we examine, through simulations, the robustness of the non-Bayesian method when the disruption model is not exactly known but belongs to a known class of models.
by Aliaa Atwi.
S.M.
66
eng
Massachusetts Institute of Technology
M.I.T. theses are protected by
copyright. They may be viewed from this source for any purpose, but
reproduction or distribution in any format is prohibited without written
permission. See provided URL for inquiries about permission.
http://dspace.mit.edu/handle/1721.1/7582
Electrical Engineering and Computer Science.
A case study in robust quickest detection for hidden Markov models
Robust quickest detection for hidden Markov models
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="516176f5-9c70-49fb-8a98-f5a249950f3a">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>A case study in robust quickest detection for hidden Markov models</Title>
<Subtitle>Robust quickest detection for hidden Markov models</Subtitle>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2010</PublicationDate>
<Authors>
<Author>
<DisplayName>Atwi, Aliaa</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Electrical Engineering and Computer Science.</Keyword>
<Abstract>Quickest Detection is the problem of detecting abrupt changes in the statistical behavior of an observed signal in real-time. The literature has focused much attention on the problem for i.i.d. observations. In this thesis, we assess the feasibility of two HMM quickest detection frameworks recently suggested for detecting rare events in a real data set. The first method is a dynamic programming based Bayesian approach, and the second is a non-Bayesian approach based on the cumulative sum algorithm. We discuss implementation considerations for each method and show their performance through simulations for a real data set. In addition, we examine, through simulations, the robustness of the non-Bayesian method when the disruption model is not exactly known but belongs to a known class of models.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>