Multiple-agents to identify and separate touching digits in unconstrained handwritten Hindi numerals

Date

2003-10-01

Author

Alhajj, R
Polat, Faruk

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

55
views

0
downloads

This paper presents a multiagent-based approach to the identification and recognition of touching in free handwritten Hindi numerals. We do not restrict our domain to touching pairs; rather, we consider numerals with arbitrary number of digits. Two agents are presented in this paper. The first agent works directly on the scanned image of the original handwritten number. It locates possible touching based on the thickness of handwriting. The other agent works on the thinned image. It segments the image into four categories of segments and tries to locate possible touching based on the rules that govern the connection of segments to form digits. After each of the two agents applies its own rules and investigates candidate possible touching cases, and to increase touching recognition rate, the two agents negotiate and try to agree on the actual touching cases. The experiments conducted so far are promising and successful. The obtained results are very encouraging with a success factor of 92.7%.

Subject Keywords

Theoretical Computer Science, Software, Artificial Intelligence

URI

https://hdl.handle.net/11511/47304

Journal

JOURNAL OF EXPERIMENTAL & THEORETICAL ARTIFICIAL INTELLIGENCE

DOI

https://doi.org/10.1080/09528130310001611586

Collections

Department of Computer Engineering, Article

Suggestions

OpenMETU
Core

Improving reinforcement learning by using sequence trees Girgin, Sertan; Polat, Faruk; Alhajj, Reda (Springer Science and Business Media LLC, 2010-12-01) This paper proposes a novel approach to discover options in the form of stochastic conditionally terminating sequences; it shows how such sequences can be integrated into the reinforcement learning framework to improve the learning performance. The method utilizes stored histories of possible optimal policies and constructs a specialized tree structure during the learning process. The constructed tree facilitates the process of identifying frequently used action sequences together with states that are visit...
Head finalization and morphological analysis in factored phrase-based statistical machine translation from English to Turkish İmren, Haydar; Çakıcı, Ruket; Department of Computer Engineering (2015) Machine Translation is a field of study which deals with translating text from one natural language to another automatically. Statistical Machine Translation generates the translations using statistical methods and bilingual text corpora. In this study, an approach for translating from English to Turkish is introduced. Turkish is an agglutinative language with a free constituent order, whereas English is not agglutinative and the constituent order is strict. Besides these differences, there is a lack of par...
Steering self-organized robot flocks through externally guided individuals Celikkanat, Hande; Şahin, Erol (Springer Science and Business Media LLC, 2010-09-01) In this paper, we study how a self-organized mobile robot flock can be steered toward a desired direction through externally guiding some of its members. Specifically, we propose a behavior by extending a previously developed flocking behavior to steer self-organized flocks in both physical and simulated mobile robots. We quantitatively measure the performance of the proposed behavior under different parameter settings using three metrics, namely, (1) the mutual information metric, adopted from Information ...
One-dimensional representation of two-dimensional information for HMM based handwriting recognition Arica, N; Yarman Vural, Fatoş Tunay (Elsevier BV, 2000-06-01) In this study, we introduce a one-dimensional feature set, which embeds two-dimensional information into an observation sequence of one-dimensional string, selected from a code-book. It provides a consistent normalization among distinct classes of shapes, which is very convenient for Hidden Markov Model (HMM) based shape recognition schemes. The normalization parameters, which maximize the recognition rate, are dynamically estimated in the training stage of HMM. The proposed recognition system is tested on ...
Coupling speech recognition and rule-based machine translation Köprü, Selçuk; Yazıcı, Adnan; Department of Computer Engineering (2008) The objective of this thesis was to study the coupling of automatic speech recognition (ASR) systems with rule-based machine translation (MT) systems. In this thesis, a unique approach to integrating ASR with MT for speech translation (ST) tasks was proposed. The proposed approach is unique, essentially because it includes the rst rule-based MT system that can process speech data in a word graph format. Compared to other rule-based MT systems, our system processes both a word graph and a stream of words. Th...

Citation Formats

R. Alhajj and F. Polat, “Multiple-agents to identify and separate touching digits in unconstrained handwritten Hindi numerals,” JOURNAL OF EXPERIMENTAL & THEORETICAL ARTIFICIAL INTELLIGENCE, pp. 461–471, 2003, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/47304.