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: | , , |
---|---|
Other Authors: | |
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 |