A Complete Bengali OCR: A Novel Hybrid Approach to Handwritten Bengali Character Recognition

A complete Bengali OCR is presented incorporating a novel hybrid approach to handwritten Bengali character recognition. The idea is to combine structural analysis and template matching techniques in order to recognise the handwritten Bengali characters. Handwritten Bengali characters are inherently cursive and there is an absence of well-defined strokes. In this approach, the character set has been separated into different distinct sub-classes based one some distinguishable structural features. Details of several approaches to detect these structural features are presented. Structural and syntactic features have been generated from the training samples to generate distinct character signatures. A match dictionary has been devised based on these character signatures, that helps in collecting multiple prototypes from the training samples. A revised form of continuity analysis is applied to match the test characters to the characters in the match dictionary. This complete OCR has been thoroughly implemented and tested and very promising results have been achieved in this direction

A Complete Bengali OCR: A Novel Hybrid Approach to Handwritten Bengali Character Recognition

A complete Bengali OCR is presented incorporating a novel hybrid approach to handwritten Bengali character recognition. The idea is to combine structural analysis and template matching techniques in order to recognise the handwritten Bengali characters. Handwritten Bengali characters are inherently cursive and there is an absence of well-defined strokes. In this approach, the character set has been separated into different distinct sub-classes based one some distinguishable structural features. Details of several approaches to detect these structural features are presented. Structural and syntactic features have been generated from the training samples to generate distinct character signatures. A match dictionary has been devised based on these character signatures, that helps in collecting multiple prototypes from the training samples. A revised form of continuity analysis is applied to match the test characters to the characters in the match dictionary. This complete OCR has been thoroughly implemented and tested and very promising results have been achieved in this direction

A NEW STRING MATCHING ALGORITHM

In this paper a new exact string-matching algorithm with sub-linear average case complexity has been presented. Unlike other sub-linear string-matching algorithms it never performs more than n text character comparisons while working on a text of length n. It requires only O(m þ s) extra pre-processing time and space, where m is the length of the pattern and s is the size of the alphabet

On the bounds of min-max pair heap construction

Abstract-m this paper, lower and upper bounds for min-max pair heap construction has been presented. It has been shown that the construction of a min-max pair heap with n elements requires at least 2.07n element comparisons. A new algorithm for creating min-max pair heap has been devised that lowers the upper bound to 2.43n. @ 2002 Elsevier Science Ltd. All rights reserved

Technical section Drawing lines by uniform packing

In this paper, we introduce a new approach to line drawing that attempts to maintain a uniform packing density of horizontal segments to diagonal segments throughout the line. While the conventional line drawing algorithms perform linear time computations to find the location of the pixels, our algorithm takes logarithmic time. Also, experimental results show that the quality of line is acceptable and comparable to the well-known Bresenham’s line-drawing algorithm