scholarly journals Near Infrared and Visible Image Registration using Whale Optimization Algorithm

2022 ◽  
Vol 13 (1) ◽  
pp. 0-0
Keyword(s):  
Image Registration ◽  
Optimization Algorithm ◽  
Near Infrared ◽  
Optimization Problems ◽  
Search Space ◽  
Whale Optimization Algorithm ◽  
Visible Image ◽  
Local Optima ◽  
Multimodal Image Registration ◽  
Whale Optimization

This paper reports the use of a nature-inspired metaheuristic algorithm known as ‘Whale Optimization Algorithm’ (WOA) for multimodal image registration. WOA is based on the hunting behaviour of Humpback whales and provides better exploration and exploitation of the search space with small possibility of trapping in local optima. Though WOA is used in various optimization problems, no detailed study is available for its use in image registration. For this study different sets of NIR and visible images are considered. The registration results are compared with the other state of the art image registration methods. The results show that WOA is a very competitive algorithm for NIR-visible image registration. With the advantages of better exploration of search space and local optima avoidance, the algorithm can be a suitable choice for multimodal image registration.

scholarly journals Improved grey wolf algorithm for optimization problems

2021 ◽  
Vol 22 (3) ◽  
pp. 1573
Author(s):  
Hafiz Maaz Asgher ◽  
Yana Mazwin Mohmad Hassim ◽  
Rozaida Ghazali ◽  
Muhammad Aamir
Keyword(s):  
Optimization Algorithm ◽  
Optimization Problem ◽  
Optimization Problems ◽  
Research Work ◽  
Search Space ◽  
Whale Optimization Algorithm ◽  
Grey Wolf ◽  
Exploration And Exploitation ◽  
Grey Wolf Optimization ◽  
Whale Optimization

The grey wolf optimization (GWO) is a nature inspired and meta-heuristic algorithm, it has successfully solved many optimization problems and give better solution as compare to other algorithms. However, due to its poor exploration capability, it has imbalance relation between exploration and exploitation. Therefore, in this research work, the poor exploration part of GWO was improved through hybrid with whale optimization algorithm (WOA) exploration. The proposed grey wolf whale optimization algorithm (GWWOA) was evaluated on five unimodal and five multimodal benchmark functions. The results shows that GWWOA offered better exploration ability and able to solve the optimization problem and give better solution in search space. Additionally, GWWOA results were well balanced and gave the most optimal in search space as compare to the standard GWO and WOA algorithms.

scholarly journals Multilevel Thresholding based Image Segmentation using Whale Optimization Algorithm

2019 ◽  
Vol 8 (12) ◽  
pp. 4602-4613 ◽  
Keyword(s):  
Image Segmentation ◽  
Optimization Algorithm ◽  
Optimization Problems ◽  
Threshold Value ◽  
Deterministic Algorithm ◽  
Whale Optimization Algorithm ◽  
Multilevel Thresholding ◽  
Threshold Values ◽  
Local Optima ◽  
Whale Optimization

Whale Optimization Algorithm (WOA) was proposed by Seyedali Mirjalili and Andrew Lewis in 2016. WOA is nature-inspired, meta-heuristic (randomization and deterministic) algorithm, which is being used to solve various single objective, multi objective and multi-dimensional optimization problems. To determine threshold value for image segmentation Otsu, kapur, thresholding etc. methods are used. In this paper multilevel threshold values are computed using WOA and these multilevel threshold values are used for image segmentation. Fitness is computed using Otsu thresholding. Minimum fitness score is considered as best optimal value. WOA has capability to explore, exploit the search s pace and avoid local optima. In multilevel thresholding, complex images are segmented into L+1 levels for multiple threshold values L =2, 3 etc. This paper addresses about performance of Whale Optimization Algorithm (WOA) and Particle Swarm Optimization (PSO) for various benchmark objective functions such as unimodel, multimodel, fix dimension multimodel based on their convergence curves for different number of iterations400,500 600 and compute multilevel threshold values for various level image segmentation using Whale Optimization Algorithm.

scholarly journals IWOA: An improved whale optimization algorithm for optimization problems

