Close category search window
 

Isolated Handwritten Farsi Numerals Recognition Using Sparse and Over-Complete Representations

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)
Pan, W.M. ; Center for Pattern Recognition & Machine Intell., Concordia Univ., Montreal, QC, Canada ; Bui, T.D. ; Suen, C.Y.

A new isolated handwritten Farsi numeral recognition algorithm is proposed in this paper, which exploits the sparse and over-complete structure from the handwritten Farsi numeral data. In this research, the sparse structure is represented as an over-complete dictionary, which is learned by the K-SVD algorithm. These atoms in this dictionary are adopted to initialize the first layer of the convolutional neural network (CNN), the latter is then trained to do the classification task. Data distortion techniques are also applied to promote the generalization capability of the trained classifier. Experiments have shown that good results have been achieved in CENPARMI handwritten Farsi numeral database.

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

Date of Conference: 26-29 July 2009

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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.