|Author:||Lee, Kin-sang Timothy|
|Title:||Character recognition using digitally implementable neural network|
|Subject:||Optical character recognition devices|
Neural networks (Computer science)
Hong Kong Polytechnic University -- Dissertations
Department of Electronic Engineering
|Pages:||iv, 86, 3 leaves : ill. ; 30 cm|
|Abstract:||The aim of this project is to investigate the use of digitally implementable neural networks in character recognition. This work begins with a study on the effect of using different types of activation functions for the multi-layer feed-forward neural network. The back-propagation learning algorithm is used for training all the networks that have been tested in this project. Apart from the conventional approach for character recognition that is used by neural network, an alternative approach based on function approximation have been studied and tested, and the performance is found to be satisfactory. The STBP and MS models suggested by Wang [5, 6] have been studied and tested. A 'modified' MS model is proposed to resolve the stability problem of the STBP and MS models. It is found that the 'modified' MS network can be trained to achieve the required accuracy very much faster than those conventional BP networks, and can solve the stability problem anticipated by the STBP and MS models.|
Files in This Item:
|b15554405.pdf||For PolyU Staff & Students||2.91 MB||Adobe PDF||View/Open|
As a bona fide Library user, I declare that:
- I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
- I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
- I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.
By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.
Please use this identifier to cite or link to this item: