100 research outputs found
Handwritten Bank Check Recognition of Courtesy Amounts
In spite of rapid evolution of electronic techniques, a number of large-scale applications continue to rely on the use
of paper as the dominant medium. This is especially true for processing of bank checks. This paper examines the
issue of reading the numerical amount field. In the case of checks, the segmentation of unconstrained strings into
individual digits is a challenging task because of connected and overlapping digits, broken digits, and digits that are
physically connected to pieces of strokes from neighboring digits. The proposed architecture involves four stages:
segmentation of the string into individual digits, normalization, recognition of each character using a neural network
classifier, and syntactic verification. Overall, this paper highlights the importance of employing a hybrid architecture
that incorporates multiple approaches to provide high recognition rates
Feedback Based Architecture for Reading Check Courtesy Amounts
In recent years, a number of large-scale applications continue to rely heavily on the use of paper as the
dominant medium, either on intra-organization basis or on inter-organization basis, including paper
intensive applications in the check processing application. In many countries, the value of each check is
read by human eyes before the check is physically transported, in stages, from the point it was presented
to the location of the branch of the bank which issued the blank check to the concerned account holder.
Such process of manual reading of each check involves significant time and cost. In this research, a new
approach is introduced to read the numerical amount field on the check; also known as the courtesy
amount field. In the case of check processing, the segmentation of unconstrained strings into individual
digits is a challenging task because one needs to accommodate special cases involving: connected or
overlapping digits, broken digits, and digits physically connected to a piece of stroke that belongs to a
neighboring digit. The system described in this paper involves three stages: segmentation, normalization,
and the recognition of each character using a neural network classifier, with results better than many other
methods in the literaratu
Ensemble learning using multi-objective optimisation for arabic handwritten words
Arabic handwriting recognition is a dynamic and stimulating field of study within
pattern recognition. This system plays quite a significant part in today's global
environment. It is a widespread and computationally costly function due to cursive
writing, a massive number of words, and writing style. Based on the literature, the
existing features lack data supportive techniques and building geometric features.
Most ensemble learning approaches are based on the assumption of linear
combination, which is not valid due to differences in data types. Also, the existing
approaches of classifier generation do not support decision-making for selecting the
most suitable classifier, and it requires enabling multi-objective optimisation to handle
these differences in data types. In this thesis, new type of feature for handwriting using
Segments Interpolation (SI) to find the best fitting line in each of the windows with a
model for finding the best operating point window size for SI features. Multi-Objective
Ensemble Oriented (MOEO) formulated to control the classifier topology and provide
feedback support for changing the classifiers' topology and weights based on the
extension of Non-dominated Sorting Genetic Algorithm (NSGA-II). It is designated
as the Random Subset based Parents Selection (RSPS-NSGA-II) to handle neurons
and accuracy. Evaluation metrics from two perspectives classification and Multiobjective
optimization. The experimental design based on two subsets of the
IFN/ENIT database. The first one consists of 10 classes (C10) and 22 classes (C22).
The features were tested with Support Vector Machine (SVM) and Extreme Learning
Machine (ELM). This work improved due to the SI feature. SI shows a significant
result with SVM with 88.53% for C22. RSPS for C10 at k=2 achieved 91% accuracy
with fewer neurons than NSGA-II, and for C22 at k=10, accuracy has been increased
81% compared to NSGA-II 78%. Future work may consider introducing more features
to the system, applying them to other languages, and integrating it with sequence
learning for more accuracy
Reconocimiento de notación matemática escrita a mano fuera de línea
El reconocimiento automático de expresiones matemáticas es uno de los problemas de reconocimiento de patrones, debido a que las matemáticas representan una fuente valiosa de información en muchos a ́reas de investigación. La escritura de expresiones matemáticas a mano es un medio de comunicación utilizado para la transmisión de información y conocimiento, con la cual se pueden generar de una manera sencilla escritos que contienen notación matemática. Este proceso puede volverse tedioso al ser escrito en lenguaje de composición tipográfica que pueda ser procesada por una computadora, tales como LATEX, MathML, entre otros. En los sistemas de reconocimiento de expresiones matem ́aticas existen dos m ́etodos diferentes a saber: fuera de l ́ınea y en l ́ınea. En esta tesis, se estudia el desempen ̃o de un sistema fuera de l ́ınea en donde se describen los pasos b ́asicos para lograr una mejor precisio ́n en el reconocimiento, las cuales esta ́n divididas en dos pasos principales: recono- cimiento de los s ́ımbolos de las ecuaciones matema ́ticas y el ana ́lisis de la estructura en que est ́an compuestos. Con el fin de convertir una expresi ́on matema ́tica escrita a mano en una expresio ́n equivalente en un sistema de procesador de texto, tal como TEX
Off-line Thai handwriting recognition in legal amount
Thai handwriting in legal amounts is a challenging problem and a new field in the area of handwriting recognition research. The focus of this thesis is to implement Thai handwriting recognition system. A preliminary data set of Thai handwriting in legal amounts is designed. The samples in the data set are characters and words of the Thai legal amounts and a set of legal amounts phrases collected from a number of native Thai volunteers. At the preprocessing and recognition process, techniques are introduced to improve the characters recognition rates. The characters are divided into two smaller subgroups by their writing levels named body and high groups. The recognition rates of both groups are increased based on their distinguished features. The writing level separation algorithms are implemented using the size and position of characters. Empirical experiments are set to test the best combination of the feature to increase the recognition rates. Traditional recognition systems are modified to give the accumulative top-3 ranked answers to cover the possible character classes. At the postprocessing process level, the lexicon matching algorithms are implemented to match the ranked characters with the legal amount words. These matched words are joined together to form possible choices of amounts. These amounts will have their syntax checked in the last stage. Several syntax violations are caused by consequence faulty character segmentation and recognition resulting from connecting or broken characters. The anomaly in handwriting caused by these characters are mainly detected by their size and shape. During the recovery process, the possible word boundary patterns can be pre-defined and used to segment the hypothesis words. These words are identified by the word recognition and the results are joined with previously matched words to form the full amounts and checked by the syntax rules again. From 154 amounts written by 10 writers, the rejection rate is 14.9 percent with the recovery processes. The recognition rate for the accepted amount is 100 percent
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
Handwritten Digit Recognition and Classification Using Machine Learning
In this paper, multiple learning techniques based on Optical character recognition (OCR) for the handwritten digit recognition are examined, and a new accuracy level for recognition of the MNIST dataset is reported. The proposed framework involves three primary parts, image pre-processing, feature extraction and classification. This study strives to improve the recognition accuracy by more than 99% in handwritten digit recognition. As will be seen, pre-processing and feature extraction play crucial roles in this experiment to reach the highest accuracy
Reliable pattern recognition system with novel semi-supervised learning approach
Over the past decade, there has been considerable progress in the design of statistical machine learning strategies, including Semi-Supervised Learning (SSL) approaches. However, researchers still have difficulties in applying most of these learning strategies when two or more classes overlap, and/or when each class has a bimodal/multimodal distribution. In this thesis, an efficient, robust, and reliable recognition system with a novel SSL scheme has been developed to overcome overlapping problems between two classes and bimodal distribution within each class. This system was based on the nature of category learning and recognition to enhance the system's performance in relevant applications. In the training procedure, besides the supervised learning strategy, the unsupervised learning approach was applied to retrieve the "extra information" that could not be obtained from the images themselves. This approach was very helpful for the classification between two confusing classes. In this SSL scheme, both the training data and the test data were utilized in the final classification. In this thesis, the design of a promising supervised learning model with advanced state-of-the-art technologies is firstly presented, and a novel rejection measurement for verification of rejected samples, namely Linear Discriminant Analysis Measurement (LDAM), is defined. Experiments on CENPARMI's Hindu-Arabic Handwritten Numeral Database, CENPARMI's Numerals Database, and NIST's Numerals Database were conducted in order to evaluate the efficiency of LDAM. Moreover, multiple verification modules, including a Writing Style Verification (WSV) module, have been developed according to four newly defined error categories. The error categorization was based on the different costs of misclassification. The WSV module has been developed by the unsupervised learning approach to automatically retrieve the person's writing styles so that the rejected samples can be classified and verified accordingly. As a result, errors on CENPARMI's Hindu-Arabic Handwritten Numeral Database (24,784 training samples, 6,199 testing samples) were reduced drastically from 397 to 59, and the final recognition rate of this HAHNR reached 99.05%, a significantly higher rate compared to other experiments on the same database. When the rejection option was applied on this database, the recognition rate, error rate, and reliability were 97.89%, 0.63%, and 99.28%, respectivel
- …