By Topic

Lexicon-Based Word Recognition Using Support Vector Machine and Hidden Markov Model

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Ahmad, A.R. ; Univ. Tenaga Nasional, Kajang, Malaysia ; Viard-Gaudin, C. ; Khalid, M.

Hybrid of neural network (NN) and hidden Markov model (HMM) has been popular in word recognition, taking advantage of NN discriminative property and HMM representational capability. However, NN does not guarantee good generalization due to empirical risk minimization (ERM) principle that it uses. In our work, we focus on using the support vector machine (SVM) for character recognition. SVM's use of structural risk minimization (SRM) principle has allowed simultaneous optimization of representational and discriminative capability of the character recognizer. We first evaluated SVM in isolated character recognition environment using IRONOFF and UNIPEN character databases. We then demonstrate the practical issues in using SVM within a hybrid setting with HMM for word recognition. We tested the hybrid system on the IRONOFF word database and obtained commendable results.

Published in:

Document Analysis and Recognition, 2009. ICDAR '09. 10th International Conference on

Date of Conference:

26-29 July 2009