hidden markov chain
Recently Published Documents


TOTAL DOCUMENTS

102
(FIVE YEARS 3)

H-INDEX

9
(FIVE YEARS 0)

Author(s):  
Jean Walrand

AbstractSpeech recognition can be formulated as the problem of guessing a sequence of words that produces a sequence of sounds. The human brain is remarkably good at solving this problem, even though the same words correspond to many different sounds, because of accents or characteristics of the voice. Moreover, the environment is always noisy, to that the listeners hear a corrupted version of the speech.Computers are getting much better at speech recognition and voice command systems are now common for smartphones (Siri), automobiles (GPS, music, and climate control), call centers, and dictation systems. In this chapter, we explain the main ideas behind the algorithms for speech recognition and for related applications.The starting point is a model of the random sequence (e.g., words) to be recognized and of how this sequence is related to the observation (e.g., voice). The main model is called a hidden Markov chain. The idea is that the successive parts of speech form a Markov chain and that each word maps randomly to some sounds. The same model is used to decode strings of symbols in communication systems.Section 11.1 is a general discussion of learning. The hidden Markov chain model used in speech recognition and in error decoding is introduced in Sect. 11.2. That section explains the Viterbi algorithm. Section 11.3 discusses expectation maximization and clustering algorithms. Section 11.4 covers learning for hidden Markov chains.



2020 ◽  
Author(s):  
Leonardo De Paula Carvalho ◽  
André Marcorin de Oliveira ◽  
Oswaldo Luiz Do Valle

This work focuses on the Fault Detection (FD) problem in the Markovian Jump Linear System framework for the discrete-time domain, under the assumption that the Markov chain mode is not directly accessible. This assumption poses new challenges, since the filter responsible for the residue generation no longer depends on the Markov chain mode. For modeling this type of situation, a Hidden Markov chain (O(k), Ô(k)) is considered, with O(k) corresponding to the hidden part and Ô(k), to the observable part. The main result is the design of an H2 Fault Detection Filter (FDF) that depends only on the estimated mode Ô(k), obtained through a formulation based on Linear Matrix Inequalities (LMIs). In order to illustrate the usability of the proposed approach, we consider as an illustrative example a plant with coupled tanks subject to two distinct faults.



Data in Brief ◽  
2020 ◽  
Vol 32 ◽  
pp. 106067 ◽  
Author(s):  
Abdelghafour Marfak ◽  
Doha Achak ◽  
Asmaa Azizi ◽  
Chakib Nejjari ◽  
Khalid Aboudi ◽  
...  


Sign in / Sign up

Export Citation Format

Share Document