Recognition and Rejection Performance in Wordspotting Systems Using Support Vector Machines

Abstract : Support Vector Machines (SVM) is one such machine learning technique that learns the decision surface through a process of discrimination and has a good generalization capacity. SVMs have been proven to be successful classifiers on several classical pattern recogntion problems. In this paper, one of the first applications of Support Vector Machines (SVM) technique for the problem of keyword spotting is presented. It classifies the correct and the incorrect keywords by using linear and Radial Basis Function kernels. This is a first work proposed to use SVM in keyword spotting in order to improve recognition and rejection accuracy. The obtained results are very promising. The Equal Error Rate (EER) for the linear kernel is about 16,34\% compared to 15,23\% obtained by the radial basis function kernel.
Type de document :
Communication dans un congrès
2nd WSEAS International Conference on Signal, Speech and Image Processing - WSEAS ICOSSIP'2002, Sep 2002, Koukounaries, Skiathos Island, Greece, 6 p, 2002
Liste complète des métadonnées

https://hal.inria.fr/inria-00100833
Contributeur : Publications Loria <>
Soumis le : mardi 26 septembre 2006 - 14:52:14
Dernière modification le : jeudi 11 janvier 2018 - 06:19:55

Identifiants

  • HAL Id : inria-00100833, version 1

Citation

Yassine Benayed, Dominique Fohr, Jean-Paul Haton, Gérard Chollet. Recognition and Rejection Performance in Wordspotting Systems Using Support Vector Machines. 2nd WSEAS International Conference on Signal, Speech and Image Processing - WSEAS ICOSSIP'2002, Sep 2002, Koukounaries, Skiathos Island, Greece, 6 p, 2002. 〈inria-00100833〉

Partager

Métriques

Consultations de la notice

194