Improved artificial bee colony algorithm and its application in image threshold segmentation

Author(s):  
Fengcai Huo ◽  
Yuanxiong Wang ◽  
Weijian Ren

The appearance of shadows typically causes severe problems in pc vision. There are various methods have already put forward but scope in this field is open. In this article Shadow Detection and Removal Using Modified artificial bee colony (MABC) Algorithm with Multilevel Threshold segmentation is proposed. The proposed method uses three threshold and corresponding boundaries, associated curvature, edge response, gradient, and MABC algorithm. First data preprocessing is applied to find the correlation between the pixels then three threshold and corresponding boundaries evaluated to accurately differentiate pixels as foreground. The edge response, curvature, gradient are applied to find the boundaries. Finally, MABC has been applied for detecting the shadow. The results show improvement in comparison with other existing methods


2020 ◽  
Vol 38 (9A) ◽  
pp. 1384-1395
Author(s):  
Rakaa T. Kamil ◽  
Mohamed J. Mohamed ◽  
Bashra K. Oleiwi

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%.


2013 ◽  
Vol 32 (12) ◽  
pp. 3326-3330
Author(s):  
Yin-xue ZHANG ◽  
Xue-min TIAN ◽  
Yu-ping CAO

Sign in / Sign up

Export Citation Format

Share Document