MatriVasha: A Multipurpose Comprehensive Database for Bangla Handwritten Compound Characters

At present, recognition of the Bangla handwriting compound character has been an essential issue for many years. In recent years there have been application-based researches in machine learning, and deep learning, which is gained interest, and most notably is handwriting recognition because it has a tremendous application such as Bangla OCR. MatrriVasha, the project which can recognize Bangla, handwritten several compound characters. Currently, compound character recognition is an important topic due to its variant application, and helps to create old forms, and information digitization with reliability. But unfortunately, there is a lack of a comprehensive dataset that can categorize all types of Bangla compound characters. MatrriVasha is an attempt to align compound character, and it's challenging because each person has a unique style of writing shapes. After all, MatrriVasha has proposed a dataset that intends to recognize Bangla 120(one hundred twenty) compound characters that consist of 2552(two thousand five hundred fifty-two) isolated handwritten characters written unique writers which were collected from within Bangladesh. This dataset faced problems in terms of the district, age, and gender-based written related research because the samples were collected that includes a verity of the district, age group, and the equal number of males, and females. As of now, our proposed dataset is so far the most extensive dataset for Bangla compound characters. It is intended to frame the acknowledgment technique for handwritten Bangla compound character. In the future, this dataset will be made publicly available to help to widen the research.Comment: 19 fig, 2 tabl

Development of Handwriting Recognition System in Postal Service Sector

Handwriting recognition is a comparatively popular research due to its diverse applicable environment. It helps to solve complicated problems and at the same time, it reduces manpower consumption. This paper proposes a system for recognizing online handwritten characters by using KNearest Neighbor (KNN). General steps of an algorithm are: (1) capturing the postcode and name of district area by using external web camera, (2) performing image processing on the image, (3) creating input data for KNN by extracting vital feature from each character, (4) classifying the dataset using KNN algorithm and performing recognition during the test, and (5) providing result of the recognition. The experiment was carried out in the aspect of text font size, the density of text and light intensity of background text. Experiment results show that training sets, trained inputs and untrained inputs achieved reasonably good result with an accuracy rate of 100%, 87.54% and 75.35% respectively. For processing time, the training sets consumed the lowest processing time which is 195.32ms, followed by trained inputs with 201.30ms and untrained inputs with 204.98ms. Additionally, medium font size, high-density text and optimum intensity of the background text managed to achieve high accuracy rate and low processing time. In this way, the system is able to help the postal services sector to speed up the sorting process as well as reducing manpower consumption in the sorting unit at the same time. Overall, the system has fulfilled the objective of the project, which is to propose high accuracy and short processing time of the handwriting recognition system

RAPID ANALYTICAL VERIFICATION OF HANDWRITTEN ALPHANUMERIC ADDRESS FIELDS

Microsoft, Motorola, Siemens, Hitachi, IAPR, NICI, IUF This paper presents a combination of fuzzy system and dynamic analytical model to deal with imprecise data derived from feature extraction in handwritten address images which are compared against postulated addresses for address verification. A dynamic building­number locator is able to locate and recognise the building­number, without knowing exactly where the building­number starts in the candidate address line. The overall system achieved a correct sorting rate of 72.9%, 27.1% rejection rate and 0.0% error rate on a blind test set of 450 cursive handwritten addresses.

An Integrated architecture for recognition of totally unconstrained handwritten numerals

Reprint. Reprinted from the International journal of pattern recognition and artificial intelligence. Vol. 7, no. 4 (1993) "January 1993."Includes bibliographical references (p. 127-128).Supported by the Productivity From Information Technology (PROFIT) Research Initiative at MIT.Amar Gupta ... [et al.

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

Comparison of crisp and fuzzy character networks in handwritten word recognition

Experiments involving handwritten word recognition on words taken from images of handwritten address blocks from the United States Postal Service mailstream are described. The word recognition algorithm relies on the use of neural networks at the character level. The neural networks are trained using crisp and fuzzy desired outputs. The fuzzy outputs were defined using a fuzzy k-nearest neighbor algorithm. The crisp networks slightly outperformed the fuzzy networks at the character level but the fuzzy networks outperformed the crisp networks at the word level

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

A Computational Theory of Contextual Knowledge in Machine Reading

Machine recognition of off–line handwriting can be achieved by either recognising words as individual symbols (word level recognition) or by segmenting a word into parts, usually letters, and classifying those parts (letter level recognition). Whichever method is used, current handwriting recognition systems cannot overcome the inherent ambiguity in writingwithout recourse to contextual information. This thesis presents a set of experiments that use Hidden Markov Models of language to resolve ambiguity in the classification process. It goes on to describe an algorithm designed to recognise a document written by a single–author and to improve recognition by adaptingto the writing style and learning new words. Learning and adaptation is achieved by reading the document over several iterations. The algorithm is designed to incorporate contextual processing, adaptation to modify the shape of known words and learning of new words within a constrained dictionary. Adaptation occurs when a word that has previously been trained in the classifier is recognised at either the word or letter level and the word image is used to modify the classifier. Learning occurs when a new word that has not been in the training set is recognised at the letter level and is subsequently added to the classifier. Words and letters are recognised using a nearest neighbour classifier and used features based on the two–dimensional Fourier transform. By incorporating a measure of confidence based on the distribution of training points around an exemplar, adaptation and learning is constrained to only occur when a word is confidently classified. The algorithm was implemented and tested with a dictionary of 1000 words. Results show that adaptation of the letter classifier improved recognition on average by 3.9% with only 1.6% at the whole word level. Two experiments were carried out to evaluate the learning in the system. It was found that learning accounted for little improvement in the classification results and also that learning new words was prone to misclassifications being propagated