Non-Linear Segmentation of Touched Roman Characters Based on Genetic Algorithm
Journal Title: International Journal on Computer Science and Engineering - Year 2010, Vol 2, Issue 6
Abstract
The segmentation accuracy of Roman cursive characters, especially touched characters, is essential for the high performance of Optical Character Recognition Systems. This paper presents a new approach for non-linear segmentation of multiple touched Roman cursive characters based on genetic algorithm. Initially, a possible segmentation zone is detected and then best segmentation path is evolved by genetic gorithm. The initial population is composed of each point column in possible segmentation zone. The individual coding, fitness function, crossover operator and mutation operator are also defined for this task. Experimental results on a test set extracted on the IAM benchmark database exhibit high segmentation accuracy up to 89.76%. Proposed approach can handle some complex types of touched cursive characters without special heuristic rules and recognition.
Authors and Affiliations
Tanzila Saba, , Ghazali Sulong , Amjad Rehman
Keywords
Related Articles
- EP ID EP108066
- DOI -
- Views 114
- Downloads 0
Text Summarization and Discovery of Frames and Relationship from Natural Language Text - A R&D Methodology
The paper deals with the concept of data mining whereby the data resources can be fetched and accessed accordingly with reduced time complexity. Resource sharing is an important aspect in the field of information science...
A NEW APPROACH FOR VARIANT MULTI ASSIGNMENT PROBLEM
A large number of real-world planning problems called Combinatorial Optimization Problems share the following properties: They are Optimization Problems, are easy to state, and have a finite but usually very large number...
An Algorithm for Finding Frequent Itemset based on Lattice Approach for Lower Cardinality Dense and Sparse Dataset
Whenever mining association rules work for large data sets frequently itemset always play an important role and enhance the performance. Apriori algorithm is widely used for mining association rule which uses frequent it...
Predicted Link Expiration Time Based Connected Dominating Sets for Mobile Ad hoc Networks
We propose an algorithm to determine stable connected dominating sets (CDS), based on the predicted link expiration time (LET), for mobile ad hoc networks (MANETs). The roposed LETbased CDS algorithm is the first such al...
Anti-Synchronization of the Hyperchaotic Liu and Hyperchaotic Qi Systems by Active Control
This paper investigates the problem of anti-synchronization of identical hyperchaotic Liu systems (2008), hyperchaotic Qi systems (2008) and non-identical hyperchaotic Liu and hyperchaotic Qi systems using active nonline...