Please use this identifier to cite or link to this item:
|Title:||A simplified viterbi matching algorithm for word partition in visual speech processing||Authors:||Foo, Say Wei
|Keywords:||DRNTU::Engineering::Electrical and electronic engineering::Computer hardware, software and systems||Issue Date:||2009||Source:||Foo, S. W., Yong, L., & Liang, D. (2009). A simplified viterbi matching algorithm for word partition in visual speech processing. Proceedings of 4th European Workshop on Image Analysis for Multimedia Interactive Services, 355-358.||Abstract:||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.||URI:||https://hdl.handle.net/10356/79871
|DOI:||10.1142/9789812704337_0065||Rights:||A simplified viterbi matching algorithm for word partition in visual speech processing © copyright 2009 World Scientific Publishing Co. This conference's website is located at http://eproceedings.worldscinet.com/9789812704337/9789812704337_0065.html.||Fulltext Permission:||open||Fulltext Availability:||With Fulltext|
|Appears in Collections:||EEE Conference Papers|
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.