Paper
18 January 2010 Ant colony optimization with selective evaluation for feature selection in character recognition
Il-Seok Oh, Jin-Seon Lee
Author Affiliations +
Proceedings Volume 7534, Document Recognition and Retrieval XVII; 75340Y (2010) https://doi.org/10.1117/12.839924
Event: IS&T/SPIE Electronic Imaging, 2010, San Jose, California, United States
Abstract
This paper analyzes the size characteristics of character recognition domain with the aim of developing a feature selection algorithm adequate for the domain. Based on the results, we further analyze the timing requirements of three popular feature selection algorithms, greedy algorithm, genetic algorithm, and ant colony optimization. For a rigorous timing analysis, we adopt the concept of atomic operation. We propose a novel scheme called selective evaluation to improve convergence of ACO. The scheme cut down the computational load by excluding the evaluation of unnecessary or less promising candidate solutions. The scheme is realizable in ACO due to the valuable information, pheromone trail which helps identify those solutions. Experimental results showed that the ACO with selective evaluation was promising both in timing requirement and recognition performance.
© (2010) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Il-Seok Oh and Jin-Seon Lee "Ant colony optimization with selective evaluation for feature selection in character recognition", Proc. SPIE 7534, Document Recognition and Retrieval XVII, 75340Y (18 January 2010); https://doi.org/10.1117/12.839924
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Detection and tracking algorithms

Feature selection

Optical character recognition

Genetic algorithms

Optimization (mathematics)

Chromium

Algorithm development

Back to Top