An Improved Artificial Bee Colony Algorithm for the Object Recognition Problem in Complex Digital Images Using Template Matching

2010 ◽  
Vol 1 (2) ◽  
pp. 54-70 ◽  
Author(s):  
Chidambaram Chidambaram ◽  
Heitor Silvério Lopes
Keyword(s):  
Object Recognition ◽  
Template Matching ◽  
Artificial Bee Colony Algorithm ◽  
Artificial Bee Colony ◽  
Digital Images ◽  
Color Images ◽  
Recognition Problem ◽  
Reference Image ◽  
Bee Colony ◽  
Collective Foraging

In this paper, the authors present an improved Artificial Bee Colony Algorithm (ABC) for the object recognition problem in complex digital images. The ABC is a new metaheuristics approach inspired by the collective foraging behavior of honey bee swarms. The objective is to find a pattern or reference image (template) of an object somewhere in a target landscape scene that may contain noise and changes in brightness and contrast. First, several search strategies were tested to find the most appropriate. Next, many experiments were done using complex digital grayscale and color images. Results are analyzed and compared with other algorithms through Pareto plots and graphs that show that the improved ABC was more efficient than the original ABC.

An Improved Artificial Bee Colony Algorithm for the Object Recognition Problem in Complex Digital Images Using Template Matching

2012 ◽  
pp. 141-157 ◽  
Author(s):  
Chidambaram Chidambaram ◽  
Heitor Silvério Lopes
Keyword(s):  
Object Recognition ◽  
Template Matching ◽  
Artificial Bee Colony Algorithm ◽  
Artificial Bee Colony ◽  
Digital Images ◽  
Color Images ◽  
Recognition Problem ◽  
Reference Image ◽  
Bee Colony ◽  
Collective Foraging

In this paper, the authors present an improved Artificial Bee Colony Algorithm (ABC) for the object recognition problem in complex digital images. The ABC is a new metaheuristics approach inspired by the collective foraging behavior of honey bee swarms. The objective is to find a pattern or reference image (template) of an object somewhere in a target landscape scene that may contain noise and changes in brightness and contrast. First, several search strategies were tested to find the most appropriate. Next, many experiments were done using complex digital grayscale and color images. Results are analyzed and compared with other algorithms through Pareto plots and graphs that show that the improved ABC was more efficient than the original ABC.

scholarly journals A Novel Artificial Bee Colony Algorithm Based on Internal-Feedback Strategy for Image Template Matching

2014 ◽  
Vol 2014 ◽  
pp. 1-14 ◽  
Author(s):  
Bai Li ◽  
Li-Gang Gong ◽  
Ya Li
Keyword(s):  
Template Matching ◽  
Artificial Bee Colony ◽  
Similarity Criterion ◽  
Reference Image ◽  
Source Image ◽  
Abc Algorithm ◽  
Internal Feedback ◽  
Bee Colony ◽  
Equal Chance ◽  
Match Location

Image template matching refers to the technique of locating a given reference image over a source image such that they are the most similar. It is a fundamental mission in the field of visual target recognition. In general, there are two critical aspects of a template matching scheme. One is similarity measurement and the other is best-match location search. In this work, we choose the well-known normalized cross correlation model as a similarity criterion. The searching procedure for the best-match location is carried out through an internal-feedback artificial bee colony (IF-ABC) algorithm. IF-ABC algorithm is highlighted by its effort to fight against premature convergence. This purpose is achieved through discarding the conventional roulette selection procedure in the ABC algorithm so as to provide each employed bee an equal chance to be followed by the onlooker bees in the local search phase. Besides that, we also suggest efficiently utilizing the internal convergence states as feedback guidance for searching intensity in the subsequent cycles of iteration. We have investigated four ideal template matching cases as well as four actual cases using different searching algorithms. Our simulation results show that the IF-ABC algorithm is more effective and robust for this template matching mission than the conventional ABC and two state-of-the-art modified ABC algorithms do.

Self-Adaptive and Adaptive Parameter Control in Improved Artificial Bee Colony Algorithm

Informatica ◽  
2017 ◽  
Vol 28 (3) ◽  
pp. 415-438 ◽  
Author(s):  
Bekir Afşar ◽  
Doğan Aydin ◽  
Aybars Uğur ◽  
Serdar Korukoğlu
Keyword(s):  
Artificial Bee Colony Algorithm ◽  
Artificial Bee Colony ◽  
Parameter Control ◽  
Adaptive Parameter ◽  
Bee Colony ◽  
Adaptive Parameter Control ◽  
Self Adaptive

Path Planning of Mobile Robot Using Improved Artificial Bee Colony Algorithm

2020 ◽  
Vol 38 (9A) ◽  
pp. 1384-1395
Author(s):  
Rakaa T. Kamil ◽  
Mohamed J. Mohamed ◽  
Bashra K. Oleiwi
Keyword(s):  
Mobile Robot ◽  
Comparative Research ◽  
Artificial Bee Colony Algorithm ◽  
Artificial Bee Colony ◽  
Dynamic Control ◽  
Computational Time ◽  
Bee Colony ◽  
Shortest Distance ◽  
Minimum Number ◽  
Cubic Polynomial

A modified version of the artificial Bee Colony Algorithm (ABC) was suggested namely Adaptive Dimension Limit- Artificial Bee Colony Algorithm (ADL-ABC). To determine the optimum global path for mobile robot that satisfies the chosen criteria for shortest distance and collision–free with circular shaped static obstacles on robot environment. The cubic polynomial connects the start point to the end point through three via points used, so the generated paths are smooth and achievable by the robot. Two case studies (or scenarios) are presented in this task and comparative research (or study) is adopted between two algorithm’s results in order to evaluate the performance of the suggested algorithm. The results of the simulation showed that modified parameter (dynamic control limit) is avoiding static number of limit which excludes unnecessary Iteration, so it can find solution with minimum number of iterations and less computational time. From tables of result if there is an equal distance along the path such as in case A (14.490, 14.459) unit, there will be a reduction in time approximately to halve at percentage 5%.

Artificial bee colony algorithm with modified search strategy

2013 ◽  
Vol 32 (12) ◽  
pp. 3326-3330
Author(s):  
Yin-xue ZHANG ◽  
Xue-min TIAN ◽  
Yu-ping CAO
Keyword(s):  
Artificial Bee Colony Algorithm ◽  
Artificial Bee Colony ◽  
Search Strategy ◽  
Bee Colony
Sign in / Sign up

Export Citation Format

Share Document