Ahmed A. Ewees

Whale Optimization Algorithm and Moth-Flame Optimization for multilevel thresholding image segmentation

Two metaheuristic algorithms (WOA and MFO) are used.These algorithms are applied to multilevel thresholding image segmentation.MFO and WOA are better than compared algorithms.MFO is better than WOA for higher number of thresholds. Determining the optimal thresholding for image segmentation has got more attention in recent years since it has many applications. There are several methods used to find the optimal thresholding values such as Otsu and Kapur based methods. These methods are suitable for bi-level thresholding case and they can be easily extended to the multilevel case, however, the process of determining the optimal thresholds in the case of multilevel thresholding is time-consuming. To avoid this problem, this paper examines the ability of two nature inspired algorithms namely: Whale Optimization Algorithm (WOA) and Moth-Flame Optimization (MFO) to determine the optimal multilevel thresholding for image segmentation. The MFO algorithm is inspired from the natural behavior of moths which have a special navigation style at night since they fly using the moonlight, whereas, the WOA algorithm emulates the natural cooperative behaviors of whales. The candidate solutions in the adapted algorithms were created using the image histogram, and then they were updated based on the characteristics of each algorithm. The solutions are assessed using the Otsus fitness function during the optimization operation. The performance of the proposed algorithms has been evaluated using several of benchmark images and has been compared with five different swarm algorithms. The results have been analyzed based on the best fitness values, PSNR, and SSIM measures, as well as time complexity and the ANOVA test. The experimental results showed that the proposed methods outperformed the other swarm algorithms; in addition, the MFO showed better results than WOA, as well as provided a good balance between exploration and exploitation in all images at small and high threshold numbers.

Chaotic multi-verse optimizer-based feature selection

The multi-verse optimizer (MVO) is a new evolutionary algorithm inspired by the concepts of multi-verse theory namely, the white/black holes, which represents the interaction between the universes. However, the MVO has some drawbacks, like any other evolutionary algorithms, such as slow convergence and getting stuck in local optima (maximum or minimum). This paper provides a novel chaotic MVO algorithm (CMVO) to avoid these drawbacks, where chaotic maps are used to improve the performance of MVO algorithm. The CMVO algorithm is applied to solve the feature selection problem, in which five benchmark datasets are used to evaluate the performance of CMVO algorithm. The results of CMVO is compared with standard MVO and two other swarm algorithms. The experimental results show that logistic chaotic map is the best chaotic map that increases the performance of MVO, and also the MVO is better than other swarm algorithms.

Multi-objective whale optimization algorithm for content-based image retrieval

In the recent years, there are massive digital images collections in many fields of our life, which led the technology to find methods to search and retrieve these images efficiently. The content-based is one of the popular methods used to retrieve images, which depends on the color, texture and shape descriptors to extract features from images. However, the performance of the content-based image retrieval methods depends on the size of features that are extracted from images and the classification accuracy. Therefore, this problem is considered as a multi-objective and there are several methods that used to manipulate it such as NSGA-II and NSMOPSO. However, these methods have drawbacks such as their time and space complexity are large since they used traditional non-dominated sorting methods. In this paper, a new non-dominated sorting based on multi-objective whale optimization algorithm is proposed for content-based image retrieval (NSMOWOA). The proposed method avoids the drawbacks in other non-dominated sorting multi-objective methods that have been used for content-based image retrieval through reducing the space and time complexity. The results of the NSMOWOA showed a good performance in content-based image retrieval problem in terms of recall and precision.

A Hybrid Krill-ANFIS Model for Wind Speed Forecasting

Finding an alternative renewable energy source instead of using traditional energy such as electricity or gas is an important research trend and challenge. This paper presents a new hybrid algorithm that uses Krill Herd (KH) optimization algorithm and Adaptive Neuro-Fuzzy Inference System (ANFIS) to be able to fit for wind speed forecasting, which is an essential step to generate wind power. ANFIS’s parameters are optimized using KH. The proposed model called (Krill-ANFIS). This model is compared with three models basic ANFIS, PSO-ANFIS, and GA-ANFIS. Krill-ANFIS proved that it can be used as an efficient predictor for the wind speed as well as it can achieve high results and performance measures of root mean square error (RMSE), Coefficient of determination \(R^{2}\) and average absolute percent relative error (AAPRE).

A Hybrid Method of Sine Cosine Algorithm and Differential Evolution for Feature Selection

