Universiti Teknologi Malaysia Institutional Repository

Metaheuristics Methods (GA & ACO) for minimizing the length of freeman chain code from handwritten isolated characters

Haron, Habibollah and Nasien, Dewi and Yuhanis, Siti Sophiayati (2010) Metaheuristics Methods (GA & ACO) for minimizing the length of freeman chain code from handwritten isolated characters. In: International Conference on Computer and Information Science (ICCIS 2010), 24-26 Februari 2010, Bayview Beach Resort, Pulau Pinang.

Full text not available from this repository.

Official URL: http://waset.org/publications/13608/metaheuristics...

Abstract

This paper presents a comparison of metaheuristic algorithms, Genetic Algorithm (GA) and Ant Colony Optimization (ACO), in producing freeman chain code (FCC). The main problem in representing characters using FCC is the length of the FCC depends on the starting points. Isolated characters, especially the upper-case characters, usually have branches that make the traversing process difficult. The study in FCC construction using one continuous route has not been widely explored. This is our motivation to use the population-based metaheuristics. The experimental result shows that the route length using GA is better than ACO, however, ACO is better in computation time than GA.

Item Type:Conference or Workshop Item (Paper)
Uncontrolled Keywords:Handwriting Recognition, Feature Extraction, Freeman Chain Code, Genetic Algorithm and Ant Colony Optimization.
Subjects:Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions:Computer Science and Information System (Formerly known)
ID Code:24092
Deposited By: Mrs Liza Porijo
Deposited On:24 Sep 2012 06:32
Last Modified:02 Jul 2017 08:17

Repository Staff Only: item control page