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

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.

2020 ◽  
Vol 2020 ◽  
pp. 1-9
Author(s):  
Kun-Chou Lee ◽  
Pai-Ting Lu

In this paper, the whale optimization algorithm (WOA) is applied to the inverse scattering of an imperfect conductor with corners. The WOA is a new metaheuristic optimization algorithm. It mimics the hunting behavior of humpback whales. The inspiration results from the fact that a whale recognizes the location of a prey (i.e., optimal solution) by swimming around the prey within a shrinking circle and along a spiral-shaped path simultaneously. Initially, the inverse scattering is first transformed into a nonlinear optimization problem. The transformation is based on the moment method solution for scattering integral equations. To treat a target with corners and implement the WOA inverse scattering, the cubic spline interpolation is utilized for modelling the target shape function. Numerical simulation shows that the inverse scattering by WOA not only is accurate but also converges fast.


Author(s):  
Nadim Rana ◽  
Muhammad Shafie Abd Latiff ◽  
Shafi'i Muhammad Abdulhamid

Virtual machine scheduling in the cloud is considered one of the major issue to solve optimal resource allocation problem on the heterogeneous datacenters. With respect to that, the key concern is to map the virtual machines (VMs) with physical machines (PMs) in a way that maximum resource utilization can be achieved with minimum cost. Due to the fact that scheduling is an NP-hard problem, a metaheuristic approach is proven to achieve a better optimal solution to solve this problem. In a rapid changing heterogeneous environment, where millions of resources can be allocated and deallocate in a fraction of the time, modern metaheuristic algorithms perform well due to its immense power to solve the multidimensional problem with fast convergence speed. This paper presents a conceptual framework for solving multi-objective VM scheduling problem using novel metaheuristic Whale optimization algorithm (WOA). Further, we present the problem formulation for the framework to achieve multi-objective functions.


2022 ◽  
Vol 13 (1) ◽  
pp. 0-0

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.


Author(s):  
Hekmat Mohmmadzadeh

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.


2021 ◽  
Vol 50 (2) ◽  
pp. 390-405
Author(s):  
Yongwen Du ◽  
Xiquan Zhang ◽  
Wenxian Zhang ◽  
Zhangmin Wang

Power allocation plays a pivotal role in improving the communication performance of interference-limitedwireless network (IWN). However, the optimization of power allocation is usually formulated as a mixed-integernon-linear programming (MINLP) problem, which is hard to solve. Whale optimization algorithm (WOA)has recently gained the attention of the researcher as an efficient method to solve a variety of optimizationproblems. WOA algorithm also has the disadvantages of low convergence accuracy and easy to fall into local optimum.To solve the above problems, we propose Cosine Compound Whale Optimization Algorithm (CCWOA).First of all, its unique cosine nonlinear convergence factor can balance the rate of the whole optimization processand prevent the convergence speed from being too fast. Secondly, the inertia weight and sine vector canincrease the probability of jumping out of the local optimal solution. Finally, the Archimedean spiral can reducethe risk of losing the optimal solution. A representative benchmark function is selected to test the convergencerate of CCWOA algorithm and the optimization performance of jumping out of local optimum. Compared withthe representative algorithms PFP and GAP, the optimization effect of CCWOA is almost consistent with theabove two algorithms, and even exceeds 4% - 6% in numerical value. The advantage of CCWOA is that it haslower algorithm complexity, which has a good advantage when the network computing resources are fixed. Inaddition, the optimization effect of CCWOA is higher than that of WOA, which lays a good foundation for furtherapplication of swarm intelligence optimization algorithm in network resource allocation.


Author(s):  
I. Sudha ◽  
R. Nedunchelian

Cloud computing has become a powerful mechanism for initiating secure communication among users. The advancements in the technology lead to provide various services, like accessing network, resources, and platform. However, handling large datasets and security are major issues in the cloud systems. Hence, this paper proposes a technique, namely, Jaya–Whale Optimization (JWO), which is the integration of Jaya algorithm and Whale optimization algorithm (WOA) and adapts homomorphic encryption for initiating secure data transmission in the cloud. The original data are preserved by generating Data Protection (DP) coefficient using the proposed JWO algorithm. In the proposed algorithm, the fitness is calculated based on privacy and utility parameters for selecting the optimal solution. Also, the sanitized data are generated by EXORing the Key Information Product (KIP) matrix and key vector. Finally, the data owner provides the key to the users for retrieving the original data from the sanitized data. The experimentation is carried out using Cleveland, Hungarian, and Switzerland datasets in terms of BD, accuracy, and fitness and the analysis shows that the proposed JWO provides superior performance in terms of BD, accuracy, and fitness parameters with values 0.720, 0.822, and 0.722.


2021 ◽  
Vol 13 (12) ◽  
pp. 6663
Author(s):  
Muhammad Salman Shabbir ◽  
Ahmed Faisal Siddiqi ◽  
Lis M. Yapanto ◽  
Evgeny E. Tonkov ◽  
Andrey Leonidovich Poltarykhin ◽  
...  

In today’s competitive environment, organizations, in addition to trying to improve their production conditions, have a special focus on their supply chain components. Cooperation between supply chain members always reduces unforeseen costs and speeds up the response to customer demand. In the new situation, according to the category of return products and their reprocessing, supply chains have found a closed-loop structure. In this research, the aim was to design a closed-loop supply chain in competitive conditions. For this purpose, the key decisions of this chain included locating retail centers, adjusting the inventory of chain members, and selling prices of final products, optimally determined. For this purpose, a nonlinear integer mathematical model is presented. One of the most important innovations of this research was considering the variable value for return products. Then, in order to solve the proposed model, a whale optimization algorithm was developed. Numerical results from the sample examples showed that the whale algorithm had a very good performance in terms of response quality and speed-of-action in finding the optimal solution to this problem.


2022 ◽  
Vol 13 (1) ◽  
pp. 0-0

In this article whale optimization algorithm (WOA) has been applied to solve the combined heat and power economic dispatch (CHPED) problem. The CHPED is energy system which provides both heat and power. Due to presence of valve point loading and the prohibited working region, the CHPED problems become more complex one. The main objective of CHPED problem is to minimize the total cost of fuel as well as heat with fulfill the load demand. This optimization technique shows several advantages like having few input variables, best quality of solution with rapid computational time. The recommended approach is carried out on three test systems. The simulation results of the present work certify the activeness of the proposed technique.


Author(s):  
Hekmat Mohmmadzadeh

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