Cart (Loading....) | Create Account
Close category search window
 

Tree-based state clustering using self-organizing principles for large vocabulary on-line handwriting recognition

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

2 Author(s)
Kosmala, A. ; Dept. of Comput. Sci., Gerhard-Mercator-Univ., Duisburg, Germany ; Rigoll, G.

The introduction of trigraphs offers a powerful method for the accuracy enhancement of handwriting modeling. A trigraph is a hidden Markov model (HMM) for a special character with defined adjacent characters. Especially in large vocabulary systems, as they are investigated here, the number of unseen trigraphs for which no training samples are available, exceeds the number of seen trigraphs by far. This paper presents a novel approach, which allows a synthesis of unseen trigraphs from seen trigraphs. With the method proposed here, a mean relative error reduction of 42% was obtained on a writer dependent system, resulting in an overall word recognition rate of 94.1%

Published in:

Pattern Recognition, 1998. Proceedings. Fourteenth International Conference on  (Volume:2 )

Date of Conference:

16-20 Aug 1998

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.