Discriminative feature selection for hidden Markov models using Segmental Boosting

ICASSP(2008)

引用 23|浏览18
暂无评分
摘要
We address the feature selection problem for hidden Markov models (HMMs) in sequence classification. Temporal correlation in sequences often causes difficulty in applying feature selection tech niques. Inspired by segmental k-means segmentation (SKS) [B. Juang and L. Rabiner, 1990], we propose Segmentally Boosted HMMs (SBHMMs), where the state-optimized features are constructed in a segmental and discriminative manner. The contributions are twofold. First, we introduce a novel feature selection algorithm, where the temporal dynamics are decoupled from the static learning procedure by assuming that the sequential data are piecewise independent and identically distributed. Second, we show that the SBHMM consistently improves traditional HMM recognition in various domains. The reduction of error compared to traditional HMMs ranges from 17% to 70% in American Sign Language recognition, human gait identification, lip reading, and speech recognition.
更多
查看译文
关键词
hidden markov models,static learning procedure,pattern recognition,speech recognition,feature ex- traction,image segmentation,sequential data,segmental boosting,segmentally boosted hmm,hmm recognition,lip reading,feature extraction,image sequences,segmental k-means segmentation,time-series,sequence classification,discriminative feature selection,gait identification,sign language recognition,hidden markov model,index terms— time-series,independent and identically distributed,feature selection,k means,indexing terms,time series
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要