2019 ◽  
Vol 6 (3) ◽  
pp. 243-259 ◽  
Author(s):  
Seyed Mostafa Bozorgi ◽  
Samaneh Yazdani
Keyword(s):  
Optimization Algorithm ◽  
Optimization Problems ◽  
Adaptive Strategy ◽  
Function Optimization ◽  
Whale Optimization Algorithm ◽  
Exploration And Exploitation ◽  
Hunting Behavior ◽  
Local Optima ◽  
Adaptive Parameter ◽  
Whale Optimization

Abstract The whale optimization algorithm (WOA) is a new bio-inspired meta-heuristic algorithm which is presented based on the social hunting behavior of humpback whales. WOA suffers premature convergence that causes it to trap in local optima. In order to overcome this limitation of WOA, in this paper WOA is hybridized with differential evolution (DE) which has good exploration ability for function optimization problems. The proposed method is named Improved WOA (IWOA). The proposed method, combines exploitation of WOA with exploration of DE and therefore provides a promising candidate solution. In addition, IWOA+ is presented in this paper which is an extended form of IWOA. IWOA+ utilizes re-initialization and adaptive parameter which controls the whole search process to obtain better solutions. IWOA and IWOA+ are validated on a set of 25 benchmark functions, and they are compared with PSO, DE, BBO, DE/BBO, PSO/GSA, SCA, MFO and WOA. Furthermore, the effects of dimensionality and population size on the performance of our proposed algorithms are studied. The results demonstrate that IWOA and IWOA+ outperform the other algorithms in terms of quality of the final solution and convergence rate. Highlights The exploration ability of WOA is improved via hybridizing it with DE's mutation. A new adaptive strategy is utilized for balancing the exploration and exploitation abilities. Re-initialization is used to increase the diversity of population. Two improvements are presented for WOA through balancing its exploration and exploitation. The results show that the proposed algorithms can improve the performance of WOA significantly.

scholarly journals Solving knapsack problems using a binary gaining sharing knowledge-based optimization algorithm

2021 ◽  
Author(s):  
Prachi Agrawal ◽  
Talari Ganesh ◽  
Ali Wagdy Mohamed
Keyword(s):  
Life Span ◽  
Population Size ◽  
Linear Function ◽  
Optimization Algorithm ◽  
Optimization Problems ◽  
Search Space ◽  
Knapsack Problems ◽  
Local Optima ◽  
Knowledge Based ◽  
Two Stages

AbstractThis article proposes a novel binary version of recently developed Gaining Sharing knowledge-based optimization algorithm (GSK) to solve binary optimization problems. GSK algorithm is based on the concept of how humans acquire and share knowledge during their life span. A binary version of GSK named novel binary Gaining Sharing knowledge-based optimization algorithm (NBGSK) depends on mainly two binary stages: binary junior gaining sharing stage and binary senior gaining sharing stage with knowledge factor 1. These two stages enable NBGSK for exploring and exploitation of the search space efficiently and effectively to solve problems in binary space. Moreover, to enhance the performance of NBGSK and prevent the solutions from trapping into local optima, NBGSK with population size reduction (PR-NBGSK) is introduced. It decreases the population size gradually with a linear function. The proposed NBGSK and PR-NBGSK applied to set of knapsack instances with small and large dimensions, which shows that NBGSK and PR-NBGSK are more efficient and effective in terms of convergence, robustness, and accuracy.

Whale optimization algorithm based on lateral inhibition for image matching and vision-guided AUV docking

2020 ◽  
pp. 1-12
Author(s):  
Zheping Yan ◽  
Jinzhong Zhang ◽  
Jialing Tang
Keyword(s):  
Lateral Inhibition ◽  
Optimization Algorithm ◽  
Image Matching ◽  
Autonomous Underwater Vehicle ◽  
Optimal Solution ◽  
Search Space ◽  
Whale Optimization Algorithm ◽  
Inhibition Mechanism ◽  
Whale Optimization ◽  
Accuracy And Stability

