Mohamad, Muhammad `Arif and Nasien, Dewi and Haron, Habibollah (2015) Harmony search freeman chain code (HS-FCC) extraction algorithm for handwritten character recognition. In: The Fourth International Conference on Computer Science & Computational Mathematics (ICCSCM 2015), 7-8 May, 2015, Kedah, Malaysia.
Full text not available from this repository.
Official URL: http://comp.utm.my/dewinasien/publication-in-detai...
Abstract
In handwritten character recognition, interest in feature extraction has been on the increase with the abundance of algorithms derived to increase the accuracy of classification. In this paper, a metaheuristic approach for feature extraction technique based on Harmony Search Algorithm is proposed using Freeman chain code as data representation. Proposed algorithm is to find the shortest route length and minimum computational time for chain code extraction from the handwritten character thinned binary image. The result is shown to be superior compared to other meta-heuristic approaches such as Differential Equation, Particle Swarm Optimization, Genetic Algorithm and Ant Colony Optimization.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Uncontrolled Keywords: | metaheuristic, algorithm |
| Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
| Divisions: | Computing |
| ID Code: | 60688 |
| Deposited By: | Fazli Masari |
| Deposited On: | 27 Feb 2017 03:21 |
| Last Modified: | 27 Feb 2017 03:21 |
Repository Staff Only: item control page
