A simplified viterbi matching algorithm for word partition in visual speech processing

被引：0

作者：

Foo, SW ^{[1
]}

Lian, Y ^{[1
]}

Dong, L ^{[1
]}

机构：

[1] Nanyang Technol Univ, Sch EEE, Singapore 639798, Singapore

来源：

Digital Media: Processing Multimedia Interactive Services | 2003年

关键词：

D O I：

10.1142/9789812704337_0065

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

In this paper, a novel simplified Viterbi matching algorithm for sequence partition is presented. This method connects the states of different HMMs to model the observed sequence. The method is applied to visual speech processing to partition the word into visual speech elements. Experimental result shows that good accuracy is achieved with the proposed method.

引用

页码：355 / 358

页数：4