Feature Extraction Methods for Character Recognition

Not Include

Advances in Character Recognition

This book presents advances in character recognition, and it consists of 12 chapters that cover wide range of topics on different aspects of character recognition. Hopefully, this book will serve as a reference source for academic research, for professionals working in the character recognition field and for all interested in the subject

Adaptive statistical recognition of hand-printed Telugu characters

A brief description of statistical and syntactic pattern matching techniques is presented with an emphasis on statistical techniques. The characteristics of the Telugu script are described. A subset of 16 characters, which are both easy and hard to recognize, is selected for the dictionary of standard characters. A weighted linear difference polynomial of features is used to recognize Telugu characters. The features were Fourier descriptors of projection profiles and cross sections taken in various directions. Algorithms for obtaining the projection profiles cross sections and adaptive learning method are presented. The system was trained and tested with a set of 8 nano-written samples of each of 16 different Telugu characters. More than 90% of the 123 samples were correctly recognized by the system. Results of numerous trials examining the different features and classification techniques are discussed

An investigation into the use of genetic algorithms for shape recognition

The use of the genetic algorithm for shape recognition has been investigated in relation to features along a shape boundary contour. Various methods for encoding chromosomes were investigated, the most successful of which led to the development of a new technique to input normalised 'perceptually important point' features from the contour into a genetic algorithm. Chromosomes evolve with genes defining various ways of 'observing' different parts of the contour. The normalisation process provides the capability for multi-scale spatial frequency filtering and fine/coarse resolution of the contour features. A standard genetic algorithm was chosen for this investigation because its performance can be analysed by applying schema analysis to the genes. A new method for measurement of gene diversity has been developed. It is shown that this diversity measure can be used to direct the genetic algorithm parameters to evolve a number of 'good' chromosomes. In this way a variety of sections along the contour can be observed. A new and effective recognition technique has been developed which makes use of these 'good' chromosomes and the same fitness calculation as used in the genetic algorithm. Correct recognition can be achieved by selecting chromosomes and adjusting two thresholds, the values of which are found not to be critical. Difficulties associated with the calculation of a shape's fitness were analysed and the structure of the genes in the chromosome investigated using schema and epistatic analysis. It was shown that the behaviour of the genetic algorithm is compatible with the schema theorem of J. H. Holland. Reasons are given to explain the minimum value for the mutation probability that is required for the evolution of a number of' good' chromosomes. Suggestions for future research are made and, in particular, it is recommended that the convergence properties of the standard genetic algorithm be investigated