Niodeling non stationary hidden semi-Markov chains with triplet Markov chains and theory of evidence

被引:0
作者
Pieczynski, Wojciech [1 ]
机构
[1] INT, GET, Dept CITI, CNRS,UMR 5157, F-91000 Evry, France
来源
2005 IEEE/SP 13th Workshop on Statistical Signal Processing (SSP), Vols 1 and 2 | 2005年
关键词
D O I
暂无
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Hidden Markov chains, enabling one to recover the hidden process even for very large size. are widely used in various problems. On the one hand, it has been recently established that when the hidden chain is not stationary, the use of the theory, of evidence is equivalent to consider a triplet Markov chain and can improve the efficiency of unsupervised segmentation. On the other hand, hidden semi-Markov chains can also be considered as particular triplet Markov chains. The aim of this paper is to use these two points simultaneously. Considering a non stationary hidden semi-Markov chain, we show that it is possible to consider two auxiliary random chains in such a way that unsupervised segmentation of non stationary hidden semi-Markov chains is workable.
引用
收藏
页码:675 / 680
页数:6
相关论文
共 15 条
[1]  
AITELFQUIH B, 2005, P INT C AC SPEECH SI
[2]  
[Anonymous], INT S APPL STOCH MOD
[3]  
[Anonymous], 2002, SPIES INT S REM SENS
[4]  
APPRIOU A, 1991, REV SCI TECH OIE, V11, P27
[5]  
BRUNEL N, 2003, IEEE WORKSH STAT SIG
[6]  
Desbouvries F., 2003, P IEEE EURASIP WORKS
[7]  
FAISAN S, 2002, IEEE INT C PROC ICIP
[8]  
Guedon Y., 1989, ICASSP-89: 1989 International Conference on Acoustics, Speech and Signal Processing (IEEE Cat. No.89CH2673-2), P282, DOI 10.1109/ICASSP.1989.266420
[9]  
LANCHANTIN P, 2005, IEEE T SIGNAL PROCES, V53
[10]  
LANCHANTIN P, 2005, TRAITEMENT SIGNAL, V22