The accuracy and stability of relative pose estimation of an autonomous underwater vehicle (AUV) and a target depend on whether the characteristics of the underwater image can be accurately and quickly extracted. In this paper, a whale optimization algorithm (WOA) based on lateral inhibition (LI) is proposed to solve the image matching and vision-guided AUV docking problem. The proposed method is named the LI-WOA. The WOA is motivated by the behavior of humpback whales, and it mainly imitates encircling prey, bubble-net attacking and searching for prey to obtain the globally optimal solution in the search space. The WOA not only balances exploration and exploitation but also has a faster convergence speed, higher calculation accuracy and stronger robustness than other approaches. The lateral inhibition mechanism can effectively perform image enhancement and image edge extraction to improve the accuracy and stability of image matching. The LI-WOA combines the optimization efficiency of the WOA and the matching accuracy of the LI mechanism to improve convergence accuracy and the correct matching rate. To verify its effectiveness and feasibility, the WOA is compared with other algorithms by maximizing the similarity between the original image and the template image. The experimental results show that the LI-WOA has a better average value, a higher correct rate, less execution time and stronger robustness than other algorithms. The LI-WOA is an effective and stable method for solving the image matching and vision-guided AUV docking problem.

scholarly journals An Improved Whale Optimization Algorithm for the Traveling Salesman Problem

Symmetry ◽  
2020 ◽  
Vol 13 (1) ◽  
pp. 48
Author(s):  
Jin Zhang ◽  
Li Hong ◽  
Qing Liu
Keyword(s):  
Traveling Salesman Problem ◽  
Optimization Algorithm ◽  
Optimization Problems ◽  
Relevant Literature ◽  
Population Diversity ◽  
Traveling Salesman ◽  
Whale Optimization Algorithm ◽  
Neighborhood Search ◽  
Whale Optimization ◽  
The Traveling Salesman Problem

The whale optimization algorithm is a new type of swarm intelligence bionic optimization algorithm, which has achieved good optimization results in solving continuous optimization problems. However, it has less application in discrete optimization problems. A variable neighborhood discrete whale optimization algorithm for the traveling salesman problem (TSP) is studied in this paper. The discrete code is designed first, and then the adaptive weight, Gaussian disturbance, and variable neighborhood search strategy are introduced, so that the population diversity and the global search ability of the algorithm are improved. The proposed algorithm is tested by 12 classic problems of the Traveling Salesman Problem Library (TSPLIB). Experiment results show that the proposed algorithm has better optimization performance and higher efficiency compared with other popular algorithms and relevant literature.

scholarly journals A Hybrid Whale Optimization Algorithm for Global Optimization

Mathematics ◽  
2021 ◽  
Vol 9 (13) ◽  
pp. 1477
Author(s):  
Chun-Yao Lee ◽  
Guang-Lin Zhuo
Keyword(s):  
Global Optimization ◽  
Optimization Algorithm ◽  
Optimization Problems ◽  
Whale Optimization Algorithm ◽  
Initial Population ◽  
Test Functions ◽  
Benchmark Test ◽  
Thermal Exchange ◽  
Whale Optimization ◽  
Benchmark Test Functions

This paper proposes a hybrid whale optimization algorithm (WOA) that is derived from the genetic and thermal exchange optimization-based whale optimization algorithm (GWOA-TEO) to enhance global optimization capability. First, the high-quality initial population is generated to improve the performance of GWOA-TEO. Then, thermal exchange optimization (TEO) is applied to improve exploitation performance. Next, a memory is considered that can store historical best-so-far solutions, achieving higher performance without adding additional computational costs. Finally, a crossover operator based on the memory and a position update mechanism of the leading solution based on the memory are proposed to improve the exploration performance. The GWOA-TEO algorithm is then compared with five state-of-the-art optimization algorithms on CEC 2017 benchmark test functions and 8 UCI repository datasets. The statistical results of the CEC 2017 benchmark test functions show that the GWOA-TEO algorithm has good accuracy for global optimization. The classification results of 8 UCI repository datasets also show that the GWOA-TEO algorithm has competitive results with regard to comparison algorithms in recognition rate. Thus, the proposed algorithm is proven to execute excellent performance in solving optimization problems.

