A sub-optimal viterbi-like search for linear dynamic models classification

Dimitris Oikonomidis, Vassilis Diakoloukas, Vassilis Digalakis

This paper describes a Viterbi-like decoding algorithm applied on segment-models based on linear dynamic systems (LDMs). LDMs are a promising acoustic modeling scheme which can alleviate several of the limitations of the popular Hidden Markov Models (HMMs). There are several implementations of LDMs that can be found in the literature. For our decoding experiments we consider general identifiable forms of LDMs which allow increased state space dimensionality and relax most of the constraints found in other approaches. Results on the AURORA2 database show that our decoding scheme significantly outperforms standard HMMs, particularly under significant noise levels.

doi: 10.21437/Interspeech.2007-482

Cite as: Oikonomidis, D., Diakoloukas, V., Digalakis, V. (2007) A sub-optimal viterbi-like search for linear dynamic models classification. Proc. Interspeech 2007, 1717-1720, doi: 10.21437/Interspeech.2007-482

@inproceedings{oikonomidis07_interspeech,
  author={Dimitris Oikonomidis and Vassilis Diakoloukas and Vassilis Digalakis},
  title={{A sub-optimal viterbi-like search for linear dynamic models classification}},
  year=2007,
  booktitle={Proc. Interspeech 2007},
  pages={1717--1720},
  doi={10.21437/Interspeech.2007-482}
}