1
|
Huang M, Zhao H, Chen Y. Research on SAR image quality evaluation method based on improved harris hawk optimization algorithm and XGBoost. Sci Rep 2024; 14:28364. [PMID: 39551817 PMCID: PMC11570619 DOI: 10.1038/s41598-024-79674-8] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Grants] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 07/05/2024] [Accepted: 11/11/2024] [Indexed: 11/19/2024] Open
Abstract
Synthetic aperture radar (SAR) is crucial for military reconnaissance and remote sensing, but image quality can be affected by various factors, impacting target detection performance. Thus, pre-evaluation of SAR image quality is essential to filter out poor-quality images, optimize resource allocation, and enhance detection accuracy and efficiency. This paper proposes a comprehensive SAR image quality evaluation method combining objective and subjective approaches. Specifically, the processes encompassing the generation of a series of disturbed SAR images on the SAR ship detection dataset (SSDD), the calculation of various objective quality indicators for those images, and the assignment of a subjective quality label to each image through subjective evaluation. Based on the dataset constructed by the above evaluation methods, the IHHO-XGBoost model was developed. This model uses an improved harris hawk optimization (IHHO) algorithm to optimize extreme gradient boosting (XGBoost) hyperparameters. The IHHO algorithm effectively alleviates the problem of getting trapped in local optima by improving the escape energy calculation strategy and integrating the average difference evolution mechanism while maintaining the diversity of the population, showing significant advantages over the traditional HHO algorithm. Comparative experiments demonstrate the model's superiority in SAR image quality evaluation. This study validates the scientificity and practicability of the proposed method, offering new tools for SAR image quality research.
Collapse
Affiliation(s)
- Min Huang
- Army Engineering University, Shijiazhuang Campus, Shijiazhuang, 050003, China
- College of Information Science and Engineering, Hebei University of Science and Technology, Shijiazhuang, 050018, China
| | - Hang Zhao
- College of Information Science and Engineering, Hebei University of Science and Technology, Shijiazhuang, 050018, China
| | - Yazhou Chen
- Army Engineering University, Shijiazhuang Campus, Shijiazhuang, 050003, China.
| |
Collapse
|
2
|
Qiu S, Dai J, Zhao D. Path Planning of an Unmanned Aerial Vehicle Based on a Multi-Strategy Improved Pelican Optimization Algorithm. Biomimetics (Basel) 2024; 9:647. [PMID: 39451853 PMCID: PMC11505695 DOI: 10.3390/biomimetics9100647] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 08/04/2024] [Revised: 09/21/2024] [Accepted: 10/19/2024] [Indexed: 10/26/2024] Open
Abstract
The UAV path planning algorithm has many applications in urban environments, where an effective algorithm can enhance the efficiency of UAV tasks. The main concept of UAV path planning is to find the optimal flight path while avoiding collisions. This paper transforms the path planning problem into a multi-constraint optimization problem by considering three costs: path length, turning angle, and collision avoidance. A multi-strategy improved POA algorithm (IPOA) is proposed to address this. Specifically, by incorporating the iterative chaotic mapping method with refracted reverse learning strategy, nonlinear inertia weight factors, the Levy flight mechanism, and adaptive t-distribution variation, the convergence accuracy and speed of the POA algorithm are enhanced. In the CEC2022 test functions, IPOA outperformed other algorithms in 69.4% of cases. In the real map simulation experiment, compared to POA, the path length, turning angle, distance to obstacles, and flight time improved by 8.44%, 5.82%, 4.07%, and 9.36%, respectively. Similarly, compared to MPOA, the improvements were 4.09%, 0.76%, 1.85%, and 4.21%, respectively.
Collapse
Affiliation(s)
- Shaoming Qiu
- Key Laboratory of Network and Communications, Dalian University, Dalian 116622, China;
| | - Jikun Dai
- Key Laboratory of Network and Communications, Dalian University, Dalian 116622, China;
| | - Dongsheng Zhao
- School of Economics and Management, Ningxia University, Yinchuan 750021, China;
| |
Collapse
|
3
|
Charu KM, Thakur P, Rawat N, Ansari F, Gupta S, Kumar M. An efficient data sheet based parameter estimation technique of solar PV. Sci Rep 2024; 14:6461. [PMID: 38499750 PMCID: PMC10948897 DOI: 10.1038/s41598-024-57241-5] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 12/27/2023] [Accepted: 03/15/2024] [Indexed: 03/20/2024] Open
Abstract
This work develops an efficient parameter estimation technique, based on manufacturer datasheet, to obtain unknown parameter of solar photovoltaic (PV), precisely. Firstly, a nonlinear least square objective function, in terms of variables given in manufacturer datasheet, has been developed. Then, two optimization techniques, namely the Particle Swarn Optimization (PSO) and Harmony Search (HS) are applied on the developed objective function to achieve the optimized result. Further, the correctness of the developed technique is tested by estimating the performance indices, namely percentage maximum power deviation index (%MPDI) and overall model deviation index (OMDI), of two different solar PV, viz., Kyocera KD210GH-2PU (poly-crystalline), and Shell SQ85 (mono-crystalline). It is shown that developed method with PSO outperforms the HS. The developed method with PSO gives the values of %MPDI and OMDI of 0.0214% and 0.213, only. Also, the existing methods, based on hybrid, multi-objective function, numerical method, have been considered for the comparative analysis. It is revealed through the comparative studies that the developed method with PSO has smaller value of MPDI (= 0.0041%) and OMDI (0.005) than the other existing methods. Further, the convergence of the developed method has also been estimated to check the speed of estimation. It is shown that the developed technique converges only in 5 s. In addition, the developed technique avoids the need of extensive data as it is based on manufacturer datasheet.
Collapse
Affiliation(s)
- K M Charu
- Department of Electrical Engineering, Graphic Era (Deemed to be University), Dehradun, 248002, Uttarakhand, India
- Dev Bhoomi Uttarakhand University, Dehradun, India
| | - Padmanabh Thakur
- Department of Electrical Engineering, Graphic Era (Deemed to be University), Dehradun, 248002, Uttarakhand, India
| | - Nikita Rawat
- Department of Electrical Engineering, Graphic Era (Deemed to be University), Dehradun, 248002, Uttarakhand, India
| | - Fahim Ansari
- Department of Electrical Engineering, Graphic Era (Deemed to be University), Dehradun, 248002, Uttarakhand, India
| | - Sandeep Gupta
- Department of Electrical Engineering, Graphic Era (Deemed to be University), Dehradun, 248002, Uttarakhand, India
| | - Mukesh Kumar
- Department of Mechanical Engineering, Assosa University, Assosa, Ethiopia.
| |
Collapse
|
4
|
Li X, Lin Z, Lv H, Yu L, Heidari AA, Zhang Y, Chen H, Liang G. Advanced slime mould algorithm incorporating differential evolution and Powell mechanism for engineering design. iScience 2023; 26:107736. [PMID: 37810256 PMCID: PMC10558746 DOI: 10.1016/j.isci.2023.107736] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [Grants] [Track Full Text] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 05/30/2023] [Revised: 07/21/2023] [Accepted: 08/23/2023] [Indexed: 10/10/2023] Open
Abstract
The slime mould algorithm (SMA) is a population-based swarm intelligence optimization algorithm that simulates the oscillatory foraging behavior of slime moulds. To overcome its drawbacks of slow convergence speed and premature convergence, this paper proposes an improved algorithm named PSMADE, which integrates the differential evolution algorithm (DE) and the Powell mechanism. PSMADE utilizes crossover and mutation operations of DE to enhance individual diversity and improve global search capability. Additionally, it incorporates the Powell mechanism with a taboo table to strengthen local search and facilitate convergence toward better solutions. The performance of PSMADE is evaluated by comparing it with 14 metaheuristic algorithms (MA) and 15 improved MAs on the CEC 2014 benchmarks, as well as solving four constrained real-world engineering problems. Experimental results demonstrate that PSMADE effectively compensates for the limitations of SMA and exhibits outstanding performance in solving various complex problems, showing potential as an effective problem-solving tool.
Collapse
Affiliation(s)
- Xinru Li
- Key Laboratory of Intelligent Informatics for Safety & Emergency of Zhejiang Province, Wenzhou University, Wenzhou 325035, China
| | - Zihan Lin
- Key Laboratory of Intelligent Informatics for Safety & Emergency of Zhejiang Province, Wenzhou University, Wenzhou 325035, China
| | - Haoxuan Lv
- Key Laboratory of Intelligent Informatics for Safety & Emergency of Zhejiang Province, Wenzhou University, Wenzhou 325035, China
| | - Liang Yu
- Key Laboratory of Intelligent Informatics for Safety & Emergency of Zhejiang Province, Wenzhou University, Wenzhou 325035, China
| | - Ali Asghar Heidari
- School of Surveying and Geospatial Engineering, College of Engineering, University of Tehran, Tehran, Iran
| | - Yudong Zhang
- School of Computing and Mathematical Sciences, University of Leicester, Leicester LE1 7RH, UK
| | - Huiling Chen
- Key Laboratory of Intelligent Informatics for Safety & Emergency of Zhejiang Province, Wenzhou University, Wenzhou 325035, China
| | - Guoxi Liang
- Department of Information Technology, Wenzhou Polytechnic, Wenzhou 325035, China
| |
Collapse
|
5
|
Zhang Q, Sheng J, Zhang Q, Wang L, Yang Z, Xin Y. Enhanced Harris hawks optimization-based fuzzy k-nearest neighbor algorithm for diagnosis of Alzheimer's disease. Comput Biol Med 2023; 165:107392. [PMID: 37669585 DOI: 10.1016/j.compbiomed.2023.107392] [Citation(s) in RCA: 9] [Impact Index Per Article: 4.5] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 05/23/2023] [Revised: 07/30/2023] [Accepted: 08/25/2023] [Indexed: 09/07/2023]
Abstract
In order to stop deterioration and give patients with Alzheimer's disease (AD) early therapy, it is crucial to correctly diagnose AD and its early stage, mild cognitive impairment (MCI). A framework for diagnosing AD is presented in this paper, which includes magnetic resonance imaging (MRI) image preprocessing, feature extraction, and the Fuzzy k-nearest neighbor algorithm (FKNN) model. In particular, the framework's novelty lies in the use of an improved Harris Hawks Optimization (HHO) algorithm named SSFSHHO, which integrates the Sobol sequence and Stochastic Fractal Search (SFS) mechanisms for optimizing the parameters of FKNN. The HHO method improves the quality of the initial population overall by incorporating the Sobol sequence, and the SFS mechanism increases the algorithm's capacity to get out of the local optimum solution. Comparisons with other classical meta-heuristic algorithms, state-of-the-art HHO variants in low and high dimensions, and enhanced meta-heuristic algorithms on 30 typical IEEE CEC2014 benchmark test problems show that the overall performance of SSFSHHO is significantly better than other comparative algorithms. Moreover, the created framework based on the SSFSHHO-FKNN model is employed to classify AD and MCI using MRI scans from the ADNI dataset, achieving high classification performance for 6 representative cases. Experimental findings indicate that the proposed algorithm performs better than a number of high-performance optimization algorithms and classical machine learning algorithms, thus offering a promising approach for AD classification. Additionally, the proposed strategy can successfully identify relevant features and enhance classification performance for AD diagnosis.
Collapse
Affiliation(s)
- Qian Zhang
- College of Computer Science and Technology, Hangzhou Dianzi University, Hangzhou, Zhejiang, 310018, China; Key Laboratory of Intelligent Image Analysis for Sensory and Cognitive Health, Ministry of Industry and Information Technology of China, Hangzhou, Zhejiang, 310018, China; School of Data Science and Artificial Intelligence, Wenzhou University of Technology, Wenzhou, Zhejiang, 325035, China
| | - Jinhua Sheng
- College of Computer Science and Technology, Hangzhou Dianzi University, Hangzhou, Zhejiang, 310018, China; Key Laboratory of Intelligent Image Analysis for Sensory and Cognitive Health, Ministry of Industry and Information Technology of China, Hangzhou, Zhejiang, 310018, China.
| | - Qiao Zhang
- Beijing Hospital, Beijing, 100730, China; National Center of Gerontology, Beijing, 100730, China; Institute of Geriatric Medicine, Chinese Academy of Medical Sciences, Beijing, 100730, China
| | - Luyun Wang
- College of Computer Science and Technology, Hangzhou Dianzi University, Hangzhou, Zhejiang, 310018, China; Key Laboratory of Intelligent Image Analysis for Sensory and Cognitive Health, Ministry of Industry and Information Technology of China, Hangzhou, Zhejiang, 310018, China
| | - Ze Yang
- College of Computer Science and Technology, Hangzhou Dianzi University, Hangzhou, Zhejiang, 310018, China; Key Laboratory of Intelligent Image Analysis for Sensory and Cognitive Health, Ministry of Industry and Information Technology of China, Hangzhou, Zhejiang, 310018, China
| | - Yu Xin
- College of Computer Science and Technology, Hangzhou Dianzi University, Hangzhou, Zhejiang, 310018, China; Key Laboratory of Intelligent Image Analysis for Sensory and Cognitive Health, Ministry of Industry and Information Technology of China, Hangzhou, Zhejiang, 310018, China
| |
Collapse
|
6
|
Huang L, Fu Q, Tong N. An Improved Harris Hawks Optimization Algorithm and Its Application in Grid Map Path Planning. Biomimetics (Basel) 2023; 8:428. [PMID: 37754179 PMCID: PMC10526498 DOI: 10.3390/biomimetics8050428] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [Grants] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 08/02/2023] [Revised: 09/07/2023] [Accepted: 09/11/2023] [Indexed: 09/28/2023] Open
Abstract
Aimed at the problems of the Harris Hawks Optimization (HHO) algorithm, including the non-origin symmetric interval update position out-of-bounds rate, low search efficiency, slow convergence speed, and low precision, an Improved Harris Hawks Optimization (IHHO) algorithm is proposed. In this algorithm, a circle map was added to replace the pseudo-random initial population, and the population boundary number was reduced to improve the efficiency of the location update. By introducing a random-oriented strategy, the information exchange between populations was increased and the out-of-bounds position update was reduced. At the same time, the improved sine-trend search strategy was introduced to improve the search performance and reduce the out-of-bound rate. Then, a nonlinear jump strength combining escape energy and jump strength was proposed to improve the convergence accuracy of the algorithm. Finally, the simulation experiment was carried out on the test function and the path planning application of a 2D grid map. The results show that the Improved Harris Hawks Optimization algorithm is more competitive in solving accuracy, convergence speed, and non-origin symmetric interval search efficiency, and verifies the feasibility and effectiveness of the Improved Harris Hawks Optimization in the path planning of a grid map.
Collapse
Affiliation(s)
- Lin Huang
- Faculty of Electrical Engineering and Computer Science, Ningbo University, Ningbo 315211, China;
- College of Science and Technology, Ningbo University, Ningbo 315300, China;
| | - Qiang Fu
- Faculty of Electrical Engineering and Computer Science, Ningbo University, Ningbo 315211, China;
- College of Science and Technology, Ningbo University, Ningbo 315300, China;
| | - Nan Tong
- College of Science and Technology, Ningbo University, Ningbo 315300, China;
| |
Collapse
|
7
|
Abualigah L, Diabat A, Svetinovic D, Elaziz MA. Boosted Harris Hawks gravitational force algorithm for global optimization and industrial engineering problems. JOURNAL OF INTELLIGENT MANUFACTURING 2023; 34:2693-2728. [DOI: 10.1007/s10845-022-01921-4] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Subscribe] [Scholar Register] [Received: 07/14/2021] [Accepted: 01/31/2022] [Indexed: 09/02/2023]
|
8
|
Houssein EH, Mohamed GM, Ibrahim IA, Wazery YM. An efficient multilevel image thresholding method based on improved heap-based optimizer. Sci Rep 2023; 13:9094. [PMID: 37277531 DOI: 10.1038/s41598-023-36066-8] [Citation(s) in RCA: 5] [Impact Index Per Article: 2.5] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 12/24/2022] [Accepted: 05/29/2023] [Indexed: 06/07/2023] Open
Abstract
Image segmentation is the process of separating pixels of an image into multiple classes, enabling the analysis of objects in the image. Multilevel thresholding (MTH) is a method used to perform this task, and the problem is to obtain an optimal threshold that properly segments each image. Methods such as the Kapur entropy or the Otsu method, which can be used as objective functions to determine the optimal threshold, are efficient in determining the best threshold for bi-level thresholding; however, they are not effective for MTH due to their high computational cost. This paper integrates an efficient method for MTH image segmentation called the heap-based optimizer (HBO) with opposition-based learning termed improved heap-based optimizer (IHBO) to solve the problem of high computational cost for MTH and overcome the weaknesses of the original HBO. The IHBO was proposed to improve the convergence rate and local search efficiency of search agents of the basic HBO, the IHBO is applied to solve the problem of MTH using the Otsu and Kapur methods as objective functions. The performance of the IHBO-based method was evaluated on the CEC'2020 test suite and compared against seven well-known metaheuristic algorithms including the basic HBO, salp swarm algorithm, moth flame optimization, gray wolf optimization, sine cosine algorithm, harmony search optimization, and electromagnetism optimization. The experimental results revealed that the proposed IHBO algorithm outperformed the counterparts in terms of the fitness values as well as other performance indicators, such as the structural similarity index (SSIM), feature similarity index (FSIM), peak signal-to-noise ratio. Therefore, the IHBO algorithm was found to be superior to other segmentation methods for MTH image segmentation.
Collapse
Affiliation(s)
- Essam H Houssein
- Faculty of Computers and Information, Minia University, Minia, Egypt.
| | - Gaber M Mohamed
- Faculty of Computers and Information, Minia University, Minia, Egypt
| | - Ibrahim A Ibrahim
- Faculty of Computers and Information, Minia University, Minia, Egypt
| | - Yaser M Wazery
- Faculty of Computers and Information, Minia University, Minia, Egypt
| |
Collapse
|
9
|
Zhang M, Wu Q, Chen H, Heidari AA, Cai Z, Li J, Md Abdelrahim E, Mansour RF. Whale optimization with random contraction and Rosenbrock method for COVID-19 disease prediction. Biomed Signal Process Control 2023; 83:104638. [PMID: 36741073 PMCID: PMC9889265 DOI: 10.1016/j.bspc.2023.104638] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 08/01/2022] [Revised: 12/01/2022] [Accepted: 01/25/2023] [Indexed: 02/04/2023]
Abstract
Coronavirus Disease 2019 (COVID-19), instigated by severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2), has hugely impacted global public health. To identify and intervene in critically ill patients early, this paper proposes an efficient, intelligent prediction model based on the machine learning approach, which combines the improved whale optimization algorithm (RRWOA) with the k-nearest neighbor (KNN) classifier. In order to improve the problem that WOA is prone to fall into local optimum, an improved version named RRWOA is proposed based on the random contraction strategy (RCS) and the Rosenbrock method. To verify the capability of the proposed algorithm, RRWOA is tested against nine classical metaheuristics, nine advanced metaheuristics, and seven well-known WOA variants based on 30 IEEE CEC2014 competition functions, respectively. The experimental results in mean, standard deviation, the Friedman test, and the Wilcoxon signed-rank test are considered, proving that RRWOA won first place on 18, 24, and 25 test functions, respectively. In addition, a binary version of the algorithm, called BRRWOA, is developed for feature selection problems. An efficient prediction model based on BRRWOA and KNN classifier is proposed and compared with seven existing binary metaheuristics based on 15 datasets of UCI repositories. The experimental results show that the proposed algorithm obtains the smallest fitness value in eleven datasets and can solve combinatorial optimization problems, indicating that it still performs well in discrete cases. More importantly, the model was compared with five other algorithms on the COVID-19 dataset. The experiment outcomes demonstrate that the model offers a scientific framework to support clinical diagnostic decision-making. Therefore, RRWOA is an effectively improved optimizer with efficient value.
Collapse
Affiliation(s)
- Meilin Zhang
- Institute of Big Data and Information Technology, Wenzhou University, Wenzhou 325000, China
| | - Qianxi Wu
- Institute of Big Data and Information Technology, Wenzhou University, Wenzhou 325000, China
| | - Huiling Chen
- Institute of Big Data and Information Technology, Wenzhou University, Wenzhou 325000, China
| | - Ali Asghar Heidari
- Institute of Big Data and Information Technology, Wenzhou University, Wenzhou 325000, China
| | - Zhennao Cai
- Institute of Big Data and Information Technology, Wenzhou University, Wenzhou 325000, China
| | - Jiaren Li
- Wenzhou People's Hospital, Wenzhou, Zhejiang 325099, China
| | - Elsaid Md Abdelrahim
- Faculty of Science, Northern Border University, Arar, Saudi Arabia.,Faculty of Science, Tanta University, Tanta, Egypt
| | - Romany F Mansour
- Department of Mathematics, Faculty of Science, New Valley University, El-Kharga 72511, Egypt
| |
Collapse
|
10
|
Houssein EH, Mohamed GM, Abdel Samee N, Alkanhel R, Ibrahim IA, Wazery YM. An Improved Search and Rescue Algorithm for Global Optimization and Blood Cell Image Segmentation. Diagnostics (Basel) 2023; 13:diagnostics13081422. [PMID: 37189523 DOI: 10.3390/diagnostics13081422] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [Grants] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 03/09/2023] [Revised: 04/08/2023] [Accepted: 04/12/2023] [Indexed: 05/17/2023] Open
Abstract
Image segmentation has been one of the most active research areas in the last decade. The traditional multi-level thresholding techniques are effective for bi-level thresholding because of their resilience, simplicity, accuracy, and low convergence time, but these traditional techniques are not effective in determining the optimal multi-level thresholding for image segmentation. Therefore, an efficient version of the search and rescue optimization algorithm (SAR) based on opposition-based learning (OBL) is proposed in this paper to segment blood-cell images and solve problems of multi-level thresholding. The SAR algorithm is one of the most popular meta-heuristic algorithms (MHs) that mimics humans' exploration behavior during search and rescue operations. The SAR algorithm, which utilizes the OBL technique to enhance the algorithm's ability to jump out of the local optimum and enhance its search efficiency, is termed mSAR. A set of experiments is applied to evaluate the performance of mSAR, solve the problem of multi-level thresholding for image segmentation, and demonstrate the impact of combining the OBL technique with the original SAR for improving solution quality and accelerating convergence speed. The effectiveness of the proposed mSAR is evaluated against other competing algorithms, including the L'evy flight distribution (LFD), Harris hawks optimization (HHO), sine cosine algorithm (SCA), equilibrium optimizer (EO), gravitational search algorithm (GSA), arithmetic optimization algorithm (AOA), and the original SAR. Furthermore, a set of experiments for multi-level thresholding image segmentation is performed to prove the superiority of the proposed mSAR using fuzzy entropy and the Otsu method as two objective functions over a set of benchmark images with different numbers of thresholds based on a set of evaluation matrices. Finally, analysis of the experiments' outcomes indicates that the mSAR algorithm is highly efficient in terms of the quality of the segmented image and feature conservation, compared with the other competing algorithms.
Collapse
Affiliation(s)
- Essam H Houssein
- Faculty of Computers and Information, Minia University, Minia 61519, Egypt
| | - Gaber M Mohamed
- Faculty of Computers and Information, Minia University, Minia 61519, Egypt
| | - Nagwan Abdel Samee
- Department of Information Technology, College of Computer and Information Sciences, Princess Nourah bint Abdulrahman University, P.O. Box 84428, Riyadh 11671, Saudi Arabia
| | - Reem Alkanhel
- Department of Information Technology, College of Computer and Information Sciences, Princess Nourah bint Abdulrahman University, P.O. Box 84428, Riyadh 11671, Saudi Arabia
| | - Ibrahim A Ibrahim
- Faculty of Computers and Information, Minia University, Minia 61519, Egypt
| | - Yaser M Wazery
- Faculty of Computers and Information, Minia University, Minia 61519, Egypt
| |
Collapse
|
11
|
Nicolás-Sáenz L, Ledezma A, Pascau J, Muñoz-Barrutia A. ABANICCO: A New Color Space for Multi-Label Pixel Classification and Color Analysis. SENSORS (BASEL, SWITZERLAND) 2023; 23:3338. [PMID: 36992044 PMCID: PMC10052715 DOI: 10.3390/s23063338] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [Grants] [Track Full Text] [Figures] [Subscribe] [Scholar Register] [Received: 02/10/2023] [Revised: 03/15/2023] [Accepted: 03/19/2023] [Indexed: 06/19/2023]
Abstract
Classifying pixels according to color, and segmenting the respective areas, are necessary steps in any computer vision task that involves color images. The gap between human color perception, linguistic color terminology, and digital representation are the main challenges for developing methods that properly classify pixels based on color. To address these challenges, we propose a novel method combining geometric analysis, color theory, fuzzy color theory, and multi-label systems for the automatic classification of pixels into 12 conventional color categories, and the subsequent accurate description of each of the detected colors. This method presents a robust, unsupervised, and unbiased strategy for color naming, based on statistics and color theory. The proposed model, "ABANICCO" (AB ANgular Illustrative Classification of COlor), was evaluated through different experiments: its color detection, classification, and naming performance were assessed against the standardized ISCC-NBS color system; its usefulness for image segmentation was tested against state-of-the-art methods. This empirical evaluation provided evidence of ABANICCO's accuracy in color analysis, showing how our proposed model offers a standardized, reliable, and understandable alternative for color naming that is recognizable by both humans and machines. Hence, ABANICCO can serve as a foundation for successfully addressing a myriad of challenges in various areas of computer vision, such as region characterization, histopathology analysis, fire detection, product quality prediction, object description, and hyperspectral imaging.
Collapse
Affiliation(s)
- Laura Nicolás-Sáenz
- Departamento de Bioingeniería, Universidad Carlos III de Madrid, 28911 Leganes, Spain; (L.N.-S.)
- Instituto de Investigación Sanitaria Gregorio Marañón, 28007 Madrid, Spain
| | - Agapito Ledezma
- Departmento de Informática, Universidad Carlos III de Madrid, 28911 Leganes, Spain
| | - Javier Pascau
- Departamento de Bioingeniería, Universidad Carlos III de Madrid, 28911 Leganes, Spain; (L.N.-S.)
- Instituto de Investigación Sanitaria Gregorio Marañón, 28007 Madrid, Spain
| | - Arrate Muñoz-Barrutia
- Departamento de Bioingeniería, Universidad Carlos III de Madrid, 28911 Leganes, Spain; (L.N.-S.)
- Instituto de Investigación Sanitaria Gregorio Marañón, 28007 Madrid, Spain
| |
Collapse
|
12
|
Al-Betar MA, Awadallah MA, Makhadmeh SN, Doush IA, Zitar RA, Alshathri S, Abd Elaziz M. A hybrid Harris Hawks optimizer for economic load dispatch problems. ALEXANDRIA ENGINEERING JOURNAL 2023; 64:365-389. [DOI: 10.1016/j.aej.2022.09.010] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 09/02/2023]
|
13
|
Li S, Li Z, Li Q, Zhang M, Li L. Hybrid improved capuchin search algorithm for plant image thresholding. FRONTIERS IN PLANT SCIENCE 2023; 14:1122788. [PMID: 36778683 PMCID: PMC9909333 DOI: 10.3389/fpls.2023.1122788] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Figures] [Subscribe] [Scholar Register] [Received: 12/13/2022] [Accepted: 01/02/2023] [Indexed: 06/18/2023]
Abstract
With the development and wider application of meta-heuristic optimization algorithms, researchers increasingly apply them to threshold optimization of multi-level image segmentation. This paper explores the performance and effects of Capuchin Search Algorithm (CAPSA) in threshold optimization. To solve problems of uneven distribution in the initial population of Capuchin Search Algorithm, low levels of global search performance and premature falling into local optima, this paper proposes an improved Capuchin Search Algorithm (ICAPSA) through a multi-strategy approach. ICAPSA uses chaotic opposite-based learning strategy to initialize the positions of individual capuchins, and improve the quality of the initial population. In the iterative position updating process, Levy Flight disturbance strategy is introduced to balance the global optimization and local exploitation of the algorithm. Finally, taking Kapur as the objective function, this paper applies ICAPSA to multi-level thresholding in the plant images, and compares its segmentation effects with the original CAPSA, the Fuzzy Artificial Bee Colony algorithm (FABC), the Differential Coyote Optimization Algorithm (DCOA), the Modified Whale Optimization Algorithm (MWOA) and Improved Satin Bowerbird Optimization Algorithm (ISBO). Through comparison, it is found that ICAPSA demonstrates superior segmentation effect, both in the visual effects of image segmentation and in data comparison.
Collapse
Affiliation(s)
- Shujing Li
- School of Computer and Information Engineering, Fuyang Normal University, Fuyang, China
| | - Zhangfei Li
- School of Computer and Information Engineering, Fuyang Normal University, Fuyang, China
| | - Qinghe Li
- School of Computer and Information Engineering, Fuyang Normal University, Fuyang, China
| | - Mingyu Zhang
- School of Computer and Information Engineering, Fuyang Normal University, Fuyang, China
| | - Linguo Li
- School of Computer and Information Engineering, Fuyang Normal University, Fuyang, China
- School of Computer, Nanjing University of Posts and Telecommunications, Nanjing, China
| |
Collapse
|
14
|
Wang M, Chen L, Heidari AA, Chen H. Fireworks explosion boosted Harris Hawks optimization for numerical optimization: Case of classifying the severity of COVID-19. Front Neuroinform 2023; 16:1055241. [PMID: 36760338 PMCID: PMC9905796 DOI: 10.3389/fninf.2022.1055241] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 09/27/2022] [Accepted: 12/13/2022] [Indexed: 01/26/2023] Open
Abstract
Harris Hawks optimization (HHO) is a swarm optimization approach capable of handling a broad range of optimization problems. HHO, on the other hand, is commonly plagued by inadequate exploitation and a sluggish rate of convergence for certain numerical optimization. This study combines the fireworks algorithm's explosion search mechanism into HHO and proposes a framework for fireworks explosion-based HHo to address this issue (FWHHO). More specifically, the proposed FWHHO structure is comprised of two search phases: harris hawk search and fireworks explosion search. A search for fireworks explosion is done to identify locations where superior hawk solutions may be developed. On the CEC2014 benchmark functions, the FWHHO approach outperforms the most advanced algorithms currently available. Moreover, the new FWHHO framework is compared to four existing HHO and fireworks algorithms, and the experimental results suggest that FWHHO significantly outperforms existing HHO and fireworks algorithms. Finally, the proposed FWHHO is employed to evolve a kernel extreme learning machine for diagnosing COVID-19 utilizing biochemical indices. The statistical results suggest that the proposed FWHHO can discriminate and classify the severity of COVID-19, implying that it may be a computer-aided approach capable of providing adequate early warning for COVID-19 therapy and diagnosis.
Collapse
Affiliation(s)
- Mingjing Wang
- School of Computer Science and Engineering, Southeast University, Nanjing, China,The Key Laboratory of Computer Network and Information Integration, Southeast University, Ministry of Education, Nanjing, China
| | - Long Chen
- School of Computer Science and Engineering, Southeast University, Nanjing, China,The Key Laboratory of Computer Network and Information Integration, Southeast University, Ministry of Education, Nanjing, China,*Correspondence: Long Chen ✉
| | - Ali Asghar Heidari
- School of Surveying and Geospatial Engineering, College of Engineering, University of Tehran, Tehran, Iran
| | - Huiling Chen
- College of Computer Science and Artificial Intelligence, Wenzhou University, Wenzhou, China,Huiling Chen ✉
| |
Collapse
|
15
|
Han Y, Chen W, Heidari AA, Chen H. Multi-verse Optimizer with Rosenbrock and Diffusion Mechanisms for Multilevel Threshold Image Segmentation from COVID-19 Chest X-Ray Images. JOURNAL OF BIONIC ENGINEERING 2023; 20:1198-1262. [PMID: 36619872 PMCID: PMC9811903 DOI: 10.1007/s42235-022-00295-w] [Citation(s) in RCA: 15] [Impact Index Per Article: 7.5] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Figures] [Subscribe] [Scholar Register] [Received: 06/27/2022] [Revised: 10/17/2022] [Accepted: 10/19/2022] [Indexed: 06/17/2023]
Abstract
Coronavirus Disease 2019 (COVID-19) is the most severe epidemic that is prevalent all over the world. How quickly and accurately identifying COVID-19 is of great significance to controlling the spread speed of the epidemic. Moreover, it is essential to accurately and rapidly identify COVID-19 lesions by analyzing Chest X-ray images. As we all know, image segmentation is a critical stage in image processing and analysis. To achieve better image segmentation results, this paper proposes to improve the multi-verse optimizer algorithm using the Rosenbrock method and diffusion mechanism named RDMVO. Then utilizes RDMVO to calculate the maximum Kapur's entropy for multilevel threshold image segmentation. This image segmentation scheme is called RDMVO-MIS. We ran two sets of experiments to test the performance of RDMVO and RDMVO-MIS. First, RDMVO was compared with other excellent peers on IEEE CEC2017 to test the performance of RDMVO on benchmark functions. Second, the image segmentation experiment was carried out using RDMVO-MIS, and some meta-heuristic algorithms were selected as comparisons. The test image dataset includes Berkeley images and COVID-19 Chest X-ray images. The experimental results verify that RDMVO is highly competitive in benchmark functions and image segmentation experiments compared with other meta-heuristic algorithms.
Collapse
Affiliation(s)
- Yan Han
- Department of Computer Science and Artificial Intelligence, Wenzhou University, Wenzhou, 325035 China
| | - Weibin Chen
- Department of Computer Science and Artificial Intelligence, Wenzhou University, Wenzhou, 325035 China
| | - Ali Asghar Heidari
- School of Surveying and Geospatial Engineering, College of Engineering, University of Tehran, Tehran, Iran
| | - Huiling Chen
- Department of Computer Science and Artificial Intelligence, Wenzhou University, Wenzhou, 325035 China
| |
Collapse
|
16
|
Enhanced Arithmetic Optimization Algorithm for Parameter Estimation of PID Controller. ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING 2023; 48:2191-2205. [PMID: 36042895 PMCID: PMC9411853 DOI: 10.1007/s13369-022-07136-2] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.5] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 03/03/2022] [Accepted: 07/19/2022] [Indexed: 11/09/2022]
Abstract
The Proportional-Integral-Derivative (PID) controller is a key component in most engineering applications. The main disadvantage of PID is the selection of the best values for its parameters using traditional methods that do not achieve the best response. In this work, the recently released empirical identification algorithm that is the Arithmetic Optimization Algorithm (AOA) was used to determine the best values of the PID parameters. AOA was selected due to its effective exploration ability. Unfortunately, AOA cannot achieve the best parameter values due to its poor exploitation of search space. Hence, the performance of the AOA exploit is improved by combining it with the Harris Hawk Optimization (HHO) algorithm which has an efficient exploit mechanism. In addition, avoidance of trapping in the local lower bounds of AOA-HHO is enhanced by the inclusion of perturbation and mutation factors. The proposed AOA-HHO algorithm is tested when choosing the best values for PID parameters to control two engineering applications namely DC motor regulation and three fluid level sequential tank systems. AOA-HHO has superiority over AOA and comparative algorithms.
Collapse
|
17
|
Hosny KM, Khalid AM, Hamza HM, Mirjalili S. Multilevel segmentation of 2D and volumetric medical images using hybrid Coronavirus Optimization Algorithm. Comput Biol Med 2022; 150:106003. [PMID: 36228462 PMCID: PMC9398848 DOI: 10.1016/j.compbiomed.2022.106003] [Citation(s) in RCA: 13] [Impact Index Per Article: 4.3] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 03/17/2022] [Revised: 08/10/2022] [Accepted: 08/14/2022] [Indexed: 12/01/2022]
Abstract
Medical image segmentation is a crucial step in Computer-Aided Diagnosis systems, where accurate segmentation is vital for perfect disease diagnoses. This paper proposes a multilevel thresholding technique for 2D and 3D medical image segmentation using Otsu and Kapur's entropy methods as fitness functions to determine the optimum threshold values. The proposed algorithm applies the hybridization concept between the recent Coronavirus Optimization Algorithm (COVIDOA) and Harris Hawks Optimization Algorithm (HHOA) to benefit from both algorithms' strengths and overcome their limitations. The improved performance of the proposed algorithm over COVIDOA and HHOA algorithms is demonstrated by solving 5 test problems from IEEE CEC 2019 benchmark problems. Medical image segmentation is tested using two groups of images, including 2D medical images and volumetric (3D) medical images, to demonstrate its superior performance. The utilized test images are from different modalities such as Magnetic Resonance Imaging (MRI), Computed Tomography (CT), and X-ray images. The proposed algorithm is compared with seven well-known metaheuristic algorithms, where the performance is evaluated using four different metrics, including the best fitness values, Peak Signal to Noise Ratio (PSNR), Structural Similarity Index (SSIM), and Normalized Correlation Coefficient (NCC). The experimental results demonstrate the superior performance of the proposed algorithm in terms of convergence to the global optimum and making a good balance between exploration and exploitation properties. Moreover, the quality of the segmented images using the proposed algorithm at different threshold levels is better than the other methods according to PSNR, SSIM, and NCC values. Additionally, the Wilcoxon rank-sum test is conducted to prove the statistical significance of the proposed algorithm.
Collapse
Affiliation(s)
- Khalid M Hosny
- Department of Information Technology, Faculty of Computers and Informatics, Zagazig University, Zagazig, 44519, Egypt.
| | - Asmaa M Khalid
- Department of Information Technology, Faculty of Computers and Informatics, Zagazig University, Zagazig, 44519, Egypt
| | - Hanaa M Hamza
- Department of Information Technology, Faculty of Computers and Informatics, Zagazig University, Zagazig, 44519, Egypt
| | - Seyedali Mirjalili
- Centre for Artificial Intelligence Research and Optimisation, Torrens University Australia, Fortitude Valley, Brisbane, 4006, QLD, Australia
| |
Collapse
|
18
|
A novel multilevel color image segmentation technique based on an improved firefly algorithm and energy curve. EVOLVING SYSTEMS 2022. [DOI: 10.1007/s12530-022-09460-2] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/14/2022]
|
19
|
Jiao S, Wang C, Gao R, Li Y, Zhang Q. A novel Hybrid Harris hawk sine cosine optimization algorithm for reactive power optimization problem. J EXP THEOR ARTIF IN 2022. [DOI: 10.1080/0952813x.2022.2115144] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/14/2022]
Affiliation(s)
- Shangbin Jiao
- School of Automation and Information Engineering, Xi’an University of Technology, Xi’an, China
- Shaanxi Key Laboratory of Complex System Control and Intelligent Information Processing, Xi’an University of Technology, Xi’an, China
| | - Chen Wang
- School of Automation and Information Engineering, Xi’an University of Technology, Xi’an, China
| | - Rui Gao
- Shaanxi Key Laboratory of Complex System Control and Intelligent Information Processing, Xi’an University of Technology, Xi’an, China
- School of Electronic & Electrical Engineering, Baoji University of Arts and Sciences, Baoji, Shaanxi, China
| | - Yuxing Li
- School of Automation and Information Engineering, Xi’an University of Technology, Xi’an, China
| | - Qing Zhang
- School of Automation and Information Engineering, Xi’an University of Technology, Xi’an, China
| |
Collapse
|
20
|
Olmez Y, Sengur A, Koca GO, Rao RV. An adaptive multilevel thresholding method with chaotically-enhanced Rao algorithm. MULTIMEDIA TOOLS AND APPLICATIONS 2022; 82:12351-12377. [PMID: 36105661 PMCID: PMC9461387 DOI: 10.1007/s11042-022-13671-9] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Figures] [Subscribe] [Scholar Register] [Received: 10/21/2021] [Revised: 02/07/2022] [Accepted: 08/11/2022] [Indexed: 06/15/2023]
Abstract
Multilevel image thresholding is a well-known technique for image segmentation. Recently, various metaheuristic methods have been proposed for the determination of the thresholds for multilevel image segmentation. These methods are mainly based on metaphors and they have high complexity and their convergences are comparably slow. In this paper, a multilevel image thresholding approach is proposed that simplifies the thresholding problem by using a simple optimization technique instead of metaphor-based algorithms. More specifically, in this paper, Chaotic enhanced Rao (CER) algorithms are developed where eight chaotic maps namely Logistic, Sine, Sinusoidal, Gauss, Circle, Chebyshev, Singer, and Tent are used. Besides, in the developed CER algorithm, the number of thresholds is determined automatically, instead of manual determination. The performances of the developed CER algorithms are evaluated based on different statistical analysis metrics namely BDE, PRI, VOI, GCE, SSIM, FSIM, RMSE, PSNR, NK, AD, SC, MD, and NAE. The experimental works and the related evaluations are carried out on the BSDS300 dataset. The obtained experimental results demonstrate that the proposed CER algorithm outperforms the compared methods based on PRI, SSIM, FSIM, PSNR, RMSE, AD, and NAE metrics. In addition, the proposed method provides better convergence regarding speed and accuracy.
Collapse
Affiliation(s)
- Yagmur Olmez
- Department of Mechatronics Engineering, Faculty of Technology, University of Firat, 23119 Elazig, Turkey
| | - Abdulkadir Sengur
- Department of Electrical and Electronics Engineering, Faculty of Technology, University of Firat, 23119 Elazig, Turkey
| | - Gonca Ozmen Koca
- Department of Mechatronics Engineering, Faculty of Technology, University of Firat, 23119 Elazig, Turkey
| | - Ravipudi Venkata Rao
- Department of Mechanical Engineering, Sardar Vallabhbhai National Institute of Technology, Surat, Gujarat 395007 India
| |
Collapse
|
21
|
Multilevel thresholding image segmentation using meta-heuristic optimization algorithms: comparative analysis, open challenges and new trends. APPL INTELL 2022. [DOI: 10.1007/s10489-022-04064-4] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/02/2022]
|
22
|
Naik M, Rueda L, Vasighizaker A. Identification of Enriched Regions in ChIP-Seq Data via a Linear-Time Multi-Level Thresholding Algorithm. IEEE/ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS 2022; 19:2842-2850. [PMID: 34398762 DOI: 10.1109/tcbb.2021.3104734] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/13/2023]
Abstract
Chromatin immunoprecipitation (ChIP-Seq) has emerged as a superior alternative to microarray technology as it provides higher resolution, less noise, greater coverage and wider dynamic range. While ChIP-Seq enables probing of DNA-protein interaction over the entire genome, it requires the use of sophisticated tools to recognize hidden patterns and extract meaningful data. Over the years, various attempts have resulted in several algorithms making use of different heuristics to accurately determine individual peaks corresponding to unique DNA-protein. However, finding all the significant peaks with high accuracy in a reasonable time is still a challenge. In this work, we propose the use of Multi-level thresholding algorithm, which we call LinMLTBS, used to identify the enriched regions on ChIP-Seq data. Although various suboptimal heuristics have been proposed for multi-level thresholding, we emphasize on the use of an algorithm capable of obtaining an optimal solution, while maintaining linear-time complexity. Testing various algorithm on various ENCODE project datasets shows that our approach attains higher accuracy relative to previously proposed peak finders while retaining a reasonable processing speed.
Collapse
|
23
|
Thawkar S. Feature selection and classification in mammography using hybrid crow search algorithm with Harris hawks optimization. Biocybern Biomed Eng 2022. [DOI: 10.1016/j.bbe.2022.09.001] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/02/2022]
|
24
|
Xiao Y, Guo Y, Cui H, Wang Y, Li J, Zhang Y. IHAOAVOA: An improved hybrid aquila optimizer and African vultures optimization algorithm for global optimization problems. MATHEMATICAL BIOSCIENCES AND ENGINEERING : MBE 2022; 19:10963-11017. [PMID: 36124577 DOI: 10.3934/mbe.2022512] [Citation(s) in RCA: 7] [Impact Index Per Article: 2.3] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/15/2023]
Abstract
Aquila Optimizer (AO) and African Vultures Optimization Algorithm (AVOA) are two newly developed meta-heuristic algorithms that simulate several intelligent hunting behaviors of Aquila and African vulture in nature, respectively. AO has powerful global exploration capability, whereas its local exploitation phase is not stable enough. On the other hand, AVOA possesses promising exploitation capability but insufficient exploration mechanisms. Based on the characteristics of both algorithms, in this paper, we propose an improved hybrid AO and AVOA optimizer called IHAOAVOA to overcome the deficiencies in the single algorithm and provide higher-quality solutions for solving global optimization problems. First, the exploration phase of AO and the exploitation phase of AVOA are combined to retain the valuable search competence of each. Then, a new composite opposition-based learning (COBL) is designed to increase the population diversity and help the hybrid algorithm escape from the local optima. In addition, to more effectively guide the search process and balance the exploration and exploitation, the fitness-distance balance (FDB) selection strategy is introduced to modify the core position update formula. The performance of the proposed IHAOAVOA is comprehensively investigated and analyzed by comparing against the basic AO, AVOA, and six state-of-the-art algorithms on 23 classical benchmark functions and the IEEE CEC2019 test suite. Experimental results demonstrate that IHAOAVOA achieves superior solution accuracy, convergence speed, and local optima avoidance than other comparison methods on most test functions. Furthermore, the practicality of IHAOAVOA is highlighted by solving five engineering design problems. Our findings reveal that the proposed technique is also highly competitive and promising when addressing real-world optimization tasks. The source code of the IHAOAVOA is publicly available at https://doi.org/10.24433/CO.2373662.v1.
Collapse
Affiliation(s)
- Yaning Xiao
- College of Mechanical and Electrical Engineering, Northeast Forestry University, Harbin 150040, China
| | - Yanling Guo
- College of Mechanical and Electrical Engineering, Northeast Forestry University, Harbin 150040, China
| | - Hao Cui
- College of Mechanical and Electrical Engineering, Northeast Forestry University, Harbin 150040, China
| | - Yangwei Wang
- College of Mechanical and Electrical Engineering, Northeast Forestry University, Harbin 150040, China
| | - Jian Li
- College of Mechanical and Electrical Engineering, Northeast Forestry University, Harbin 150040, China
| | - Yapeng Zhang
- College of Mechanical and Electrical Engineering, Northeast Forestry University, Harbin 150040, China
| |
Collapse
|
25
|
|
26
|
Harris Hawk Optimization: A Survey onVariants and Applications. COMPUTATIONAL INTELLIGENCE AND NEUROSCIENCE 2022; 2022:2218594. [PMID: 35795744 PMCID: PMC9252670 DOI: 10.1155/2022/2218594] [Citation(s) in RCA: 2] [Impact Index Per Article: 0.7] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 02/19/2022] [Accepted: 05/24/2022] [Indexed: 12/19/2022]
Abstract
In this review, we intend to present a complete literature survey on the conception and variants of the recent successful optimization algorithm, Harris Hawk optimizer (HHO), along with an updated set of applications in well-established works. For this purpose, we first present an overview of HHO, including its logic of equations and mathematical model. Next, we focus on reviewing different variants of HHO from the available well-established literature. To provide readers a deep vision and foster the application of the HHO, we review the state-of-the-art improvements of HHO, focusing mainly on fuzzy HHO and a new intuitionistic fuzzy HHO algorithm. We also review the applications of HHO in enhancing machine learning operations and in tackling engineering optimization problems. This survey can cover different aspects of HHO and its future applications to provide a basis for future research in the development of swarm intelligence paths and the use of HHO for real-world problems.
Collapse
|
27
|
Rath P, Mallick PK, Tripathy HK, Mishra D. A Tuned Whale Optimization-Based Stacked-LSTM Network for Digital Image Segmentation. ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING 2022. [DOI: 10.1007/s13369-022-06964-6] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 11/02/2022]
|
28
|
Abstract
The Harris hawk optimizer is a recent population-based metaheuristics algorithm that simulates the hunting behavior of hawks. This swarm-based optimizer performs the optimization procedure using a novel way of exploration and exploitation and the multiphases of search. In this review research, we focused on the applications and developments of the recent well-established robust optimizer Harris hawk optimizer (HHO) as one of the most popular swarm-based techniques of 2020. Moreover, several experiments were carried out to prove the powerfulness and effectivness of HHO compared with nine other state-of-art algorithms using Congress on Evolutionary Computation (CEC2005) and CEC2017. The literature review paper includes deep insight about possible future directions and possible ideas worth investigations regarding the new variants of the HHO algorithm and its widespread applications.
Collapse
|
29
|
Luo Z, Jin S, Li Z, Huang H, Xiao L, Chen H, Heidari AA, Hu J, Chen C, Chen P, Hu Z. Hierarchical Harris hawks optimization for epileptic seizure classification. Comput Biol Med 2022; 145:105397. [DOI: 10.1016/j.compbiomed.2022.105397] [Citation(s) in RCA: 2] [Impact Index Per Article: 0.7] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 10/13/2021] [Revised: 03/08/2022] [Accepted: 03/09/2022] [Indexed: 01/15/2023]
|
30
|
Modified Remora Optimization Algorithm for Global Optimization and Multilevel Thresholding Image Segmentation. MATHEMATICS 2022. [DOI: 10.3390/math10071014] [Citation(s) in RCA: 18] [Impact Index Per Article: 6.0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 02/04/2023]
Abstract
Image segmentation is a key stage in image processing because it simplifies the representation of the image and facilitates subsequent analysis. The multi-level thresholding image segmentation technique is considered one of the most popular methods because it is efficient and straightforward. Many relative works use meta-heuristic algorithms (MAs) to determine threshold values, but they have issues such as poor convergence accuracy and stagnation into local optimal solutions. Therefore, to alleviate these shortcomings, in this paper, we present a modified remora optimization algorithm (MROA) for global optimization and image segmentation tasks. We used Brownian motion to promote the exploration ability of ROA and provide a greater opportunity to find the optimal solution. Second, lens opposition-based learning is introduced to enhance the ability of search agents to jump out of the local optimal solution. To substantiate the performance of MROA, we first used 23 benchmark functions to evaluate the performance. We compared it with seven well-known algorithms regarding optimization accuracy, convergence speed, and significant difference. Subsequently, we tested the segmentation quality of MORA on eight grayscale images with cross-entropy as the objective function. The experimental metrics include peak signal-to-noise ratio (PSNR), structure similarity (SSIM), and feature similarity (FSIM). A series of experimental results have proved that the MROA has significant advantages among the compared algorithms. Consequently, the proposed MROA is a promising method for global optimization problems and image segmentation.
Collapse
|
31
|
Abdel-Basset M, Mohamed R, Abouhawwash M. A new fusion of whale optimizer algorithm with Kapur's entropy for multi-threshold image segmentation: analysis and validations. Artif Intell Rev 2022; 55:6389-6459. [PMID: 35342218 PMCID: PMC8935268 DOI: 10.1007/s10462-022-10157-w] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 12/02/2022]
Abstract
The separation of an object from other objects or the background by selecting the optimal threshold values remains a challenge in the field of image segmentation. Threshold segmentation is one of the most popular image segmentation techniques. The traditional methods for finding the optimum threshold are computationally expensive, tedious, and may be inaccurate. Hence, this paper proposes an Improved Whale Optimization Algorithm (IWOA) based on Kapur’s entropy for solving multi-threshold segmentation of the gray level image. Also, IWOA supports its performance using linearly convergence increasing and local minima avoidance technique (LCMA), and ranking-based updating method (RUM). LCMA technique accelerates the convergence speed of the solutions toward the optimal solution and tries to avoid the local minima problem that may fall within the optimization process. To do that, it updates randomly the positions of the worst solutions to be near to the best solution and at the same time randomly within the search space according to a certain probability to avoid stuck into local minima. Because of the randomization process used in LCMA for updating the solutions toward the best solutions, a huge number of the solutions around the best are skipped. Therefore, the RUM is used to replace the unbeneficial solution with a novel updating scheme to cover this problem. We compare IWOA with another seven algorithms using a set of well-known test images. We use several performance measures, such as fitness values, Peak Signal to Noise Ratio, Structured Similarity Index Metric, Standard Deviation, and CPU time.
Collapse
Affiliation(s)
- Mohamed Abdel-Basset
- Zagazig Univesitry, Shaibet an Nakareyah, Zagazig 2, Zagazig, 44519 Ash Sharqia Governorate Egypt
| | - Reda Mohamed
- Zagazig Univesitry, Shaibet an Nakareyah, Zagazig 2, Zagazig, 44519 Ash Sharqia Governorate Egypt
| | - Mohamed Abouhawwash
- Department of Mathematics Faculty of Science, Mansoura University, Mansoura, 35516 Egypt.,Department of Computational Mathematics, Science, and Engineering (CMSE), Michigan State University, East Lansing, MI 48824 USA
| |
Collapse
|
32
|
K-Means Segmentation of Underwater Image Based on Improved Manta Ray Algorithm. COMPUTATIONAL INTELLIGENCE AND NEUROSCIENCE 2022; 2022:4587880. [PMID: 35341174 PMCID: PMC8942626 DOI: 10.1155/2022/4587880] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 12/30/2021] [Revised: 02/03/2022] [Accepted: 02/08/2022] [Indexed: 11/27/2022]
Abstract
Image segmentation plays an important role in daily life. The traditional K-means image segmentation has the shortcomings of randomness and is easy to fall into local optimum, which greatly reduces the quality of segmentation. To improve these phenomena, a K-means image segmentation method based on improved manta ray foraging optimization (IMRFO) is proposed. IMRFO uses Lévy flight to improve the flexibility of individual manta rays and then puts forward a random walk learning that prevents the algorithm from falling into the local optimal state. Finally, the learning idea of particle swarm optimization is introduced to enhance the convergence accuracy of the algorithm, which effectively improves the global and local optimization ability of the algorithm simultaneously. With the probability that K-means will fall into local optimum reducing, the optimized K-means hold stronger stability. In the 12 standard test functions, 7 basic algorithms and 4 variant algorithms are compared with IMRFO. The results of the optimization index and statistical test show that IMRFO has better optimization ability. Eight underwater images were selected for the experiment and compared with 11 algorithms. The results show that PSNR, SSIM, and FSIM of IMRFO in each image are better. Meanwhile, the optimized K-means image segmentation performance is better.
Collapse
|
33
|
Kundu T, Deepmala, Jain PK. A hybrid salp swarm algorithm based on TLBO for reliability redundancy allocation problems. APPL INTELL 2022; 52:12630-12667. [PMID: 36161208 PMCID: PMC9481865 DOI: 10.1007/s10489-021-02862-w] [Citation(s) in RCA: 4] [Impact Index Per Article: 1.3] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Accepted: 09/17/2021] [Indexed: 12/23/2022]
Abstract
A novel optimization algorithm called hybrid salp swarm algorithm with teaching-learning based optimization (HSSATLBO) is proposed in this paper to solve reliability redundancy allocation problems (RRAP) with nonlinear resource constraints. Salp swarm algorithm (SSA) is one of the newest meta-heuristic algorithms which mimic the swarming behaviour of salps. It is an efficient swarm optimization technique that has been used to solve various kinds of complex optimization problems. However, SSA suffers a slow convergence rate due to its poor exploitation ability. In view of this inadequacy and resulting in a better balance between exploration and exploitation, the proposed hybrid method HSSATLBO has been developed where the searching procedures of SSA are renovated based on the TLBO algorithm. The good global search ability of SSA and fast convergence of TLBO help to maximize the system reliability through the choices of redundancy and component reliability. The performance of the proposed HSSATLBO algorithm has been demonstrated by seven well-known benchmark problems related to reliability optimization that includes series system, complex (bridge) system, series-parallel system, overspeed protection system, convex system, mixed series-parallel system, and large-scale system with dimensions 36, 38, 40, 42 and 50. After illustration, the outcomes of the proposed HSSATLBO are compared with several recently developed competitive meta-heuristic algorithms and also with three improved variants of SSA. Additionally, the HSSATLBO results are statistically investigated with the wilcoxon sign-rank test and multiple comparison test to show the significance of the results. The experimental results suggest that HSSATLBO significantly outperforms other algorithms and has become a remarkable and promising tool for solving RRAP.
Collapse
|
34
|
|
35
|
Wang M, Wang JS, Li XD, Zhang M, Hao WK. Harris Hawk Optimization Algorithm Based on Cauchy Distribution Inverse Cumulative Function and Tangent Flight Operator. APPL INTELL 2022. [DOI: 10.1007/s10489-021-03080-0] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/02/2022]
|
36
|
Balaha HM, El-Gendy EM, Saafan MM. CovH2SD: A COVID-19 detection approach based on Harris Hawks Optimization and stacked deep learning. EXPERT SYSTEMS WITH APPLICATIONS 2021; 186:115805. [PMID: 34511738 PMCID: PMC8418701 DOI: 10.1016/j.eswa.2021.115805] [Citation(s) in RCA: 26] [Impact Index Per Article: 6.5] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Subscribe] [Scholar Register] [Received: 06/26/2021] [Revised: 08/13/2021] [Accepted: 08/23/2021] [Indexed: 05/14/2023]
Abstract
Starting from Wuhan in China at the end of 2019, coronavirus disease (COVID-19) has propagated fast all over the world, affecting the lives of billions of people and increasing the mortality rate worldwide in few months. The golden treatment against the invasive spread of COVID-19 is done by identifying and isolating the infected patients, and as a result, fast diagnosis of COVID-19 is a critical issue. The common laboratory test for confirming the infection of COVID-19 is Reverse Transcription Polymerase Chain Reaction (RT-PCR). However, these tests suffer from some problems in time, accuracy, and availability. Chest images have proven to be a powerful tool in the early detection of COVID-19. In the current study, a hybrid learning and optimization approach named CovH2SD is proposed for the COVID-19 detection from the Chest Computed Tomography (CT) images. CovH2SD uses deep learning and pre-trained models to extract the features from the CT images and learn from them. It uses Harris Hawks Optimization (HHO) algorithm to optimize the hyperparameters. Transfer learning is applied using nine pre-trained convolutional neural networks (i.e. ResNet50, ResNet101, VGG16, VGG19, Xception, MobileNetV1, MobileNetV2, DenseNet121, and DenseNet169). Fast Classification Stage (FCS) and Compact Stacking Stage (CSS) are suggested to stack the best models into a single one. Nine experiments are applied and results are reported based on the Loss, Accuracy, Precision, Recall, F1-Score, and Area Under Curve (AUC) performance metrics. The comparison between combinations is applied using the Weighted Sum Method (WSM). Six experiments report a WSM value above 96.5%. The top WSM and accuracy reported values are 99.31% and 99.33% respectively which are higher than the eleven compared state-of-the-art studies.
Collapse
Affiliation(s)
- Hossam Magdy Balaha
- Computers Engineering and Systems Department, Faculty of Engineering, Mansoura University, Egypt
| | - Eman M El-Gendy
- Computers Engineering and Systems Department, Faculty of Engineering, Mansoura University, Egypt
| | - Mahmoud M Saafan
- Computers Engineering and Systems Department, Faculty of Engineering, Mansoura University, Egypt
| |
Collapse
|
37
|
Lin S, Jia H, Abualigah L, Altalhi M. Enhanced Slime Mould Algorithm for Multilevel Thresholding Image Segmentation Using Entropy Measures. ENTROPY 2021; 23:e23121700. [PMID: 34946006 PMCID: PMC8700578 DOI: 10.3390/e23121700] [Citation(s) in RCA: 14] [Impact Index Per Article: 3.5] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 11/18/2021] [Revised: 12/17/2021] [Accepted: 12/17/2021] [Indexed: 01/10/2023]
Abstract
Image segmentation is a fundamental but essential step in image processing because it dramatically influences posterior image analysis. Multilevel thresholding image segmentation is one of the most popular image segmentation techniques, and many researchers have used meta-heuristic optimization algorithms (MAs) to determine the threshold values. However, MAs have some defects; for example, they are prone to stagnate in local optimal and slow convergence speed. This paper proposes an enhanced slime mould algorithm for global optimization and multilevel thresholding image segmentation, namely ESMA. First, the Levy flight method is used to improve the exploration ability of SMA. Second, quasi opposition-based learning is introduced to enhance the exploitation ability and balance the exploration and exploitation. Then, the superiority of the proposed work ESMA is confirmed concerning the 23 benchmark functions. Afterward, the ESMA is applied in multilevel thresholding image segmentation using minimum cross-entropy as the fitness function. We select eight greyscale images as the benchmark images for testing and compare them with the other classical and state-of-the-art algorithms. Meanwhile, the experimental metrics include the average fitness (mean), standard deviation (Std), peak signal to noise ratio (PSNR), structure similarity index (SSIM), feature similarity index (FSIM), and Wilcoxon rank-sum test, which is utilized to evaluate the quality of segmentation. Experimental results demonstrated that ESMA is superior to other algorithms and can provide higher segmentation accuracy.
Collapse
Affiliation(s)
- Shanying Lin
- College of Marine Engineering, Dalian Maritime University, Dalian 116026, China
- Correspondence: (S.L.); (H.J.)
| | - Heming Jia
- School of Information Engineering, Sanming University, Sanming 365004, China
- Correspondence: (S.L.); (H.J.)
| | - Laith Abualigah
- Faculty of Computer Sciences and Informatics, Amman Arab University, Amman 11953, Jordan; or
- School of Computer Science, Universiti Sains Malaysia, Pulau Pinang 11800, Malaysia
| | - Maryam Altalhi
- Department of Management Information System, College of Business Administration, Taif University, P.O. Box 11099, Taif 21944, Saudi Arabia;
| |
Collapse
|
38
|
Chen C, Wang X, Heidari AA, Yu H, Chen H. Multi-Threshold Image Segmentation of Maize Diseases Based on Elite Comprehensive Particle Swarm Optimization and Otsu. FRONTIERS IN PLANT SCIENCE 2021; 12:789911. [PMID: 34966405 PMCID: PMC8710579 DOI: 10.3389/fpls.2021.789911] [Citation(s) in RCA: 8] [Impact Index Per Article: 2.0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Figures] [Subscribe] [Scholar Register] [Received: 10/11/2021] [Accepted: 11/01/2021] [Indexed: 06/14/2023]
Abstract
Maize is a major global food crop and as one of the most productive grain crops, it can be eaten; it is also a good feed for the development of animal husbandry and essential raw material for light industry, chemical industry, medicine, and health. Diseases are the main factor limiting the high and stable yield of maize. Scientific and practical identification is a vital link to reduce the damage of diseases and accurate segmentation of disease spots is one of the fundamental techniques for disease identification. However, one single method cannot achieve a good segmentation effect to meet the diversity and complexity of disease spots. In order to solve the shortcomings of noise interference and oversegmentation in the Otsu segmentation method, a non-local mean filtered two-dimensional histogram was used to remove the noise in disease images and a new elite strategy improved comprehensive particle swarm optimization (PSO) method was used to find the optimal segmentation threshold of the objective function in this study. The experimental results of segmenting three kinds of maize foliar disease images show that the segmentation effect of this method is better than other similar algorithms and it has better convergence and stability.
Collapse
Affiliation(s)
- Chengcheng Chen
- College of Computer Science and Technology, Jilin University, Changchun, China
- Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education, Changchun, China
| | - Xianchang Wang
- College of Computer Science and Technology, Jilin University, Changchun, China
- Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education, Changchun, China
- Chengdu Kestrel Artificial Intelligence Institute, Chengdu, China
| | - Ali Asghar Heidari
- School of Surveying and Geospatial Engineering, College of Engineering, University of Tehran, Tehran, Iran
| | - Helong Yu
- College of Information Technology, Jilin Agricultural University, Changchun, China
| | - Huiling Chen
- College of Computer Science and Artificial Intelligence, Wenzhou University, Wenzhou, China
| |
Collapse
|
39
|
Improved Harris hawks optimization algorithm based on random unscented sigma point mutation strategy. Appl Soft Comput 2021. [DOI: 10.1016/j.asoc.2021.108012] [Citation(s) in RCA: 5] [Impact Index Per Article: 1.3] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/24/2022]
|
40
|
Monga P, Sharma M, Sharma SK. A comprehensive meta-analysis of emerging swarm intelligent computing techniques and their research trend. JOURNAL OF KING SAUD UNIVERSITY - COMPUTER AND INFORMATION SCIENCES 2021. [DOI: 10.1016/j.jksuci.2021.11.016] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 10/19/2022]
|
41
|
Abdel-Basset M, Mohamed R, Abouhawwash M. Hybrid marine predators algorithm for image segmentation: analysis and validations. Artif Intell Rev 2021. [DOI: 10.1007/s10462-021-10086-0] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 01/08/2023]
|
42
|
Su Y, Dai Y, Liu Y. A hybrid parallel Harris hawks optimization algorithm for reusable launch vehicle reentry trajectory optimization with no-fly zones. Soft comput 2021. [DOI: 10.1007/s00500-021-06039-y] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 01/15/2023]
|
43
|
|
44
|
An Improved Hybrid Aquila Optimizer and Harris Hawks Algorithm for Solving Industrial Engineering Optimization Problems. Processes (Basel) 2021. [DOI: 10.3390/pr9091551] [Citation(s) in RCA: 41] [Impact Index Per Article: 10.3] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/16/2022] Open
Abstract
Aquila Optimizer (AO) and Harris Hawks Optimizer (HHO) are recently proposed meta-heuristic optimization algorithms. AO possesses strong global exploration capability but insufficient local exploitation ability. However, the exploitation phase of HHO is pretty good, while the exploration capability is far from satisfactory. Considering the characteristics of these two algorithms, an improved hybrid AO and HHO combined with a nonlinear escaping energy parameter and random opposition-based learning strategy is proposed, namely IHAOHHO, to improve the searching performance in this paper. Firstly, combining the salient features of AO and HHO retains valuable exploration and exploitation capabilities. In the second place, random opposition-based learning (ROBL) is added in the exploitation phase to improve local optima avoidance. Finally, the nonlinear escaping energy parameter is utilized better to balance the exploration and exploitation phases of IHAOHHO. These two strategies effectively enhance the exploration and exploitation of the proposed algorithm. To verify the optimization performance, IHAOHHO is comprehensively analyzed on 23 standard benchmark functions. Moreover, the practicability of IHAOHHO is also highlighted by four industrial engineering design problems. Compared with the original AO and HHO and five state-of-the-art algorithms, the results show that IHAOHHO has strong superior performance and promising prospects.
Collapse
|
45
|
Wang S, Jia H, Liu Q, Zheng R. An improved hybrid Aquila Optimizer and Harris Hawks Optimization for global optimization. MATHEMATICAL BIOSCIENCES AND ENGINEERING : MBE 2021; 18:7076-7109. [PMID: 34814241 DOI: 10.3934/mbe.2021352] [Citation(s) in RCA: 11] [Impact Index Per Article: 2.8] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/13/2023]
Abstract
This paper introduces an improved hybrid Aquila Optimizer (AO) and Harris Hawks Optimization (HHO) algorithm, namely IHAOHHO, to enhance the searching performance for global optimization problems. In the IHAOHHO, valuable exploration and exploitation capabilities of AO and HHO are retained firstly, and then representative-based hunting (RH) and opposition-based learning (OBL) strategies are added in the exploration and exploitation phases to effectively improve the diversity of search space and local optima avoidance capability of the algorithm, respectively. To verify the optimization performance and the practicability, the proposed algorithm is comprehensively analyzed on standard and CEC2017 benchmark functions and three engineering design problems. The experimental results show that the proposed IHAOHHO has more superior global search performance and faster convergence speed compared to the basic AO and HHO and selected state-of-the-art meta-heuristic algorithms.
Collapse
Affiliation(s)
- Shuang Wang
- School of Information Engineering, Sanming University, Sanming 365004, Fujian, China
| | - Heming Jia
- School of Information Engineering, Sanming University, Sanming 365004, Fujian, China
| | - Qingxin Liu
- School of Computer Science and Technology, Hainan University, Haikou 570228, Hainan, China
| | - Rong Zheng
- School of Information Engineering, Sanming University, Sanming 365004, Fujian, China
| |
Collapse
|
46
|
Ji W, He X. Kapur's entropy for multilevel thresholding image segmentation based on moth-flame optimization. MATHEMATICAL BIOSCIENCES AND ENGINEERING : MBE 2021; 18:7110-7142. [PMID: 34814242 DOI: 10.3934/mbe.2021353] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/13/2023]
Abstract
Multilevel thresholding is a reliable and efficacious method for image segmentation that has recently received widespread recognition. However, the computational complexity of the multilevel thresholding method increases as the threshold level increases, which causes the low segmentation accuracy of this method. To overcome this shortcoming, this paper presents a moth-flame optimization (MFO) established on Kapur's entropy to clarify the multilevel thresholding image segmentation. The MFO adjusts exploration and exploitation to achieve the best fitness value. To validate the overall performance, MFO is compared with other algorithms to realize the global optimal solution to maximize the target value of Kapur's entropy. Some critical evaluation indicators are used to determine the segmentation effect and optimization performance of each algorithm. The experimental results indicate that MFO has a faster convergence speed, higher calculation accuracy, better segmentation effect and better stability.
Collapse
Affiliation(s)
- Wenqi Ji
- College of Computer Science, Harbin Finance University, Harbin 150030, China
| | - Xiaoguang He
- College of Computer Science, Harbin Finance University, Harbin 150030, China
| |
Collapse
|
47
|
Piotrowski AP, Piotrowska AE. Differential evolution and particle swarm optimization against COVID-19. Artif Intell Rev 2021; 55:2149-2219. [PMID: 34426713 PMCID: PMC8374127 DOI: 10.1007/s10462-021-10052-w] [Citation(s) in RCA: 2] [Impact Index Per Article: 0.5] [Reference Citation Analysis] [Abstract] [Key Words] [Grants] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Accepted: 07/17/2021] [Indexed: 11/29/2022]
Abstract
COVID-19 disease, which highly affected global life in 2020, led to a rapid scientific response. Versatile optimization methods found their application in scientific studies related to COVID-19 pandemic. Differential Evolution (DE) and Particle Swarm Optimization (PSO) are two metaheuristics that for over two decades have been widely researched and used in various fields of science. In this paper a survey of DE and PSO applications for problems related with COVID-19 pandemic that were rapidly published in 2020 is presented from two different points of view: 1. practitioners seeking the appropriate method to solve particular problem, 2. experts in metaheuristics that are interested in methodological details, inter comparisons between different methods, and the ways for improvement. The effectiveness and popularity of DE and PSO is analyzed in the context of other metaheuristics used against COVID-19. It is found that in COVID-19 related studies: 1. DE and PSO are most frequently used for calibration of epidemiological models and image-based classification of patients or symptoms, but applications are versatile, even interconnecting the pandemic and humanities; 2. reporting on DE or PSO methodological details is often scarce, and the choices made are not necessarily appropriate for the particular algorithm or problem; 3. mainly the basic variants of DE and PSO that were proposed in the late XX century are applied, and research performed in recent two decades is rather ignored; 4. the number of citations and the availability of codes in various programming languages seems to be the main factors for choosing metaheuristics that are finally used.
Collapse
Affiliation(s)
- Adam P. Piotrowski
- Institute of Geophysics, Polish Academy of Sciences, Ks. Janusza 64, 01-452 Warsaw, Poland
| | - Agnieszka E. Piotrowska
- Faculty of Polish Studies, University of Warsaw, Krakowskie Przedmiescie 26/28, 00-927 Warsaw, Poland
| |
Collapse
|
48
|
BHHO-TVS: A Binary Harris Hawks Optimizer with Time-Varying Scheme for Solving Data Classification Problems. APPLIED SCIENCES-BASEL 2021. [DOI: 10.3390/app11146516] [Citation(s) in RCA: 6] [Impact Index Per Article: 1.5] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 02/07/2023]
Abstract
Data classification is a challenging problem. Data classification is very sensitive to the noise and high dimensionality of the data. Being able to reduce the model complexity can help to improve the accuracy of the classification model performance. Therefore, in this research, we propose a novel feature selection technique based on Binary Harris Hawks Optimizer with Time-Varying Scheme (BHHO-TVS). The proposed BHHO-TVS adopts a time-varying transfer function that is applied to leverage the influence of the location vector to balance the exploration and exploitation power of the HHO. Eighteen well-known datasets provided by the UCI repository were utilized to show the significance of the proposed approach. The reported results show that BHHO-TVS outperforms BHHO with traditional binarization schemes as well as other binary feature selection methods such as binary gravitational search algorithm (BGSA), binary particle swarm optimization (BPSO), binary bat algorithm (BBA), binary whale optimization algorithm (BWOA), and binary salp swarm algorithm (BSSA). Compared with other similar feature selection approaches introduced in previous studies, the proposed method achieves the best accuracy rates on 67% of datasets.
Collapse
|
49
|
A Novel Evolutionary Arithmetic Optimization Algorithm for Multilevel Thresholding Segmentation of COVID-19 CT Images. Processes (Basel) 2021. [DOI: 10.3390/pr9071155] [Citation(s) in RCA: 53] [Impact Index Per Article: 13.3] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 12/11/2022] Open
Abstract
One of the most crucial aspects of image segmentation is multilevel thresholding. However, multilevel thresholding becomes increasingly more computationally complex as the number of thresholds grows. In order to address this defect, this paper proposes a new multilevel thresholding approach based on the Evolutionary Arithmetic Optimization Algorithm (AOA). The arithmetic operators in science were the inspiration for AOA. DAOA is the proposed approach, which employs the Differential Evolution technique to enhance the AOA local research. The proposed algorithm is applied to the multilevel thresholding problem, using Kapur’s measure between class variance functions. The suggested DAOA is used to evaluate images, using eight standard test images from two different groups: nature and CT COVID-19 images. Peak signal-to-noise ratio (PSNR) and structural similarity index test (SSIM) are standard evaluation measures used to determine the accuracy of segmented images. The proposed DAOA method’s efficiency is evaluated and compared to other multilevel thresholding methods. The findings are presented with a number of different threshold values (i.e., 2, 3, 4, 5, and 6). According to the experimental results, the proposed DAOA process is better and produces higher-quality solutions than other comparative approaches. Moreover, it achieved better-segmented images, PSNR, and SSIM values. In addition, the proposed DAOA is ranked the first method in all test cases.
Collapse
|
50
|
A self-adaptive Harris Hawks optimization algorithm with opposition-based learning and chaotic local search strategy for global optimization and feature selection. INT J MACH LEARN CYB 2021. [DOI: 10.1007/s13042-021-01326-4] [Citation(s) in RCA: 26] [Impact Index Per Article: 6.5] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/27/2022]
|