Recognition and Rejection Performance in Wordspotting Systems Using Support Vector Machines
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.