Sciweavers

2800 search results - page 172 / 560
» Introduction to Pattern Recognition
Sort
View
ICASSP
2011
IEEE
14 years 6 months ago
Non-negative matrix deconvolution in noise robust speech recognition
High noise robustness has been achieved in speech recognition by using sparse exemplar-based methods with spectrogram windows spanning up to 300 ms. A downside is that a large exe...
Antti Hurmalainen, Jort F. Gemmeke, Tuomas Virtane...
UIST
2004
ACM
15 years 8 months ago
SketchREAD: a multi-domain sketch recognition engine
We present SketchREAD, a multi-domain sketch recognition engine capable of recognizing freely hand-drawn diagrammatic sketches. Current computer sketch recognition systems are dif...
Christine Alvarado, Randall Davis
CORR
2008
Springer
69views Education» more  CORR 2008»
15 years 3 months ago
Solving Time of Least Square Systems in Sigma-Pi Unit Networks
The solving of least square systems is a useful operation in neurocomputational modeling of learning, pattern matching, and pattern recognition. In these last two cases, the soluti...
Pierre Courrieu
ICASSP
2011
IEEE
14 years 6 months ago
Towards robust word discovery by self-similarity matrix comparison
Word discovery is the task of discovering and collecting occurrences of repeating words in the absence of prior acoustic and linguistic knowledge, or training material. The capabi...
Armando Muscariello, Guillaume Gravier, Fré...
ICASSP
2011
IEEE
14 years 6 months ago
On the use of ideal binary masks for improving phonetic classification
Ideal binary masks are binary patterns that encode the masking characteristics of speech in noise. Recent evidence in speech perception suggests that such binary patterns provide ...
Arun Narayanan, DeLiang Wang