Recognition and Rejection Performance in Wordspotting Systems Using Support Vector Machines - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2002

Recognition and Rejection Performance in Wordspotting Systems Using Support Vector Machines

Dominique Fohr
Gérard Chollet

Résumé

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.
Fichier non déposé

Dates et versions

inria-00100833 , version 1 (26-09-2006)

Identifiants

  • HAL Id : inria-00100833 , version 1

Citer

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. ⟨inria-00100833⟩
86 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More