No abstract

No abstract

No abstract

No abstract

No abstract

One of the most recent challenging issues of pattern recognition and artificial intelligence is Arabic text recognition. This research topic is still a pervasive and unaddressed research field, because of several factors. Complications arise due to the cursive nature of the Arabic writing, character similarities, unlimited vocabulary, use of multi-size and mixed-fonts, etc. To handle these challenges, an automatic Arabic text recognition requires building a robust system by computing discriminative features and applying a rigorous classifier together to achieve an improved performance. In this work, we introduce a new deep learning based system that recognizes Arabic text contained in images. We propose a novel hybrid network, combining a Bag-of-Feature (BoF) framework for feature extraction based on a deep Sparse Auto-Encoder (SAE), and Hidden Markov Models (HMMs), for sequence recognition. Our proposed system, termed BoF-deep SAE-HMM, is tested on four datasets, namely the printed Arabic line images Printed KHATT (P-KHATT), the benchmark printed word images Arabic Printed Text Image (APTI), the benchmark handwritten Arabic word images IFN/ENIT, and the benchmark handwritten digits images Modified National Institute of Standards and Technology (MNIST).

Nowadays, the number of mobile applications based on image registration and recognition is increasing. Most interesting applications include mobile translator which can read text characters in the real world and translates it into the native language instantaneously. In this context, we aim to recognize characters in natural scenes by computing significant points so called key points or features/interest points in the image. So, it will be important to compare and evaluate features descriptors in terms of matching accuracy and processing time in a particular context of natural scene images.In this paper, we were interested on comparing the efficiency of the binary features as alternatives to the traditional SIFT and SURF in matching Arabic characters descended from natural scenes. We demonstrate that the binary descriptor ORB yields not only to similar results in terms of matching characters performance that the famous SIFT but also to faster computation suitable for mobile applications.

No abstract