scholarly journals An Improved Cuckoo Search Algorithm for Multithreshold Image Segmentation

2021 ◽  
Vol 2021 ◽  
pp. 1-10
Author(s):  
Wentan Jiao ◽  
Wenqing Chen ◽  
Jing Zhang

Image segmentation is an important part of image processing. For the disadvantages of image segmentation under multiple thresholds such as long time and poor quality, an improved cuckoo search (ICS) is proposed for multithreshold image segmentation strategy. Firstly, the image segmentation model based on the maximum entropy threshold is described, and secondly, the cuckoo algorithm is improved by using chaotic initialization population to improve the diversity of solutions, optimizing the step size factor to improve the possibility of obtaining the optimal solution, and using probability to reduce the complexity of the algorithm; finally, the maximum entropy threshold function in image segmentation is used as the individual fitness function of the cuckoo search algorithm for solving. The simulation experiments show that the algorithm has a good segmentation effect under four different thresholding conditions.

2020 ◽  
pp. 107754632095138
Author(s):  
Rosmazi Rosli ◽  
Zamri Mohamed

This article presents a new modified cuckoo search algorithm with dynamic discovery probability and step-size factor for optimizing the Bouc–Wen Model in magnetorheological damper application. The newly proposed algorithm was tested using a set of standard benchmark functions with different searching space and global optima placement. An engineering optimization application was chosen to evaluate the performance of the algorithm in complex engineering applications. The optimization task involved hysteresis parameter identification of the root mean square error between the model and an actual magnetorheological damper. The magnetorheological damper response was chosen as the objective function. The final value of the fitness function and the iteration number it took to converge were used as the qualifying indicator to the proposed cuckoo search algorithm efficiency. A comparison was done against particle swarm optimization, genetic algorithm, and sine–cosine algorithm, where the modified cuckoo search algorithm showed the lowest root mean square error and fastest convergence rate among the three algorithms.


2021 ◽  
Vol 11 (20) ◽  
pp. 9741
Author(s):  
Yunsheng Fan ◽  
Xiaojie Sun ◽  
Guofeng Wang ◽  
Dongdong Mu

For the dynamic collision avoidance problem of an unmanned surface vehicle (USV), a dynamic collision avoidance control method based on an improved cuckoo search algorithm is proposed. The collision avoidance model for a USV and obstacles is established on the basis of the principle of the velocity obstacle method. Simultaneously, the Convention on the International Regulations for Preventing Collisions at Sea (COLREGS) is incorporated in the collision avoidance process. For the improvement of the cuckoo algorithm, the adaptive variable step-size factor is designed to realize the adaptive adjustment of flight step-size, and a mutation and crossover strategy is introduced to enhance the population diversity and improve the global optimization ability. The improved cuckoo search algorithm is applied to the collision avoidance model to obtain an optimal collision avoidance strategy. According to the collision avoidance strategy, the desired evasion trajectory is obtained, and the tracking controller based on PID is used for the Lanxin USV. The experimental results show the feasibility and effectiveness of the proposed collision avoidance method, which provides a solution for the autonomous dynamic collision avoidance of USVs.


Author(s):  
Thang Trung Nguyen ◽  
Dieu Ngoc Vo

This chapter proposes a Cuckoo Search Algorithm (CSA) and a Modified Cuckoo Search Algorithm (MCSA) for solving short-term hydrothermal scheduling (ST-HTS) problem. The CSA method is a new meta-heuristic algorithm inspired from the obligate brood parasitism of some cuckoo species by laying their eggs in the nests of other host birds of other species for solving optimization problems. In the MCSA method, the eggs are first classified into two groups in which ones with low fitness function are put in top group whereas others with higher fitness function are put in abandoned group. In addition, an updated step size in the MCSA changes and tends to decrease as the iteration increases leading to near global optimal solution. The robustness and effectiveness of the CSA and MCSA are tested on several systems with different objective functions of thermal units. The results obtained by the CSA and MCSA are analyzed and compared have shown that the two methods are favorable for solving short-term hydrothermal scheduling problems.


Energies ◽  
2018 ◽  
Vol 11 (10) ◽  
pp. 2675 ◽  
Author(s):  
Yang Zhang ◽  
Huihui Zhao ◽  
Yuming Cao ◽  
Qinhuo Liu ◽  
Zhanfeng Shen ◽  
...  

The development of remote sensing and intelligent algorithms create an opportunity to include ad hoc technology in the heating route design area. In this paper, classification maps and heating route planning regulations are introduced to create the fitness function. Modifications of ant colony optimization and the cuckoo search algorithm, as well as a hybridization of the two algorithms, are proposed to solve the specific Zhuozhou–Fangshan heating route design. Compared to the fitness function value of the manual route (234.300), the best route selected by modified ant colony optimization (ACO) was 232.343, and the elapsed time for one solution was approximately 1.93 ms. Meanwhile, the best route selected by modified Cuckoo Search (CS) was 244.247, and the elapsed time for one solution was approximately 0.794 ms. The modified ant colony optimization algorithm can find the route with smaller fitness function value, while the modified cuckoo search algorithm can find the route overlapped to the manual selected route better. The modified cuckoo search algorithm runs more quickly but easily sticks into the premature convergence. Additionally, the best route selected by the hybrid ant colony and cuckoo search algorithm is the same as the modified ant colony optimization algorithm (232.343), but with higher efficiency and better stability.


2019 ◽  
Vol 8 (2S11) ◽  
pp. 2953-2964

Software testing consumes the major portion of the total efforts required for software development. This activity is very time consuming and labor intensive. It is very hard to do testing in optimal manner. In this paper a new approach is proposed, which uses the nature inspired stochastic algorithm called Cuckoo Search Algorithm (CSA) for the automatic generation of test data for data flow testing. This approach considers all def-use as test adequacy criteria. For assistance to CSA in the state space a new fitness function is also proposed by using the concept of dominator tree and branch distance in a CFG. To validate the proposed approach experiments are carried out on 10 benchmarked programs and findings are contrasted with earlier work done in this domain. Further in order to prove that proposed approach performs better than the above mentioned approaches a statistical difference test (T-test) is also performed.


Sign in / Sign up

Export Citation Format

Share Document