Segmentation and Edge Extraction of Grayscale Images Using Firefly and Artificial Bee Colony Algorithms

Author(s):  
Donatella Giuliani

This chapter proposes an unsupervised grayscale image segmentation method based on the Firefly and Artificial Bee Colony algorithms. The Firefly Algorithm is applied in a histogram-based research of cluster centroids to determine the number of clusters and the gray levels, successively used in the initialization step for the parameter estimation of a Gaussian Mixture Model. The coefficients of the linear super-position of Gaussians can be thought of as prior probabilities of each component. Applying the Bayes rule, the posterior probabilities of the grayscale intensities are evaluated and their maxima are used to assign each pixel to clusters. Subsequently, region spatial information is extracted to form homogeneous regions through ABC algorithm. Initially, scout bees are moving on the search space describing random paths, with food sources given by the detected homogeneous regions. Then onlooker bees rush to scouts' aid proportionally to unclassified pixels enclosed into the bounded boxes of the discovered regions.

2018 ◽  
Vol 9 (1) ◽  
pp. 39-57
Author(s):  
Donatella Giuliani

In this article, the author proposes an unsupervised grayscale image segmentation method based on a combination of the Firefly Algorithm and the Gaussian Mixture Model. Firstly, the Firefly Algorithm has been applied in a histogram-based research of cluster centroids. The Firefly Algorithm is a stochastic global optimization technique, centred on the flashing characteristics of fireflies. In this histogram-based segmentation approach, it is employed to determine the number of clusters and to select the gray levels for grouping pixels into homogeneous regions. Successively these gray values are used in the initialization step for the parameter estimation of a Gaussian Mixture Model. The parametric probability density function of a Gaussian Mixture Model is represented as a weighted sum of Gaussian components, whose parameters are evaluated applying the iterative Expectation-Maximization technique. The coefficients of the linear super-position of Gaussians can be thought as prior probabilities of each component. Applying the Bayes rule, the posterior probabilities of the grayscale intensities have been evaluated, therefore their maxima are used to assign each pixel to the clusters, according to their gray levels.


2018 ◽  
Vol 10 (1) ◽  
pp. 17
Author(s):  
Nursyiva Irsalinda ◽  
Sugiyarto Surono

Artificial Bee Colony (ABC) algorithm is one of metaheuristic optimization technique based on population. This algorithm mimicking honey bee swarm to find the best food source. ABC algorithm consist of four phases: initialization phase, employed bee phase, onlooker bee phase and scout bee phase. This study modify the onlooker bee phase in selection process to find the neighborhood food source. Not all food sources obtained are randomly sought the neighborhood as in ABC algorithm. Food sources are selected by comparing their objective function values. The food sources that have value lower than average value in that iteration will be chosen by onlooker bee to get the better food source. In this study the modification of this algorithm is called New Modification of Artificial Bee Colony Algorithm (MB-ABC). MB-ABC was applied to 4 Benchmark functions. The results show that MB-ABC algorithm better than ABC algorithm


2021 ◽  
pp. 1-16
Author(s):  
Ghizlane Khababa ◽  
Fateh Seghir ◽  
Sadik Bessou

 In this paper, we introduce an extended version of artificial bee colony with a local search method (EABC) for solving the QoS uncertainty-aware web service composition (IQSC) problem, where the ambiguity of the QoS properties are represented using the interval-number model. At first, we formulate the addressed problem as an interval constrained single-objective optimization model. Then, we use the skyline operator to prune the redundant and dominated web services from their sets of functionally equivalent ones. Whereas, EABC is employed to solve the IQSC problem in a reduced search space more effectively and more efficiently. For the purpose of validation of the performance and the efficiency of the proposed approach, we present the experimental comparisons to an existing skyline-based PSO, an efficient discrete gbest-guided artificial bee colony and a recently provided Harris Hawks optimization with an elite evolutionary strategy algorithms on an interval extended version of the public QWS dataset.


2018 ◽  
Vol 2018 ◽  
pp. 1-9 ◽  
Author(s):  
Amnat Panniem ◽  
Pikul Puphasuk

