Whale Optimisation Freeman Chain Code (WO-FCC) extraction algorithm for handwritten character recognition

• المؤلفون الرئيسيون: Muhammad Arif, Mohamad, Jamaludin, Sallim, Kohbalan, Moorthy
• التنسيق: Conference or Workshop Item
• اللغة: English
• منشور في: IEEE 2021
• الموضوعات: QA76 Computer software; T Technology (General)
• الوصول للمادة أونلاين: http://umpir.ump.edu.my/id/eprint/33451/1/Whale%20Optimisation%20Freeman%20Chain%20Code%20%28WO-FCC%29%20extraction%20algorithm.pdf; http://umpir.ump.edu.my/id/eprint/33451/; https://doi.org/10.1109/ICSECS52883.2021.00115
• المؤسسة: Universiti Malaysia Pahang Al-Sultan Abdullah

In order to improve the classification accuracy in the field of handwriting character recognition (HCR), the number of derivative algorithms has improved and the interest in feature extraction has increased. In this paper, we propose a metaheuristic method for feature extraction algorithm with Whale Optimisation Algorithm (WOA) based HCR. WOA is a swarm-based techniques that mimic the social behavior of groups of animals, which mimics the social behavior of humpback whales. Freeman chaincode (FCC) is utilised as a data representations of handwritten text images. Nevertheless, the representations of FCC depends on the length of the path and the branching of the character’s nodes. To solve this problem, we propose a metaheuristic approach through WOA to find the shortest path length and minimum computational time for handwriting recognition. Finally, the results were compared with the existing proposed Flower Pollination Algorithm (FPA) at the time of FCC extraction. The results show that WOA is a bit better at getting shorter path lengths than FPA in terms of path lengths. In terms of calculation time, WOA calculates faster calculation time by feature extraction than FPA.