Two template matching approaches to Arabic, Amharic and Latin isolated characters recognition
Machine Graphics & Vision International Journal
An improvement over template matching using K-means algorithm for printed cursive script recognition
SPPR'07 Proceedings of the Fourth conference on IASTED International Conference: Signal Processing, Pattern Recognition, and Applications
An improvement over template matching using k-means algorithm for printed cursive script recognition
SPPRA '07 Proceedings of the Fourth IASTED International Conference on Signal Processing, Pattern Recognition, and Applications
| Hi-index | 0.00 |
The goal to produce effective Optical Character Recognition (OCR) methods has lead to the development of a number of algorithms. The purpose of these is to take the hand-written or printed text and to translate it into a corresponding digital form. The multitude requirements and developments are well represented in the literature (see for example Abuhaiba [1 J and Suen [2 J).The primary objective of this paper is to provide an insight into a robust system which has been successfully developed and employed to recognize Latin and Arabic characters and whose workings has been described by the authors in a sister publication [3 J .The focus here is to discuss the main components used in the multi-stage system, paying particular attention to the nonnalization process used for orientation and size for a given bitmapped character. The effectiveness of the approach is demonstrated through its workings for the Arabic and Latin case, for both characters and numbers.