Improved whale optimization algorithm based on variable spiral position update strategy and adaptive inertia weight

2021 ◽  
pp. 1-17
Author(s):  
Maodong Li ◽  
Guanghui Xu ◽  
Yuanwang Fu ◽  
Tingwei Zhang ◽  
Li Du
Keyword(s):  
Optimization Algorithm ◽  
Optimization Problems ◽  
Convergence Speed ◽  
Whale Optimization Algorithm ◽  
Original Algorithm ◽  
Inertia Weight ◽  
Whale Optimization ◽  
Multimodal Function ◽  
Update Strategy ◽  
Improved Algorithm

 In this paper, a whale optimization algorithm based on adaptive inertia weight and variable spiral position updating strategy is proposed. The improved algorithm is used to solve the problem that the whale optimization algorithm is more dependent on the randomness of the parameters, so that the algorithm’s convergence accuracy and convergence speed are insufficient. The adaptive inertia weight, which varies with the fitness of individual whales, is used to balance the algorithm’s global search ability and local exploitation ability. The variable spiral position update strategy based on the collaborative convergence mechanism is used to dynamically adjust the search range and search accuracy of the algorithm. The effective combination of the two can make the improved whale optimization algorithm converge to the optimal solution faster. It had been used 18 international standard test functions, including unimodal function, multimodal function, and fixed-dimensional function to test the improved whale optimization algorithm in this paper. The test results show that the improved algorithm has faster convergence speed and higher algorithm accuracy than the original algorithm and several classic algorithms. The algorithm can quickly converge to near the optimal value in the early stage, and then effectively jump out of the local optimal through adaptive adjustment, and has a certain ability to solve large-scale optimization problems.

scholarly journals A Combination Approach of Two Metaheuristic Algorithm for Optimal Feature Selection: Case Study Email Spam Detection

2020 ◽  
Author(s):  
Hekmat Mohmmadzadeh
Keyword(s):  
Feature Selection ◽  
Optimization Algorithm ◽  
Search Space ◽  
Whale Optimization Algorithm ◽  
Selection Problem ◽  
Second Step ◽  
Feature Selection Problem ◽  
Flower Pollination ◽  
Opposition Based Learning ◽  
Whale Optimization

Selecting a feature in data mining is one of the most challenging and important activities in pattern recognition. The issue of feature selection is to find the most important subset of the main features in a specific domain, the main purpose of which is to remove additional or unrelated features and ultimately improve the accuracy of the categorization algorithms. As a result, the issue of feature selection can be considered as an optimization problem and to solve it, meta-innovative algorithms can be used. In this paper, a new hybrid model with a combination of whale optimization algorithms and flower pollination algorithms is presented to address the problem of feature selection based on the concept of opposition-based learning. In the proposed method, we tried to solve the problem of optimization of feature selection by using natural processes of whale optimization and flower pollination algorithms, and on the other hand, we used opposition-based learning method to ensure the convergence speed and accuracy of the proposed algorithm. In fact, in the proposed method, the whale optimization algorithm uses the bait siege process, bubble attack method and bait search, creates solutions in its search space and tries to improve the solutions to the feature selection problem, and along with this algorithm, Flower pollination algorithm with two national and local search processes improves the solution of the problem selection feature in contrasting solutions with the whale optimization algorithm. In fact, we used both search space solutions and contrasting search space solutions, all possible solutions to the feature selection problem. To evaluate the performance of the proposed algorithm, experiments are performed in two stages. In the first phase, experiments were performed on 10 sets of data selection features from the UCI data repository. In the second step, we tried to test the performance of the proposed algorithm by detecting spam emails. The results obtained from the first step show that the proposed algorithm, by running on 10 UCI data sets, has been able to be more successful in terms of average selection size and classification accuracy than other basic meta-heuristic algorithms. Also, the results obtained from the second step show that the proposed algorithm has been able to perform spam emails more accurately than other similar algorithms in terms of accuracy by detecting spam emails.

Sign in / Sign up

Export Citation Format

Share Document