A simplified viterbi matching algorithm for word partition in visual speech processing
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...
Saved in:
Main Authors: | Foo, Say Wei, Yong, Lian, Liang, Dong |
---|---|
Other Authors: | School of Electrical and Electronic Engineering |
Format: | Conference or Workshop Item |
Language: | English |
Published: |
2009
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/79871 http://hdl.handle.net/10220/6039 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Development of Viterbi decoder in VHDL
by: Liu, Jun.
Published: (2008) -
A two-channel training algorithm for hidden Markov model to identify visual speech elements
by: Foo, Say Wei, et al.
Published: (2009) -
Using 3D deformable template trellis to describe the movement of the lip
by: Foo, Say Wei, et al.
Published: (2009) -
A study on pattern matching algorithms
by: Ng, Kee Wan.
Published: (2008) -
SPEECH DECODING OPTIMIZATION STRATEGY WITH VITERBI ALGORITHM ON GPU
by: RADITYA ARSADJAJA NIM : 13514088, ALFONSUS