Number of the records: 1  

Comparison of State Estimation Using Finite Mixtures and Hidden Markov Models

  1. 1.
    SYSNO ASEP0364544
    Document TypeC - Proceedings Paper (int. conf.)
    R&D Document TypeConference Paper
    TitleComparison of State Estimation Using Finite Mixtures and Hidden Markov Models
    Author(s) Nagy, I. (CZ)
    Suzdaleva, Evgenia (UTIA-B) RID, ORCID
    Mlynářová, Tereza (UTIA-B)
    Number of authors3
    Source TitleProceedings of the 6th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems : Technology and Application. - Piscataway : IEEE, 2011 - ISBN 978-1-4577-1424-5
    Pagess. 527-531
    Number of pages5 s.
    Publication formCD - CD
    Action6th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications
    Event date15.09.2011-17.09.2011
    VEvent locationPrague
    CountryCZ - Czech Republic
    Event typeWRD
    Languageeng - English
    CountryUS - United States
    Keywordsmixture models ; hidden Markov models ; state estimation ; online estimation
    Subject RIVBC - Control Systems Theory
    R&D Projects1M0572 GA MŠMT - Ministry of Education, Youth and Sports (MEYS)
    TA01030123 GA TA ČR - Technology Agency of the Czech Republic (TA ČR)
    CEZAV0Z10750506 - UTIA-B (2005-2011)
    AnnotationMany various algorithms are developed for state estimation of dynamic switching systems. It is not a straightforward task to choose the most suitable one. This paper deals with testing of state estimation via two wellknown approaches: recursive estimation with finite mixtures and iterative technique with hidden Markov models. A discussion of comparison of these online and offline counterparts is of true interest. The paper describes experiments providing a comparison of these methods.
    WorkplaceInstitute of Information Theory and Automation
    ContactMarkéta Votavová, votavova@utia.cas.cz, Tel.: 266 052 201.
    Year of Publishing2012
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.