The feature selection is an important step to improve the performance of classifier through reducing the dimension of the dataset, so the time complexity and space complexity are reduced. There are several feature selection methods are used the swarm techniques to determine the suitable subset of features. The sine cosine algorithm (SCA) is one of the recent swarm techniques that used as global optimization method to solve the feature selection, however, it can be getting stuck in local optima. In order to solve this problem, the differential evolution operators are used as local search method which helps the SCA to skip the local point. The proposed method is compared with other three algorithms to select the subset of features used eight UCI datasets. The experiments results showed that the proposed method provided better results than other methods in terms of performance measures and statistical test.

Feature Selection Based on Improved Runner-Root Algorithm Using Chaotic Singer Map and Opposition-Based Learning

The feature selection (FS) is an important step for data analysis. FS is used to reduce the dimension of data by selecting the relevant features; while removing the redundant, noisy and irrelevant features that lead to degradation of the performance. Several swarm techniques are used to solve the FS problem and these methods provide results better than classical approaches. However, most of these techniques have limitations such as slow convergence and time complexity. These limitations occur due that all the agents update their position according to the best one. However, this best agent may be not the optimal global solution for FS, therefore, the swarm getting stuck in a local solution. This paper proposes an improved Runner-Root Algorithm (RRA). The RRA is combined with chaotic Singer map and opposition-based learning to increase its accuracy. The experiments are performed in eight datasets and the performance of the proposed method is compared against swarm algorithms.

Training feedforward neural networks using Sine-Cosine algorithm to improve the prediction of liver enzymes on fish farmed on nano-selenite

Analytical prediction of oxidative stress biomarkers in ecosystem provides an expressive result for many stressors. These oxidative stress biomarkers including superoxide dismutase, glutathione peroxidase and catalase activity in fish liver tissue were analyzed within feeding different levels of selenium nanoparticles. Se-nanoparticles represent a salient defense mechanism in oxidative stress within certain limits; however, stress can be engendered from toxic levels of these nanoparticles. For instance, prediction of the level of pollution and/or stressors was elucidated to be improved with different levels of selenium nanoparticles using the bio-inspired Sine-Cosine algorithm (SCA). In this paper, we improved the prediction accuracy of liver enzymes of fish fed by nano-selenite by developing a neural network model based on SCA, that can train and update the weights and the biases of the network until reaching the optimum value. The performance of the proposed model is better and achieved more efficient than other models.

Hybrid Swarms Optimization Based Image Segmentation

This chapter proposed multilevel thresholding hybrid swarms optimization algorithm for image segmentation. The proposed algorithm is inspired by the behavior of fireflies and real spider. It uses Firefly Algorithm (FA) and Social Spider Optimization (SSO) algorithm (FASSO). The objective function used for achieving multilevel thresholding is the maximum between class variance criterion. The proposed algorithm uses the FA to optimize threshold, and then uses this thresholding value to partition the images through SSO algorithm of a powerful global search capability. Experimental results demonstrate the effectiveness of the FASSO algorithm of image segmentation and provide faster convergence with relatively lower CPU time.

Multi-objective Whale Optimization Algorithm for Multilevel Thresholding Segmentation

This chapter proposes a new method for determining the multilevel thresholding values for image segmentation. The proposed method considers the multilevel threshold as multi-objective function problem and used the whale optimization algorithm (WOA) to solve this problem. The fitness functions which used are the maximum between class variance criterion (Otsu) and the Kapur’s Entropy. The proposed method uses the whale algorithm to optimize threshold, and then uses this thresholding value to split the image. The experimental results showed the better performance of the proposed method to solving the multilevel thresholding problem for image segmentation and provided faster convergence with a relatively lower processing time.

Improved grasshopper optimization algorithm using opposition-based learning

Abstract This paper proposes an improved version of the grasshopper optimization algorithm (GOA) based on the opposition-based learning (OBL) strategy called OBLGOA for solving benchmark optimization functions and engineering problems. The proposed OBLGOA algorithm consists of two stages: the first stage generates an initial population and its opposite using the OBL strategy; and the second stage uses the OBL as an additional phase to update the GOA population in each iteration. However, the OBL is applied to only half of the solutions to reduce the time complexity. To investigate the performance of the proposed OBLGOA, six sets of experiment series are performed, and they include twenty-three benchmark functions and four engineering problems. The experiments revealed that the results of the proposed algorithm were superior to those of ten well-known algorithms in this domain. Eventually, the obtained results proved that the OBLGOA algorithm can provide competitive results for optimization engineering problems compared with state-of-the-art algorithms.