Sciweavers

43 search results - page 5 / 9
» Scalable Recognition with a Vocabulary Tree
Sort
View
CVIU
2011
13 years 2 months ago
Action recognition with appearance-motion features and fast search trees
In this paper we propose an approach for action recognition based on a vocabulary of local motion-appearance features and fast approximate search in a large number of trees. Large...
Krystian Mikolajczyk, Hirofumi Uemura
NAACL
1994
13 years 9 months ago
Tree-Based State Tying for High Accuracy Modelling
The key problem to be faced when building a HMM-based continuous speech recogniser is maintaining the balance between model complexity and available training data. For large vocab...
S. J. Young, J. J. Odell, Philip C. Woodland
VLSID
2004
IEEE
212views VLSI» more  VLSID 2004»
14 years 8 months ago
On Design and Implementation of an Embedded Automatic Speech Recognition System
We present a new design of an Embedded Speech Recognition System. It combines the aspects of both hardware and software design to implement a speaker dependent, isolated word, sma...
Sujay Phadke, Rhishikesh Limaye, Siddharth Verma, ...
AUSAI
2003
Springer
14 years 26 days ago
Reduction of Non Deterministic Automata for Hidden Markov Model Based Pattern Recognition Applications
Most on-line cursive handwriting recognition systems use a lexical constraint to help improve the recognition performance. Traditionally, the vocabulary lexicon is stored in a trie...
Frédéric Maire, Frank Wathne, Alain ...
KDD
2007
ACM
148views Data Mining» more  KDD 2007»
14 years 8 months ago
Scalable look-ahead linear regression trees
Most decision tree algorithms base their splitting decisions on a piecewise constant model. Often these splitting algorithms are extrapolated to trees with non-constant models at ...
David S. Vogel, Ognian Asparouhov, Tobias Scheffer