• DocumentCode
    3246249
  • Title

    Temporal hidden Markov models

  • Author

    Tran, Dat

  • Author_Institution
    Sch. of Inf. Sci. & Eng., Univ. of Canberra, ACT, Australia
  • fYear
    2004
  • fDate
    20-22 Oct. 2004
  • Firstpage
    137
  • Lastpage
    140
  • Abstract
    The hidden Markov model (HMM) is a double stochastic process. The observable process produces a sequence of observations and the hidden process is a Markov process. The HMM assumes that the occurrence of one observation is statistically independent of the occurrence of the others. To avoid this limitation, a temporal HMM is proposed. The hidden process in the temporal HMM is the same, but the observable process is now a Markov process. Each observation in the training sequence is assumed to be statistically dependent on its predecessor, and codewords or Gaussian components are used as states in the observable Markov process. Speaker identification experiments performed on 138 Gaussian mixture speaker models in the YOHO database shows a better performance for the temporal HMM compared to the standard HMM.
  • Keywords
    Gaussian processes; hidden Markov models; speaker recognition; speech processing; Gaussian components; Gaussian mixture speaker models; codewords; double stochastic process; observable process; speaker identification; temporal HMM; temporal hidden Markov models; training sequence; Australia; Authentication; Databases; Handwriting recognition; Hidden Markov models; Markov processes; Probability; Speech; Stochastic processes; Tires;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Intelligent Multimedia, Video and Speech Processing, 2004. Proceedings of 2004 International Symposium on
  • Print_ISBN
    0-7803-8687-6
  • Type

    conf

  • DOI
    10.1109/ISIMP.2004.1434019
  • Filename
    1434019