Artificial Bee Colony (ABC) algorithm is one of the efficient nature-inspired optimization algorithms for solving continuous problems. It has no sensitive control parameters and has been shown to be competitive with other well-known algorithms. However, the slow convergence, premature convergence, and being trapped within the local solutions may occur during the search. In this paper, we propose a new Modified Artificial Bee Colony (MABC) algorithm to overcome these problems. All phases of ABC are determined for improving the exploration and exploitation processes. We use a new search equation in employed bee phase, increase the probabilities for onlooker bees to find better positions, and replace some worst positions by the new ones in onlooker bee phase. Moreover, we use the Firefly algorithm strategy to generate a new position replacing an unupdated position in scout bee phase. Its performance is tested on selected benchmark functions. Experimental results show that MABC is more effective than ABC and some other modifications of ABC.


Mathematics ◽  
2021 ◽  
Vol 10 (1) ◽  
pp. 73
Author(s):  
Kaixiang Zhu ◽  
Lily D. Li ◽  
Michael Li

Although educational timetabling problems have been studied for decades, one instance of this, the school timetabling problem (STP), has not developed as quickly as examination timetabling and course timetabling problems due to its diversity and complexity. In addition, most STP research has only focused on the educators’ availabilities when studying the educator aspect, and the educators’ preferences and expertise have not been taken into consideration. To fill in this gap, this paper proposes a conceptual model for the school timetabling problem considering educators’ availabilities, preferences and expertise as a whole. Based on a common real-world school timetabling scenario, the artificial bee colony (ABC) algorithm is adapted to this study, as research shows its applicability in solving examination and course timetabling problems. A virtual search space for dealing with the large search space is introduced to the proposed model. The proposed approach is simulated with a large, randomly generated dataset. The experimental results demonstrate that the proposed approach is able to solve the STP and handle a large dataset in an ordinary computing hardware environment, which significantly reduces computational costs. Compared to the traditional constraint programming method, the proposed approach is more effective and can provide more satisfactory solutions by considering educators’ availabilities, preferences, and expertise levels.


2021 ◽  
Author(s):  
Radhwan A.A. Saleh ◽  
Rüştü Akay

Abstract As a relatively new model, the Artificial Bee Colony Algorithm (ABC) has shown impressive success in solving optimization problems. Nevertheless, its efficiency is still not satisfactory for some complex optimization problems. This paper has modified ABC and its other recent variants to improve its performance by modify the scout phase. This modification enhances its exploitation ability by intensifying the regions in the search space, which probably includes reasonable solutions. The experiments were performed on the CEC2014 benchmark suite, CEC2015 benchmark functions, and three real-life problems: pressure vessel design problem, tension and compression spring design problem, and Frequency-Modulated (FM) problem. And the proposed modification was applied to basic ABC, Gbest-Guided ABC, Depth First Search ABC, and Teaching Learning Based ABC, and they were compared with their modified counterparts. The results have shown that our modification can successfully increase the performance of the original versions. Moreover, the proposed modified algorithm was compared with the state-of-the-art optimization algorithms, and it produced competitive results.


Author(s):  
SRIDEEPA BANERJEE ◽  
AKANKSHA BHARADWAJ ◽  
DAYA GUPTA ◽  
V.K. PANCHAL

Remote Sensing has been globally used for knowledge elicitation of earth’s surface and atmosphere. Land cover mapping, one of the widely used applications of remote sensing is a method for acquiring geo-spatial information from satellite data. We have attempted here to solve the land cover problem by image classification using one of the newest and most promising Swarm techniques of Artificial Bee Colony optimization (ABC). In this paper we propose an implementation of ABC for satellite image classification. ABC is used for optimal classification of images for mapping the land-usage efficiently. The results produced by ABC algorithm are compared with the results obtained by other techniques like BBO, MLC, MDC, Membrane computing and Fuzzy classifier to show the effectiveness of our proposed implementation.


2016 ◽  
pp. 1187-1191
Author(s):  
Sheng-Ta Hsieh ◽  
Chun-Ling Lin ◽  
Shih-Yuan Chiu

Sign in / Sign up

Export Citation Format

Share Document