Next Article in Journal
Strategic Management of Design and Conceptualization Factors for Wearable Postural Rehabilitation Devices: A Causal Interdependency Analysis
Next Article in Special Issue
Reverse Mutation for Optimization Learning Artificial Lemming Algorithm and Its Application in Engineering
Previous Article in Journal
A Multifunctional Cationic Waterborne Polyurethane System with High Fire-Safety and Antibacterial Performance Enabled by Phosphorous Acid-Protonated Chitosan
Previous Article in Special Issue
Coverage Optimization Strategy for Wireless Sensor Networks Based on Improved Northern Goshawk Optimization Algorithm
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Multi-Strategy Enhanced Bionic-Inspired Secretary Bird Optimization Algorithm for Numerical Optimization and Artistic Image Segmentation

1
School of Packaging Design & Art, Hunan University of Technology, Zhuzhou 412007, China
2
School of Design, Shunde Polytechnic University, Foshan 528000, China
3
Department of Design, Chung-Ang University, Seoul 06974, Republic of Korea
*
Author to whom correspondence should be addressed.
Biomimetics 2026, 11(6), 385; https://doi.org/10.3390/biomimetics11060385
Submission received: 11 May 2026 / Revised: 24 May 2026 / Accepted: 26 May 2026 / Published: 1 June 2026
(This article belongs to the Special Issue Advances in Biological and Bio-Inspired Algorithms: 2nd Edition)

Abstract

To address the limitations of the original Secretary Bird Optimization Algorithm (SBOA), such as insufficient population diversity, weak local exploitation ability, and a tendency to become trapped in local optima when solving complex optimization problems, this paper proposes a Multi-Strategy Improved Secretary Bird Optimization Algorithm (MISBOA). First, a chaotic elite initialization strategy is introduced to improve the quality and diversity of the initial population. Second, an adaptive spiral Lévy flight strategy is designed to enhance the balance between global exploration and local exploitation during the iterative process. Third, a dynamic neighborhood-guided mutation strategy is incorporated to maintain population diversity and improve convergence accuracy in the later search stage. To validate the effectiveness of the proposed algorithm, MISBOA is comprehensively evaluated on the IEEE CEC2014, CEC2017, and CEC2020 benchmark suites. Experimental results demonstrate that MISBOA achieves superior convergence speed, optimization accuracy, and robustness compared with several representative metaheuristic algorithms. Furthermore, MISBOA is applied to Otsu-based multilevel threshold image segmentation. The segmentation performance is assessed using PSNR, FSIM, SSIM, and visual quality comparisons. The results indicate that MISBOA can generate more accurate and stable segmentation outcomes, demonstrating its strong potential for solving complex numerical optimization and artistic image segmentation problems.

1. Introduction

In recent years, driven by the rapid advancements in artificial intelligence, big data, cloud computing, and computer vision technologies, image processing has emerged as one of the most dynamic and practically valuable research directions within the field of information science. Serving as a fundamental basis for image understanding and analysis, image processing techniques are widely applied across a multitude of domains, including medical diagnosis [1], remote sensing [2], intelligent transportation [3], industrial inspection [4], agricultural identification [5], facial recognition [6], and digital media [7]. Particularly against the backdrop of the continuous evolution of deep learning and intelligent perception technologies, there is a growing demand for higher standards regarding image quality, object recognition accuracy, and automated analysis capabilities [8]; this, in turn, has further propelled the sustained development of image processing-related technologies. Among the myriad tasks within image processing, image segmentation stands out as a core research area in computer vision, primarily because it enables the partitioning of an image into distinct regions characterized by similar features, while simultaneously extracting critical information regarding the boundaries, textures, and structural properties of target objects. High-quality image segmentation results not only enhance the accuracy of subsequent feature extraction and object recognition processes but also significantly boost the overall performance of image analysis systems, thereby attracting increasing attention from researchers.
Image segmentation techniques hold immense significance in practical applications. For instance, in medical image analysis, precise image segmentation enables clinicians to rapidly identify lesion areas, thereby enhancing the efficiency of disease diagnosis [9]. In the realm of remote sensing image processing, image segmentation is utilized for land-cover classification, road extraction, and object monitoring [10]. Within the field of industrial inspection, it facilitates product defect detection and quality assessment [11]. Furthermore, in the domains of artistic image processing and digital media, image segmentation is widely applied in tasks such as style transfer, image restoration, object matting, and the creation of visual effects [12]. Compared to natural images, artistic images typically feature more intricate textural information, richer color variations, and more pronounced characteristics of subjective expression; consequently, their segmentation presents a greater challenge. This is particularly true for artistic images, where distinct regions often lack clear boundaries and frequently contain numerous areas characterized by rich detail, similar color tones, or overlapping textures—conditions that render traditional segmentation methods ill-equipped to yield optimal results. Consequently, a key direction in current research involves exploring how to simultaneously enhance the accuracy and stability of artistic image segmentation while faithfully preserving the image’s edge and detailed information.
Currently, researchers have proposed numerous distinct approaches to address the problem of image segmentation, primarily encompassing threshold-based [13], region-based [14], clustering-based [15], edge-detection-based [16], and deep-learning-based methods [17]. Among these, threshold-based segmentation has garnered significant attention due to its simplicity of implementation, computational efficiency, and applicability across a wide variety of image scenarios. In particular, multi-threshold image segmentation methods are capable of effectively extracting information regarding distinct regions within an image, thereby yielding superior segmentation results compared to single-threshold methods [18]. However, as the number of thresholds increases, the image segmentation problem gradually evolves into a complex optimization challenge characterized by high dimensionality, non-linearity, and multi-modality; consequently, traditional exhaustive search methods often suffer from drawbacks such as high computational costs, slow convergence rates, and a susceptibility to becoming trapped in local optima. Therefore, the efficient search for the optimal combination of thresholds has emerged as a critical factor in enhancing image segmentation performance.
To address the aforementioned complex image segmentation problems, researchers have begun exploring the use of optimization algorithms to search for the optimal combination of thresholds, aiming to enhance both the efficiency and accuracy of image segmentation. While traditional optimization methods—such as gradient descent [19], dynamic programming [20], and exhaustive search [21]—can yield satisfactory results when applied to simple, low-dimensional problems, they often suffer from significant drawbacks when confronted with high-dimensional, nonlinear, and multimodal challenges like multi-threshold image segmentation. Specifically, in the context of artistic image segmentation—characterized by intricate textures and rich color variations—the strong coupling relationships among different thresholds make it exceedingly difficult for traditional methods to achieve satisfactory segmentation results within a finite timeframe.
Against this backdrop, metaheuristic optimization algorithms have gradually emerged as a crucial tool for addressing complex image segmentation problems, owing to their robust global search capabilities, minimal parameter requirements, and reduced reliance on specific problem models. Typically, metaheuristic algorithms simulate natural phenomena—such as biological behaviors, collective cooperation, or evolutionary mechanisms—to iteratively update candidate solutions within the search space, thereby facilitating an efficient search for the optimal solution. Compared to traditional optimization methods, metaheuristic algorithms do not require gradient information and impose fewer constraints regarding the continuity and differentiability of the objective function; consequently, they are particularly well-suited for solving complex, multimodal, and non-differentiable problems.
In recent years, an increasing number of researchers have employed heuristic algorithms to solve image segmentation problems. For instance, to address the problem of multi-threshold image segmentation, Ma et al. proposed an improved multi-threshold image segmentation method based on the Whale Optimization Algorithm [22], utilizing inter-class variance (Otsu’s method) as the objective function. Experimental results demonstrate that the proposed RAV-WOA is capable of selecting appropriate thresholds for both grayscale and color images while simultaneously ensuring high efficiency and segmentation quality. To address the image processing task of grayscale multi-level thresholding segmentation, Laith et al. proposed a novel heuristic optimization algorithm that combines the Reptile Search Algorithm with the Salp Swarm Algorithm [23]. This method employs Otsu’s variance classification function to determine the optimal thresholds at each level. Experimental results on COVID-19-related images demonstrate that the performance of the proposed algorithm surpasses that of other heuristic optimization algorithms reported in the literature. To address the challenge of processing Alzheimer’s disease images—which feature complex textures and rich information content—Yu et al. proposed a novel 3D Rényi entropy model that integrates grayscale intensity [24], nonlocal means, and local entropy information. Simulation results demonstrate the model’s outstanding segmentation performance and stability, fully highlighting its immense potential for practical applications in medical image analysis.
The Secretary Bird Optimization Algorithm (SBOA) is a novel population-based meta-heuristic algorithm proposed by Fu et al. in 2024, inspired by the survival behaviors of secretary birds in their natural environment [25]. Experimental evaluations—conducted using the CEC-2017 and CEC-2022 benchmark suites, 12 engineering optimization problems, and a 3D path planning task for unmanned aerial vehicles (UAVs)—demonstrated that SBOA is capable of identifying superior solutions at a faster convergence rate, thereby fully showcasing its immense potential for solving real-world optimization problems. Since its inception, the algorithm has garnered widespread attention within the academic community; numerous researchers have subsequently built upon this algorithm, implementing targeted modifications to address their specific optimization challenges and achieve enhanced results. For instance, to address problems related to wireless sensor network deployment and engineering, Meng et al. improved the SBOA by incorporating a differential cooperative search mechanism [26]. Simulation results indicate that, although the improved algorithm exhibits inconsistent performance in high-dimensional multimodal and complex constrained optimization problems, it performs well in the three specific engineering design and wireless sensor deployment problems it was designed to solve. To enhance power generation efficiency, Qin et al. improved the SBOA by incorporating a feedback regulation mechanism based on incremental PID control [27], a collaborative camouflage strategy, and a cosine-similarity-based update strategy. When applied to the shape optimization problem of Combined Quartic Generalized Spherical Interpolation (CQGBI) curves, this method enables the design of smoother curve shapes—based on parameters derived from the MISBOA approach—thereby boosting power generation efficiency. To address the limitations of existing TDOA-based localization algorithms, Liao et al. proposed an improved Secretary bird Optimization Algorithm for target localization [28]. Simulation results demonstrate that, compared with traditional mathematical algorithms and other meta-heuristic algorithms, this algorithm exhibits superior robustness and localization accuracy across various simulation scenarios.
Although numerous metaheuristic algorithms have been proposed in recent decades, not all algorithms exhibit sufficient adaptability and scalability for complex optimization tasks such as multilevel image segmentation. Compared with many conventional metaphor-based optimizers that rely on relatively simple update mechanisms, the Secretary Bird Optimization Algorithm (SBOA) possesses a distinctive multi-stage search framework inspired by prey searching, exhausting, attacking, and escape behaviors. These mechanisms naturally correspond to different optimization phases, including global exploration, transition search, local exploitation, and diversity maintenance. Such characteristics provide SBOA with stronger behavioral interpretability and greater flexibility for balancing exploration and exploitation.
In addition, SBOA is a recently developed optimization algorithm with considerable research potential. Although it has demonstrated promising performance in several engineering optimization tasks, its search mechanism still suffers from several limitations, including insufficient population diversity, weak local exploitation ability, and premature convergence when solving high-dimensional multimodal problems. These shortcomings become particularly significant in multilevel threshold image segmentation problems, where the search space is highly nonlinear, strongly coupled, and contains numerous local optima.
Therefore, SBOA provides a meaningful and extensible optimization framework for further investigation. Motivated by its unique staged-search mechanism and existing limitations, this study develops an enhanced SBOA to improve population diversity, strengthen exploration–exploitation balance, and enhance convergence robustness for complex numerical optimization and artistic image segmentation tasks.
However, according to the No Free Lunch Theorem, no single optimization algorithm can consistently maintain optimal performance across all optimization problems. In other words, the fact that an algorithm performs exceptionally well on certain problems does not guarantee that it will possess a similar advantage on others. Different optimization problems often feature distinct search space structures, variable dimensions, constraints, and objective function characteristics; consequently, they necessitate the adoption of search mechanisms and update strategies that are specifically tailored to the problem’s unique properties. Complex numerical optimization and artistic image segmentation problems, in particular, are frequently characterized by high dimensionality, multi-modality, non-linearity, and a susceptibility to becoming trapped in local optima; under such conditions, relying solely on the singular search mechanism of a standard algorithm makes it difficult to simultaneously balance global exploration capabilities with local exploitation capabilities. Therefore, building upon the SBOA framework, this paper introduces a suite of enhancement strategies designed to boost population diversity and strengthen the algorithm’s ability to escape local optima. By further improving its convergence speed, optimization accuracy, and robustness, these enhancements render the algorithm more effectively suited for addressing image segmentation problems. The specific contributions of this paper are as follows:
  • A chaotic elite initialization strategy is proposed to improve the quality of the initial population. By combining Tent chaotic mapping with elite-guided population reconstruction, the proposed strategy enhances the uniformity and diversity of the population distribution, thereby improving the algorithm’s ability to locate promising regions in the early search stage.
  • An adaptive spiral Lévy flight strategy is introduced to strengthen the balance between global exploration and local exploitation. By integrating spiral motion with adaptive Lévy flight, the proposed strategy enables the algorithm to maintain wide-range exploration in the early stage and fine local search in the later stage, thereby improving its ability to escape local optima.
  • A dynamic neighborhood-guided mutation strategy is developed to alleviate the problem of premature convergence. By dynamically adjusting the neighborhood radius and combining neighborhood learning with global-best guidance, the proposed strategy effectively maintains population diversity and enhances convergence accuracy in the later search stage.
  • Extensive numerical optimization experiments are conducted on the IEEE CEC2014, CEC2017, and CEC2020 benchmark suites to evaluate the performance of MISBOA. The experimental results demonstrate that MISBOA achieves superior convergence speed, optimization accuracy, and robustness compared with several state-of-the-art metaheuristic algorithms.
  • MISBOA is successfully applied to Otsu-based multilevel threshold image segmentation. Experimental results on multiple benchmark images, evaluated by PSNR, FSIM, SSIM, and visual quality, verify that the proposed algorithm can generate more accurate and stable segmentation results for complex artistic images.
The remainder of this paper is organized as follows. Section 2 introduces the original Secretary Bird Optimization Algorithm and describes the improvement strategies incorporated into the proposed MISBOA in detail. Section 3 presents a comprehensive experimental evaluation of MISBOA on a series of benchmark functions for numerical optimization, demonstrating its effectiveness and robustness. Section 4 applies the proposed MIGSEA to artistic image segmentation tasks and assesses its performance through Peak Signal-to-Noise Ratio, Structural Similarity Index Measure, Feature Similarity Index, and visual quality comparisons. Finally, Section 5 summarizes the main conclusions of this study and discusses potential directions for future research.

2. Multi-Strategy Improved SBOA

The Secretary Bird Optimization Algorithm is a recently proposed swarm intelligence optimization method inspired by the hunting behavior of secretary birds in nature. By simulating different stages of prey searching, chasing, attacking, and escaping, SBOA is able to balance global exploration and local exploitation during the optimization process. Owing to its simple structure, few control parameters, and strong search capability, SBOA has shown promising performance in solving a variety of continuous optimization problems. However, when dealing with complex high-dimensional problems, SBOA may still suffer from insufficient population diversity, weak local exploitation ability, and premature convergence, which can limit its optimization accuracy and robustness.
To address these shortcomings, this section first provides a brief introduction to the original SBOA framework and its mathematical model. Subsequently, three effective improvement strategies are proposed to enhance the exploration capability, exploitation performance, and convergence accuracy of the algorithm. By integrating these strategies into the original SBOA, the proposed MISBOA is expected to achieve better optimization performance and stronger adaptability when solving numerical optimization and artistic image segmentation problems.

2.1. Secretary Bird Optimization Algorithm (SBOA)

The Secretary Bird Optimization Algorithm is a recently proposed swarm intelligence optimization algorithm inspired by the hunting and escape behaviors of secretary birds in nature. Secretary birds are well known for their ability to hunt snakes in grasslands. During hunting, they first search for prey over a wide range, then continuously circle around the prey to weaken its resistance, and finally launch a rapid and accurate attack. In addition, when facing predators, secretary birds can either camouflage themselves using the surrounding environment or quickly escape by running or flying. Based on these biological behaviors, SBOA divides the optimization process into two stages: hunting strategy and escape strategy, corresponding to the exploration and exploitation phases of the algorithm, respectively.
Assume that the population size is N , and the dimensionality of the optimization problem is d i m . In SBOA, each secretary bird represents a candidate solution, and the population can be represented as:
X = x 1,1 x 1,2 x 1 , D i m x 2,1 x 2,2 x 2 , D i m x N , 1 x N , 2 x N , D i m
where x i , j represents the value of the j -th dimension of the i -th secretary bird. The position of each individual is randomly initialized within the feasible search space as follows:
x i , j = l b j + r × ( u b j l b j )
where l b j and u b j denote the lower and upper bounds of the j -th dimension, respectively, and r [ 0,1 ] is a random number. After initialization, the fitness values of all individuals are calculated according to the objective function:
F = F ( X 1 ) F ( X 2 ) F ( X N )
where F ( X i ) denotes the fitness value of the i -th individual. In minimization problems, the individual with the smallest fitness value is considered the current best solution.
The search process of SBOA mainly consists of two phases. The first phase is the hunting stage, which is responsible for enhancing the exploration capability of the algorithm. The second phase is the escape stage, which focuses on improving the local exploitation ability and accelerating convergence. By combining these two stages, SBOA attempts to achieve a balance between global exploration and local exploitation.

2.1.1. Hunting Strategy of Secretary Bird

The hunting behavior of secretary birds is divided into three stages: searching for prey, exhausting prey, and attacking prey. These three stages correspond to different search mechanisms in SBOA.
In the first stage, secretary birds search for prey over a wide area. This stage mainly occurs in the early iterations of the algorithm, where population diversity and global exploration are important. To simulate this process, SBOA updates the position of each individual according to the difference between two randomly selected individuals:
x i , j n e w = x i , j + ( x r 1 , j x r 2 , j ) × R 1
where x r 1 , j and x r 2 , j are two randomly selected candidate solutions, and R 1 is a random vector in [ 0,1 ] . By using the positional difference between individuals, the algorithm can effectively expand the search range and avoid premature convergence. This mechanism improves the diversity of the population and enhances the global search ability of SBOA.
In the second stage, once the prey is found, secretary birds continuously move around it and provoke it in order to consume its energy. To model this behavior, SBOA combines Brownian motion with the current best solution:
x i , j n e w = x b e s t , j + e ( t / T ) 4 × ( R B 0.5 ) × ( x b e s t , j x i , j )
where x b e s t , j is the best position found so far, R B denotes Brownian motion, t is the current iteration number, and T is the maximum number of iterations. Brownian motion introduces random local perturbations, enabling the algorithm to search around the best solution more effectively. At the same time, the exponential term dynamically adjusts the search range during the optimization process. This stage strengthens the exploitation ability of the algorithm near promising regions and improves convergence speed.
In the third stage, when the prey becomes weak, secretary birds launch a rapid and accurate attack. SBOA models this process by introducing Lévy flight:
x i , j n e w = x b e s t , j + 1 t T 2 t T x i , j × R L
where R L denotes the weighted Lévy flight step size. Lévy flight is characterized by frequent short-distance movements and occasional long-distance jumps. Therefore, it allows the algorithm to perform local fine search while still maintaining the ability to jump out of local optima. In addition, the nonlinear weight factor dynamically adjusts the influence of Lévy flight according to the iteration process, helping the algorithm achieve a better balance between exploration and exploitation.

2.1.2. Escape Strategy of Secretary Bird

When secretary birds encounter predators, they typically adopt two different escape behaviors. One is to camouflage themselves in the surrounding environment, while the other is to rapidly escape by running or flying. In SBOA, these two behaviors are modeled as:
x i , j n e w = x b e s t , j + ( 2 × R B 1 ) × 1 t T 2 × x i , j ,   r i < 0.5 x i , j + R 2 × ( x r a n d o m , j K × x i , j ) ,   otherwise
where R 2 is a random vector, x r a n d o m , j is a randomly selected solution, and K is a random integer equal to 1 or 2. In the first case, the individual moves toward the vicinity of the current best solution, which helps the algorithm exploit promising regions. In the second case, the individual updates its position according to a randomly selected solution, which enhances the diversity of the population and helps the algorithm avoid local optima. By alternately applying these two strategies, SBOA is able to maintain a dynamic balance between local search and global exploration, thereby improving its convergence accuracy and robustness. The pseudocode of the SBOA is outlined in Algorithm 1.
Algorithm 1: the pseudo-code of the SBOA
1: Initialize the population X i   ( i   =   1 ,   2 ,     ,   N )
2: Evaluate the fitness of all individuals
3: Determine the current best solution X b e s t
4: For t   =   1   :   T   do
5: For   i   =   1   :   N do
6 : if   t   <   1 / 3   T then
7 : Update   X i using the prey-searching strategy
8 : else   if   1 / 3   T     t   <   2 / 3   T then
9 : Update   X i using the prey-exhausting strategy
10:  else
11 : Update   X i using the prey-attacking strategy
12:  end if
13:  if r a n d   <   0.5 then
14 : Update   X i using the camouflage strategy
15:  else
16 : Update   X i using the escape strategy
17:  end if
18:  Evaluate the new fitness of X i
19: End For
20: Update the current best solution X b e s t
21: End For
22: Return X b e s t

2.2. Proposed MISBOA

It should be noted that the three proposed enhancement strategies are not directly derived from additional biological behaviors of secretary birds. Instead, they are algorithm-oriented improvement mechanisms designed according to the optimization characteristics and structural limitations of the original SBOA framework. The motivation of these strategies mainly comes from improving population diversity, strengthening the balance between global exploration and local exploitation, and alleviating premature convergence in complex optimization problems. Therefore, the proposed strategies should be regarded as computational enhancement mechanisms integrated into the SBOA framework, rather than newly introduced biological metaphors. Nevertheless, these strategies remain compatible with the staged-search structure of SBOA and further strengthen its optimization capability in different search phases.
The three proposed strategies were not introduced as arbitrary combinations of existing techniques, but were specifically designed to address different structural limitations of the original SBOA. In the original SBOA, the prey-searching stage mainly relies on randomly selected individuals, which may lead to insufficient population diversity and uneven search-space coverage during the early optimization stage. Therefore, the chaotic elite initialization strategy was introduced to improve the uniformity and quality of the initial population distribution.
In addition, although the original SBOA employs Lévy flight during the prey-attacking stage, its search trajectory remains relatively simple and lacks adaptive local refinement capability. To strengthen the transition from global exploration to local exploitation, the adaptive spiral Lévy flight strategy was incorporated to generate more flexible search trajectories and enhance exploitation around promising regions.
Furthermore, the original escape mechanism of SBOA mainly depends on random perturbation and best-solution guidance, which may gradually reduce population diversity in the later search stage and increase the risk of premature convergence. To alleviate this issue, the dynamic neighborhood-guided mutation strategy was developed to maintain cooperative information exchange among neighboring individuals while gradually enhancing convergence toward elite solutions.
Therefore, the three strategies are functionally complementary and correspond to different optimization stages of SBOA, rather than being simple combinations of generic metaheuristic operators.

2.2.1. Chaotic Elite Initialization Strategy

In the original SBOA, the population is randomly initialized, which may lead to an uneven distribution of individuals and insufficient diversity in the early stage. This problem becomes more severe in multilevel threshold image segmentation because the threshold search space is very large and contains many local optima. To improve the quality of the initial population, a chaotic elite initialization strategy is introduced.
First, the Tent chaotic map is used to generate a uniformly distributed chaotic sequence:
z k + 1 = z k μ ,   z k < μ 1 z k 1 μ ,   z k μ
where z k [ 0,1 ] is the chaotic variable, and μ is the control parameter. In this paper, μ = 0.6 , since this value provides better randomness and ergodicity. Then, the chaotic sequence is mapped into the search space:
x i , j = l b j + z i , j × ( u b j l b j )
After initialization, the fitness values of all individuals are calculated, and the top 20 % of individuals are selected as elite individuals. The remaining individuals are regenerated around these elite solutions:
x i , j n e w = x e l i t e , j + λ × ( x r 1 , j x r 2 , j )
where x e l i t e , j is the position of an elite individual, x r 1 , j and x r 2 , j are two randomly selected individuals, and λ is the perturbation coefficient. In this study, λ = 0.3 .
Through this strategy, the population distribution becomes more uniform and diverse, which helps the algorithm locate promising regions in the early stage and improves the segmentation quality of complex artistic images. Figure 1 illustrates a schematic diagram of the Chaotic Elite Initialization Strategy.

2.2.2. Adaptive Spiral Lévy Flight Strategy

In the original SBOA, Lévy flight is only used in the attacking stage, and its search pattern is relatively simple. However, for artistic image segmentation problems, especially multilevel threshold segmentation, the search process often requires both global jumps and fine local adjustment. Therefore, an adaptive spiral Lévy flight strategy is proposed to strengthen the balance between exploration and exploitation.
The position update rule is defined as:
x i , j n e w = x b e s t , j + A e b θ c o s ( 2 π θ ) ( x b e s t , j x i , j ) + L L e v y ( D )
where A is the adaptive weight factor, b is the spiral shape coefficient, θ [ 0,1 ] is a random number, and L is the adaptive Lévy flight coefficient. The adaptive weight factor is defined as:
A = 2 1 t T
The adaptive Lévy coefficient is defined as:
L = 0.5 1 t T + 0.1
In this paper, the spiral coefficient is set as b = 1 . In the early stage, larger values of A and L help the algorithm perform wide-range global exploration, while in the later stage, smaller values allow the algorithm to focus on local refinement. Compared with the original Lévy flight mechanism, the proposed strategy can generate more flexible search trajectories and improve the ability of the algorithm to jump out of local optima. Figure 2 illustrates a schematic diagram of the Adaptive Spiral Lévy Flight Strategy.

2.2.3. Dynamic Neighborhood-Guided Mutation Strategy

When solving high-dimensional image segmentation problems, the original SBOA may easily lose population diversity in the later stage, causing premature convergence. To address this issue, a dynamic neighborhood-guided mutation strategy is proposed.
First, the neighborhood radius is defined as:
R ( t ) = R m a x 1 t T
where R m a x is the maximum neighborhood radius. In this paper, R m a x = 0.5 × ( u b l b ) . For each individual, neighboring individuals within radius R ( t ) are selected, and the local neighborhood center is calculated as:
X c e n t e r = 1 M k = 1 M X k
where M is the number of neighboring individuals. Then, the mutation strategy is performed as:
X i n e w = X i + α ( X c e n t e r X i ) + β ( X b e s t X i )
where α and β are two adaptive coefficients:
α = 0.5 1 t T , β = 0.5 t T
At the beginning of the search, a larger α helps individuals learn more from their neighbors and maintain population diversity. In the later stage, a larger β makes individuals move closer to the global best solution, thereby improving convergence accuracy.
This strategy allows the algorithm to dynamically adjust the influence of neighboring individuals and elite individuals during the search process, which is especially beneficial for artistic image segmentation tasks with many thresholds and complex texture distributions. Figure 3 illustrates a schematic diagram of the Dynamic Neighborhood-Guided Mutation Strategy. Algorithm 2 shows the pseudocode for MISBOA. Figure 4 shows the execution flowchart of MISBOA.
Algorithm 2: the pseudo-code of the MISBOA
1:  Initialize Problem Setting ( D i m ,   u b ,   l b , Pop_size (N), Max_Iter (T), Current_Iter (t))
2:  Initialize the population using Tent chaotic mapping
3:  Evaluate the fitness of all Secretary Birds
4:  Select elite individuals and reconstruct the population
5:  Update Secretary Bird X b e s t
6:  For t   =   1   :   T
7:  For i   =   1   :   N
8:   Exploration:
9:   if t   <   1 / 3   T
10:    Calculate new status of the i -th Secretary Bird using prey-searching strategy
11:    Update the i -th Secretary Bird
12:   else if 1 / 3   T   <   t   <   2 / 3   T
13:    Calculate new status of the i -th Secretary Bird using prey-exhausting strategy
14:    Update the i -th Secretary Bird
15:   else
16:    Calculate new status of the i -th Secretary Bird using adaptive spiral Lévy flight strategy
17:    Update the i -th Secretary Bird
18:   end if
19:   Exploitation:
20:   if r   <   0.5
21:    Calculate new status of the i -th Secretary Bird using camouflage strategy
22:   else
23:    Calculate new status of the i -th Secretary Bird using escape strategy
24:   end if
25:   Dynamic neighborhood-guided mutation:
26:   Calculate the dynamic neighborhood radius R ( t )
27:   Find neighboring individuals of the i -th Secretary Bird
28:   Calculate the neighborhood center X c e n t e r
29:   Update the i -th Secretary Bird using neighborhood-guided mutation
30:   Apply boundary control
31:   Evaluate the fitness of the i -th Secretary Bird
32:  end for i   =   1   :   N
33:  Save best candidate solution so far
34:  end for t   =   1   :   T
35:  Output: The best solution obtained by MISBOA for given optimization problem
36:  Return best solution

2.3. Time Complexity Analysis of MISBOA

The computational complexity of an optimization algorithm is an important indicator for evaluating its efficiency and scalability. As per the original SBOA, let N denote the population size, D i m represent the problem dimension, and T be the maximum number of iterations. The time complexity of SBOA mainly consists of population initialization, fitness evaluation, and position updating. Therefore, the overall time complexity of SBOA can be expressed as O ( N × ( T × D i m + 1 ) ) , which is dominated by the iterative update and fitness calculation processes.
For the proposed MISBOA, three additional strategies are incorporated into the original SBOA framework, namely the chaotic elite initialization strategy, the adaptive spiral Lévy flight strategy, and the dynamic neighborhood-guided mutation strategy. As a result, its computational complexity should be analyzed by considering both the original SBOA operations and the extra cost introduced by these enhancement mechanisms.
First, in the chaotic elite initialization strategy, the Tent chaotic mapping is used to generate the initial population, and then the elite individuals are selected to guide the regeneration of the remaining individuals. The generation of chaotic sequences requires traversing all individuals and dimensions once, resulting in a complexity of O ( N × D i m ) . The elite selection operation usually requires sorting or ranking the population according to fitness values, whose complexity is O ( N l o g N ) . Since initialization is performed only once before the main iteration process, the total additional complexity introduced by this strategy is O ( N × D i m + N l o g N ) .
Second, in the adaptive spiral Lévy flight strategy, the position of each individual is updated using spiral motion and Lévy flight during the iterative process. Since the update is carried out for each individual in each dimension at every iteration, the additional computational cost of this strategy is O ( T × N × D i m ) . It should be noted that Lévy flight itself is essentially a vector generation and scaling operation, so it does not change the order of complexity, but only increases the constant computational overhead.
Third, in the dynamic neighborhood-guided mutation strategy, each individual needs to calculate its neighborhood information and update its position accordingly. If the neighborhood center is estimated by scanning neighboring individuals, the worst-case computational cost for one iteration is O ( N 2 × D i m ) , because each individual may need to compare itself with all other individuals. Thus, over the whole optimization process, the complexity introduced by this strategy is O ( T × N 2 × D i m ) . This term becomes the dominant part of the overall time complexity of MISBOA. Therefore, the total time complexity of MISBOA can be expressed as O ( N × D i m + N l o g N ) + O ( T × N × D i m ) + O ( T × N × N × D i m ) , which can be further simplified as O ( T × N 2 × D i m ) . because the term O ( T × N 2 × D i m ) dominates the remaining lower-order terms.
Compared with the original SBOA, whose complexity is O ( N × ( T × D i m + 1 ) ) , the proposed MISBOA has a higher computational complexity. The main reason is that the added dynamic neighborhood-guided mutation strategy introduces pairwise neighborhood interactions among individuals, which increases the complexity from approximately linear dependence on N to quadratic dependence on N . In other words, SBOA mainly performs individual-level position updates, while MISBOA further considers neighborhood-level cooperative mutation, leading to a greater computational burden.
Nevertheless, although MISBOA requires more computation time than SBOA, this increase is acceptable for two reasons. On the one hand, in practical optimization problems such as multilevel artistic image segmentation, the population size is usually set to a moderate value, so the quadratic term does not become prohibitively expensive. On the other hand, the three proposed strategies significantly enhance population diversity, strengthen the balance between exploration and exploitation, and improve the ability of the algorithm to escape local optima. Therefore, the additional computational cost is exchanged for better optimization accuracy, stronger robustness, and higher segmentation quality, which is worthwhile in complex image segmentation tasks.

3. Analysis of Numerical Optimization Experiments

This section presents a comprehensive numerical evaluation of the proposed MISBOA on the IEEE CEC2014 [29], IEEE CEC2017 [30], and CEC2020 benchmark suites [31]. First, a brief introduction to the characteristics of the three benchmark sets is provided. Then, the experimental settings are described in detail to ensure the reproducibility of the results. Subsequently, MISBOA is compared with nine representative optimization algorithms on all benchmark functions.
To guarantee a fair comparison and reduce the influence of randomness, all algorithms were tested under the same conditions, with a population size of 50 and a maximum number of 1000 iterations. Each algorithm was independently executed 30 times, and the experimental performance was assessed in terms of the mean and standard deviation of the obtained results. All experiments in this section were implemented on the MATLAB 2023a platform.

3.1. Numerical Optimization Test Set

The IEEE CEC2014, CEC2017, and CEC2020 test sets, all released by the IEEE Congress on Evolutionary Computation, constitute some of the most widely used standard benchmark sets for validating the performance of heuristic optimization algorithms. These test sets comprise a large collection of optimization functions exhibiting diverse characteristics, enabling a comprehensive evaluation of an algorithm’s search capability, convergence speed, stability, and global optimization ability when solving complex optimization problems.
Specifically, the CEC2014 test suite primarily comprises various problem types, including unimodal functions, multimodal functions, hybrid functions, and composite functions. Unimodal functions are typically employed to assess an algorithm’s local exploitation capabilities, whereas multimodal functions serve to evaluate its ability to escape local optima; hybrid and composite functions further heighten problem complexity, thereby enabling the assessment of an algorithm’s comprehensive performance within complex search spaces.
In comparison, the CEC2017 test suite features a more complex functional structure, incorporating a greater number of high-dimensional optimization problems characterized by rotation, translation, and non-separability; consequently, it imposes more stringent demands on an algorithm’s global exploration capabilities and robustness. This test suite is generally regarded as more challenging than CEC2014, as it is capable of more comprehensively reflecting the performance disparities among different algorithms.
The CEC2020 test suite further increases the proportion of complex hybrid and composite functions, while placing greater emphasis on the capability to solve high-dimensional, complex problems characterized by multiple local optima. Given its more intricate function landscapes and stronger coupling relationships among variables, it is frequently employed to validate the adaptability and generalization capabilities of novel, improved algorithms within complex optimization environments.
Overall, the CEC2014, CEC2017, and CEC2020 test suites encompass a wide range of optimization scenarios—spanning from simple to complex, low-dimensional to high-dimensional, and unimodal to complex combinatorial problems—and are therefore widely utilized for the performance validation and comparative analysis of heuristic algorithms, meta-heuristic algorithms, and swarm intelligence optimization algorithms.

3.2. Competitor Algorithms and Parameters Setting

To validate the performance of MISBOA, numerical optimization experiments are conducted in this subsection to analyze and compare it with nine other novel heuristic algorithms. The selected algorithms include the Bounty Hunter Optimizer (BHO), Newton Downhill Optimizer (NDO), Gekko Japonicus Algorithm (GJA), Stochastic social learning optimization (SSLO), LangEvin Equation (LEE), Snow Ablation Optimizer (SAO), Red-billed Blue Magpie Optimizer (RBMO), Escape Algorithm (ESC), and the standard Secretary bird optimization algorithm (SBOA). In the comparative experiments, the parameter settings of all algorithms were determined according to their original references. For clarity, Table 1 lists the detailed parameter configurations of each algorithm together with the corresponding references for further consultation.

3.3. Analysis of Numerical Optimization Experimental Results

3.3.1. Performance Comparison on the IEEE CEC2014 Benchmark Functions

In this section, the numerical optimization performance of MISBOA is evaluated on the 30-dimensional functions of the CEC2014 benchmark suite. MISBOA is compared with nine representative state-of-the-art algorithms, and the corresponding optimization results are reported in Table 2. In the table, “Ave” and “Std” denote the mean and standard deviation of the results obtained from 30 independent runs, respectively. To further illustrate the search behavior of the compared algorithms, the convergence curves of the 10 algorithms are shown in Figure 5. In addition, Figure 6 presents the boxplot results of 30 independent runs for each algorithm, which are used to evaluate the robustness and stability of the algorithms while reducing the influence of random factors.
Figure 5 illustrates the convergence process of each algorithm on some functions of the CEC2014 test set. Overall, MISBOA exhibits a faster descent rate and better final convergence results on most test functions, indicating that it achieves a more effective balance between global search and local exploitation. Especially on functions such as F7, F14, and F20, MISBOA can rapidly reduce the objective function value in the early stages of iteration and maintain a relatively stable convergence trend in subsequent iterations, demonstrating strong search efficiency and stability. On relatively complex problems such as F8, F24, and F27, although some comparative algorithms can gradually approach the optimal region, MISBOA still demonstrates a faster convergence speed and stronger continuous optimization ability, obtaining higher-quality solutions with fewer iterations. In summary, Figure 5 fully illustrates that the proposed improvement strategy can effectively improve the algorithm’s optimization efficiency and enhance its ability to escape local optima, thus enabling MISBOA to exhibit superior convergence performance and competitive advantage on the CEC2014 benchmark functions.
Table 2 presents the mean and standard deviation results of each algorithm on the 30-dimensional CEC2014 benchmark functions. Overall, MISBOA achieves optimal or near-optimal results on most test functions, demonstrating strong optimization accuracy and stability. For unimodal functions such as F1–F4, MISBOA obtains significantly better average fitness values than the compared algorithms, indicating that the proposed improvement strategies effectively enhance local exploitation and convergence accuracy. For multimodal and hybrid functions such as F17, F18, F20, F21, and F22, MISBOA also shows strong global search ability, suggesting that it can better escape local optima and locate high-quality solutions. It is worth noting that on CEC2014-F23, MISBOA reaches the theoretical optimum value of 2500, with a standard deviation close to zero, while none of the other compared algorithms can achieve this result. This indicates that MISBOA not only finds the global optimum on this function but also maintains highly consistent performance across 30 independent runs. In addition, MISBOA exhibits relatively small standard deviations on many functions, further confirming its robustness and stability. Although MISBOA does not obtain the best results on a few functions, its overall performance remains highly competitive. Therefore, the results in Table 2 demonstrate that MISBOA has excellent convergence accuracy, global optimization capability, and robustness on the CEC2014 benchmark suite.
Figure 6 shows the box plot results of each algorithm on some functions of the CEC2014 test set, reflecting the distribution, stability, and resistance to random disturbances of different algorithms in 30 independent runs. Overall, MISBOA generally has a smaller box width, a better median position, and a shorter upper and lower bound, indicating that it maintains high consistency and stability across multiple independent runs. Particularly on functions F7, F14, F20, F24, and F30, MISBOA’s box plot distribution is more concentrated with fewer outliers, indicating that it not only obtains better solutions but also exhibits less fluctuation and strong robustness. In contrast, some of the compared algorithms have wider boxes and more outliers, indicating that these algorithms are susceptible to random initialization and local optima, leading to unstable results. Overall, Figure 6 further verifies the stability and reliability of MISBOA on the CEC2014 test set, demonstrating that the proposed improvement strategy can effectively improve the algorithm’s robustness and reduce the impact of random factors on the optimization results.

3.3.2. Performance Comparison on the IEEE CEC2017 Benchmark Functions

In this section, we evaluate the numerical optimization performance of MISBOA using the 30-dimensional and 100-dimensional functions from the CEC2017 benchmark suite. Specifically, MISBOA is compared against nine representative state-of-the-art algorithms, and the corresponding optimization results are presented in Table 3 and Table 4. In these tables, “Ave” and “Std” denote the mean and standard deviation, respectively, of the results obtained from 30 independent runs. To further elucidate the search behaviors of the compared algorithms, Figure 7 displays the convergence curves for these 10 algorithms. Furthermore, Figure 8 presents box plots of the results for each algorithm across the 30 independent runs; these results serve to assess the robustness and stability of the algorithms while simultaneously helping to mitigate the influence of stochastic factors.
Figure 7 shows the convergence curves of each algorithm on some functions of the CEC2017 test set. Overall, MISBOA exhibits faster convergence speed and better final convergence accuracy on most test functions, indicating that it can more effectively balance global search and local exploitation. In the early stages of iteration, MISBOA often rapidly reduces the objective function value and quickly enters the advantageous search region; in later iterations, its convergence curve continues to decline, unlike some of the comparative algorithms which plateau prematurely, demonstrating its strong ability to escape local optima and its continuous optimization capability. Especially on complex mixed and combined functions, MISBOA’s curve is usually below all other algorithms, and it can reach a better solution with fewer iterations, showing its higher search efficiency in handling high-dimensional, nonlinear, and multi-modal optimization problems. In contrast, while some of the comparative algorithms show a faster decline trend in the early stages, they are prone to getting trapped in local optima later, resulting in lower final convergence accuracy. Overall, Figure 7 fully illustrates that the chaotic elite initialization, adaptive spiral Lévy flight, and dynamic neighborhood-guided mutation strategies introduced by MISBOA can effectively enhance the algorithm’s exploration and development capabilities, thereby achieving better convergence performance on the CEC2017 test set.
Table 3 and Table 4 present the mean and standard deviation results of each algorithm on the 30-dimensional and 100-dimensional CEC2017 benchmark functions, respectively. Overall, MISBOA achieved optimal or near-optimal performance in both dimensional settings, demonstrating strong global search capability, local exploitation capability, and good dimensional adaptability. In the 30-dimensional test, MISBOA exhibited lower mean fitness values and smaller standard deviations on most unimodal, multimodal, mixed, and combined functions, indicating that it not only obtains higher-quality solutions but also achieves more stable results. As the problem dimension increased to 100 dimensions, the performance of most compared algorithms showed a significant decline, with increased mean values and greater volatility, indicating that they are more prone to getting trapped in local optima or premature convergence in high-dimensional complex problems. However, MISBOA still maintained superior solution results and a smaller standard deviation, continuing to outperform SBOA and other compared algorithms on most test functions, demonstrating strong robustness and scalability. This demonstrates that the proposed chaotic elite initialization strategy improves population diversity, the adaptive spiral Lévy flight strategy enhances global search capabilities, and the dynamic neighborhood-guided mutation strategy further improves the algorithm’s local exploitation capabilities in high-dimensional complex search spaces. Therefore, MISBOA’s superior performance on the 30-dimensional and 100-dimensional CEC2017 benchmark functions fully validates the effectiveness and generalization ability of the proposed improved strategy.
Figure 8 shows the box plot results of each algorithm on some functions of the CEC2017 test set, used to further evaluate the stability and robustness of different algorithms in 30 independent runs. As can be seen from the figure, MISBOA has a narrower overall box, a better median position, and a shorter upper and lower whisker range, indicating that it has smaller result fluctuations and higher consistency in multiple independent runs. Especially on some complex mixed and combined functions, the box plot distribution of MISBOA is more concentrated, with fewer outliers, indicating that it can maintain good stability in complex search environments and effectively reduce the impact of random factors on the optimization results. In contrast, although some of the compared algorithms can obtain good optimal values on a few functions, their boxes are wider, their upper and lower whiskers are longer, and they are accompanied by more outliers, indicating that the results of these algorithms fluctuate more and are easily affected by the initial population and local optima, resulting in relatively poor stability. Overall, Figure 8 further validates the robustness and reliability of MISBOA on the CEC2017 test set, demonstrating that the proposed improvement strategy not only enhances the algorithm’s optimization ability but also strengthens its stable performance in complex high-dimensional optimization problems.

3.3.3. Performance Comparison on the IEEE CEC2020 Benchmark Functions

In this section, we evaluate the numerical optimization performance of MISBOA based on the 10-dimensional and 20-dimensional functions of the CEC2020 benchmark test suite. Specifically, MISBOA is compared against nine representative state-of-the-art algorithms, and the corresponding optimization results are presented in Table 5 and Table 6. In these tables, “Ave” and “Std” denote the mean and standard deviation, respectively, of the results obtained from 30 independent runs. To further elucidate the search behaviors of the compared algorithms, Figure 9 displays the convergence curves for these 10 algorithms. Furthermore, Figure 10 presents the box plots of the results for each algorithm across the 30 independent runs; these results serve to assess the robustness and stability of the algorithms while helping to mitigate the influence of stochastic factors.
Figure 9 shows the convergence curves of various algorithms on some functions of the CEC2020 test set. Overall, MISBOA exhibits faster convergence speed and better final optimization results on most functions. Especially on complex mixed and combined functions, MISBOA can rapidly reduce the objective function value in the early stages of iteration and maintain a downward trend in subsequent iterations, indicating its strong global search and local optimization capabilities. In contrast, some of the compared algorithms, while converging quickly in the early stages, tend to stagnate in the middle and later stages, making it difficult to further approach the global optimum; others show a slower rate of decrease throughout the optimization process, indicating a strong local optimum trap in complex high-dimensional search spaces. MISBOA’s convergence curve is generally lower than other algorithms and can obtain better solutions with fewer iterations, demonstrating its higher search efficiency and stronger continuous optimization capability. In summary, Figure 9 illustrates that the proposed chaotic elite initialization, adaptive spiral Lévy flight, and dynamic neighborhood-guided mutation strategies can effectively enhance the algorithm’s exploration and development capabilities on complex test functions of CEC2020, thereby enabling MISBOA to achieve better convergence performance and higher optimization accuracy.
Figure 10 shows the box plot results of each algorithm on some functions of the CEC2020 test set, used to further evaluate the stability and robustness of different algorithms in multiple independent runs. As can be seen from the figure, MISBOA has narrower box sizes, lower medians, and shorter upper and lower bounds on most test functions, indicating that it maintains high consistency and small result fluctuations in 30 independent runs. Especially on complex mixed and combined functions, MISBOA has fewer outliers and a more concentrated box distribution, indicating that it can effectively reduce the impact of random initialization and complex search spaces on the optimization results, thus achieving more stable performance. In contrast, while some of the compared algorithms achieve better results on a few functions, their box sizes are wider and have more outliers, indicating that these algorithms are easily affected by random factors and have relatively poor stability. Overall, Figure 10 further verifies the robustness and reliability of MISBOA on the CEC2020 test set, demonstrating that the proposed improvement strategies can not only improve the convergence accuracy of the algorithms but also enhance their stability in complex high-dimensional optimization problems.
Table 5 and Table 6 present the mean and standard deviation results of each algorithm on the 10-dimensional and 20-dimensional CEC2020 benchmark functions, respectively. Overall, MISBOA achieved optimal or near-optimal performance in both dimensional settings, demonstrating strong search capabilities and good dimensionality adaptability. In the 10-dimensional test, MISBOA exhibited lower mean fitness values and smaller standard deviations on most functions, indicating that it not only obtains better solutions but also possesses high stability and robustness. As the problem dimension increased to 20 dimensions, the performance of most compared algorithms decreased to varying degrees, manifested as increased mean values, wider fluctuation ranges, and significantly increased standard deviations. This suggests that these algorithms are more prone to getting trapped in local optima in more complex search spaces. However, MISBOA still maintained superior solution accuracy and a small standard deviation on most test functions, demonstrating strong global search capabilities and stability in high-dimensional complex problems. Compared to the standard SBOA, MISBOA demonstrates significant improvements on most functions, further proving that the chaotic elite initialization strategy, the adaptive spiral Lévy flight strategy, and the dynamic neighborhood-guided mutation strategy play a positive role in enhancing population diversity, balancing exploration and exploitation, and improving local search accuracy. Therefore, the experimental results of MISBOA on the 10-dimensional and 20-dimensional CEC2020 benchmark functions fully validate its excellent optimization performance and good generalization ability.

3.4. Statistical Analysis of Algorithm Performance

Statistical analysis plays a crucial role in evaluating the performance of heuristic and meta-heuristic algorithms. Given that such algorithms typically involve random initialization and stochastic search mechanisms, the results obtained from a single run may not accurately reflect their true optimization capabilities. Consequently, relying solely on the best or average results is often insufficient to provide a fair and reliable comparison. Statistical analysis effectively mitigates the influence of randomness and reveals whether the observed performance differences between algorithms are statistically significant and robust. Furthermore, statistical methods offer deeper insights into an algorithm’s robustness, consistency, and overall superiority across various benchmark problems. Therefore, incorporating statistical analysis is indispensable for conducting a comprehensive and compelling evaluation of heuristic algorithms. In this subsection, we subjected the proposed MISBOA to the Wilcoxon signed-rank test and the Friedman Mean Rank Test; the specific details are presented below.

3.4.1. Wilcoxon Signed-Rank Test

In the performance evaluation of heuristic algorithms, relying solely on mean values, standard deviations, or convergence curves often proves insufficient to comprehensively reflect the true differences between algorithms; this is because heuristic algorithms exhibit significant stochasticity, leading to potentially substantial fluctuations across different independent runs [40]. Consequently, it is essential to incorporate statistical methods to further validate experimental results. As a non-parametric statistical test, the Wilcoxon signed-rank test does not require data to follow a normal distribution, making it particularly well-suited for comparing the performance of heuristic algorithms across multiple independent runs. By conducting a significance analysis on the performance differences between two algorithms across various test functions, one can effectively determine whether any observed performance improvement is statistically significant rather than merely attributable to random factors. Furthermore, the Wilcoxon signed-rank test provides an intuitive visualization of the extent of the improved algorithm’s superiority over its counterparts through W/T/L (Win/Tie/Loss) results; as such, this test has emerged as a crucial tool for assessing the reliability and superiority of heuristic optimization algorithms. In this section, we performed the Wilcoxon signed-rank test on the MISBOA at a significance level ( α = 0.05 ); the experimental results are shown in Table 7.
Table 7 presents the W/T/L results—based on the Wilcoxon signed-rank test—comparing MISBOA against other benchmark algorithms. As indicated by the results, MISBOA demonstrates a distinct statistical advantage across various test sets and under different dimensionality conditions. On the CEC2014 (dim = 30) test set, MISBOA achieved a higher number of wins compared to the majority of the algorithms; for instance, its W/T/L scores against GJA and RBMO were 28/2/0 and 28/1/1, respectively. On the CEC2017 (dim = 30) test set, MISBOA’s superiority was even more pronounced, achieving a score of 30/0/0 against both NDO and SSLO, thereby indicating that it significantly outperformed these benchmark algorithms across all test functions. Even on the higher-dimensional CEC2017 (dim = 100) test set, MISBOA maintained a high winning ratio, achieving W/T/L scores of 28/0/2 against both NDO and SSLO, and 28/1/1 against ESC. Regarding the CEC2020 test set, MISBOA similarly exhibited significant advantages under both dim = 10 and dim = 20 conditions, with multiple comparative results reaching 10/0/0. Overall, MISBOA consistently yielded results significantly superior to those of the benchmark algorithms across the majority of test functions, demonstrating that the proposed multi-strategy improvement mechanism effectively enhances the algorithm’s global search capability, local exploitation capability, and overall stability.

3.4.2. Friedman Mean Rank Test

Since the performance of heuristic algorithms often varies significantly across different test functions, relying solely on the optimal values, mean values, or standard deviations obtained from a single function makes it difficult to comprehensively evaluate an algorithm’s overall performance [41]. Consequently, in scenarios involving multiple algorithms and multiple test problems, it is necessary to employ more comprehensive statistical analysis methods to facilitate a holistic comparison. The Friedman Mean Rank Test is a non-parametric statistical method well-suited for comparing multiple algorithms across multiple test functions; it evaluates the relative merits of algorithms from a global perspective by ranking their performance on each test function and subsequently calculating their average ranks. Compared to a mere comparison of numerical results, the Friedman Mean Rank Test effectively mitigates the impact of random fluctuations and isolated outliers, thereby providing a more objective reflection of an algorithm’s stability, robustness, and comprehensive optimization capabilities across diverse problems. As a result, this method has become a widely adopted and essential statistical tool in the performance analysis of heuristic algorithms. In this subsection, we subjected MISBOA to the Friedman Mean Rank Test; the experimental results are presented in the table below.
Table 8 presents the results of the Friedman Mean Rank Test for each algorithm across various test sets. As the results indicate, MISBOA achieved the lowest mean rank (M.R.) and the highest final rank (T.R.) across all test sets and under varying dimensional conditions, demonstrating its superior overall performance. In the CEC2014 (dim = 30) test set, MISBOA attained a mean rank of 2.00 and a final rank of 1st—significantly outperforming the other comparative algorithms—with BHO securing second place with a mean rank of 2.30. In the CEC2017 (dim = 30) and CEC2017 (dim = 100) test sets, MISBOA achieved mean ranks of 1.03 and 1.87, respectively, ranking 1st in both instances; this demonstrates that the algorithm maintains strong competitiveness in complex optimization problems of both medium and high dimensions. Notably, in the CEC2017 (dim = 30) test set, MISBOA’s mean rank approached the theoretical optimum of 1, indicating that it achieved the best results across the vast majority of the test functions. For the CEC2020 test set, MISBOA’s superiority was equally evident. Under the conditions of dim = 10 and dim = 20, its mean ranks were 1.30 and 1.20, respectively—firmly securing the first-place position in both cases—while the mean ranks of the other algorithms generally exceeded 2, with some even surpassing 7. This suggests that MISBOA not only possesses robust global search capabilities but also maintains stable optimization performance across test functions of varying dimensions and types. Overall, MISBOA achieved the best comprehensive ranking across all test sets, demonstrating that the proposed multi-strategy improvement mechanism effectively enhances the algorithm’s convergence performance, search precision, and stability, thereby enabling it to exhibit superior overall competitiveness across a wide range of complex optimization problems.

3.5. Comparison with CEC Competition Winners

Comparison with CEC competition winners is of great significance in the evaluation of metaheuristic optimization algorithms because the winning algorithms in CEC competitions usually represent the state-of-the-art optimization performance under standardized benchmark environments. These algorithms are typically developed through extensive research and rigorous experimental validation, exhibiting strong global search capability, convergence accuracy, and robustness on complex optimization problems. Therefore, comparing the proposed algorithm with CEC competition winners can provide a more convincing assessment of its optimization effectiveness and competitiveness. Moreover, such comparisons help demonstrate whether the proposed algorithm can maintain superior performance when facing highly competitive and challenging optimization scenarios. Motivated by this, this subsection conducts experimental comparisons between MISBOA and several representative CEC competition-winning algorithms to further verify the effectiveness, robustness, and competitiveness of the proposed method. The experimental results are shown below.
Figure 11 presents the convergence curve comparisons between MISBOA and several representative CEC competition-winning algorithms, including LSHADE, LSHADE-cnEpSin, and LSHADE-SPACMA, on selected CEC2017 benchmark functions with 30 dimensions. Overall, MISBOA demonstrates highly competitive convergence behavior and achieves superior optimization performance on most test functions. Specifically, on functions such as F5, F8, and F16, although MISBOA exhibits a relatively slower convergence rate during the early and middle stages of the iteration process, it maintains stronger continuous optimization capability in the later stages and ultimately obtains lower fitness values than the compared winner algorithms. This phenomenon indicates that the proposed strategies effectively enhance the algorithm’s ability to escape local optima and maintain population diversity during the later search stage. On more complex functions such as F20, F23, and F26, MISBOA not only converges steadily throughout the optimization process but also achieves the best final convergence accuracy among all compared algorithms. In particular, the convergence curves of MISBOA exhibit more stable descending trends and lower final fitness values, demonstrating its strong balance between global exploration and local exploitation. Overall, the experimental results in Figure 11 verify that MISBOA possesses strong competitiveness even when compared with highly advanced CEC competition-winning algorithms, thereby further confirming the effectiveness, robustness, and optimization capability of the proposed enhancement strategies.
Figure 12 presents the boxplot comparisons between MISBOA and several representative CEC competition-winning algorithms on selected CEC2017 benchmark functions with 30 dimensions. The boxplots are used to evaluate the distribution characteristics, robustness, and stability of the algorithms over 30 independent runs. Overall, MISBOA exhibits significantly superior distribution characteristics compared with the competing algorithms, demonstrating stronger robustness and more stable optimization performance. Specifically, on functions such as F11, F15, F21, and F29, MISBOA achieves lower median fitness values and narrower box ranges, indicating that the proposed algorithm can consistently obtain high-quality solutions with relatively small fluctuations across multiple independent runs. In addition, MISBOA generally produces fewer outliers and shorter upper and lower whiskers, which further demonstrates its strong resistance to random disturbances and its ability to maintain stable convergence behavior. Although on certain functions such as F4 the distribution range of MISBOA is relatively wider during some runs, its median fitness value still remains significantly better than those of the compared algorithms, indicating superior overall optimization capability. Particularly on F6, MISBOA shows an extremely concentrated distribution with almost negligible variance, demonstrating excellent convergence stability and reliability. Overall, the experimental results shown in Figure 12 further confirm that MISBOA not only achieves competitive convergence accuracy when compared with advanced CEC competition-winning algorithms, but also maintains strong robustness, stability, and consistency in repeated optimization experiments.
Table 9 presents the comparative experimental results between MISBOA and several representative CEC competition-winning algorithms on the 30-dimensional CEC2017 benchmark functions. The compared algorithms include LSHADE, LSHADE-SPACMA, and LSHADE-cnEpSin, which are widely recognized as highly competitive optimization algorithms in CEC competitions. Overall, MISBOA demonstrates highly competitive optimization performance and achieves superior or near-optimal results on most benchmark functions. Specifically, MISBOA obtains the best average fitness values on a large number of functions, including F1, F3, F4, F5, F6, F8, F9, F10, F11, F15, F16, F17, F20, F21, F22, F23, F24, F27, F28, F29, and F30, indicating its strong global optimization capability and convergence accuracy. Particularly on complex multimodal and hybrid functions such as F15, F20, F21, and F29, MISBOA exhibits significantly lower fitness values than the compared winner algorithms, demonstrating that the proposed strategies can effectively enhance exploration capability and improve the ability to escape local optima.
In addition, the standard deviation results further verify the robustness and stability of MISBOA. On many benchmark functions, MISBOA achieves relatively smaller standard deviation values, indicating that the proposed algorithm maintains stable optimization performance and strong resistance to random disturbances over 30 independent runs. Especially on functions such as F1, F6, F10, F15, and F29, MISBOA not only achieves the best average performance but also exhibits highly concentrated result distributions, demonstrating excellent convergence reliability and consistency. Although MISBOA does not achieve the absolute best performance on a few functions, its results remain highly competitive and generally close to those of the compared algorithms. Overall, the experimental results in Table 9 demonstrate that MISBOA possesses strong competitiveness even when compared with advanced CEC competition-winning algorithms, thereby further validating the effectiveness of the proposed enhancement strategies in improving convergence accuracy, robustness, and optimization capability on complex optimization problems.

3.6. Strategy Effectiveness Analysis

Strategy effectiveness analysis plays a crucial role in the evaluation of metaheuristic optimization algorithms because it can directly reveal the contribution of each improvement strategy to the overall optimization performance. Since many improved metaheuristic algorithms are constructed by integrating multiple enhancement mechanisms, merely reporting the final optimization results is often insufficient to fully demonstrate the effectiveness and rationality of the proposed strategies. Through strategy effectiveness analysis, it is possible to investigate whether each strategy can effectively improve specific optimization behaviors, such as population diversity maintenance, exploration capability, exploitation performance, convergence speed, and the ability to escape local optima. In addition, such analysis helps verify the complementarity and cooperative interaction among different strategies, thereby providing more convincing evidence for the effectiveness and necessity of the proposed improvements. Therefore, to comprehensively evaluate the contribution of each proposed strategy in MISBOA, this subsection conducts a detailed strategy effectiveness analysis experiment. Among them, SBOA1 indicates that the Chaotic Elite Initialization Strategy algorithm has been added to the SBOA, SBOA2 indicates that the Adaptive Spiral Lévy Flight Strategy algorithm has been added to the SBOA, and SBOA3 indicates that the Dynamic Neighborhood-Guided Mutation Strategy algorithm has been added to the SBOA.
Table 10 presents the strategy effectiveness analysis results of MISBOA on the CEC2014, CEC2017, and CEC2020 benchmark suites under different dimensional settings. The experimental results are evaluated using Mean Rank (M.R) and Total Rank (T.R), where lower values indicate better overall optimization performance. Overall, as more improvement strategies are incorporated into the original SBOA framework, the ranking performance of the algorithm consistently improves across all benchmark suites, demonstrating the effectiveness and complementarity of the proposed strategies.
Specifically, the original SBOA generally exhibits the worst ranking performance on most benchmark sets, indicating that the standard SBOA still suffers from limitations such as insufficient population diversity and weak balance between exploration and exploitation when solving complex optimization problems. After introducing the first improvement strategy, SBOA1 shows noticeable performance improvement on all test suites, suggesting that the proposed initialization enhancement mechanism can effectively improve the early-stage search capability and population quality. Subsequently, SBOA2 further improves the mean rank values, indicating that the adaptive spiral Lévy flight strategy effectively strengthens the transition between global exploration and local exploitation. Moreover, SBOA3 achieves additional ranking improvements compared with SBOA2, demonstrating that the dynamic neighborhood-guided mutation strategy can effectively alleviate premature convergence and enhance population diversity maintenance in the later search stage.
Finally, MISBOA consistently achieves the best Mean Rank and Total Rank values on all benchmark suites and dimensional settings, including CEC2014, CEC2017 (30D and 100D), and CEC2020 (10D and 20D). In particular, MISBOA obtains rank values close to 1 on almost all test sets, indicating that the complete integration of the three proposed strategies provides the strongest optimization capability and the most stable performance among all compared variants. Overall, the results in Table 10 clearly verify that each proposed strategy contributes positively to the optimization performance of MISBOA, while the cooperative interaction among the three strategies further enhances the convergence accuracy, robustness, and global optimization capability of the algorithm.

3.7. Parameter Sensitivity Analysis

Parameter sensitivity analysis plays a crucial role in the performance evaluation of metaheuristic optimization algorithms, as the optimization behavior of these algorithms is often heavily influenced by the choice of control parameters. Different parameter settings significantly affect the balance between global exploration and local exploitation, convergence speed, population diversity, and solution accuracy. Therefore, conducting parameter sensitivity analysis is essential for assessing the stability, robustness, and adaptability of the proposed algorithm under different parameter configurations. Furthermore, parameter sensitivity analysis helps reveal the impact of key parameters on the algorithm’s search dynamics and provides guidance for selecting appropriate parameter values in practical optimization problems. Moreover, it can further verify whether the proposed algorithm can maintain stable optimization performance under different parameter conditions, thereby enhancing the reliability and persuasiveness of the experimental results. Therefore, to comprehensively evaluate the robustness and parameter adaptability of MISBOA, this section will conduct detailed parameter sensitivity analysis experiments on several representative hyperparameters.
Figure 13 shows the parameter sensitivity analysis results of the MISBOA for several representative hyperparameters. Overall, MISBOA maintains relatively stable convergence behavior under different parameter configurations, indicating strong robustness and parameter adaptability. Specifically, different values of the control parameters have little impact on the convergence speed and final optimization accuracy of some benchmark functions; however, the overall convergence trend remains highly consistent. Among the tested parameter settings, moderate parameter values generally achieve better convergence performance and stability, reflecting a more balanced trade-off between global exploration and local exploitation. Furthermore, MISBOA maintains stable optimization capabilities under different parameter combinations, further validating the reliability and robustness of the proposed improvement strategy.

4. Multilevel Thresholding-Based Image Segmentation Model

In the context of multi-threshold image segmentation, the selection of thresholds directly impacts the effectiveness of distinguishing target regions from background regions. Common threshold selection methods primarily include Otsu’s method and Kapur’s entropy method. Specifically, Otsu’s method identifies the optimal threshold by maximizing the inter-class variance, whereas Kapur’s entropy method achieves image segmentation by maximizing the information entropy of each region. Given its advantages—including computational simplicity, robust stability, and sensitivity to grayscale distribution—this paper adopts Otsu’s method as the objective function for multi-threshold image segmentation [22,23].
Assuming that grayscale image I comprises a total of L grayscale levels, and the number of pixels corresponding to the i -th grayscale level is n i , then the total number of pixels in the image can be expressed as:
N = i = 0 L 1 n i ,
Accordingly, the probability of occurrence of the i -th grayscale level is:
P i = n i N , i = 0,1 , , L 1
where P i 0 , and satisfying i = 0 L 1 P i = 1 .
For single-threshold segmentation, when the gray value t is selected as the threshold, the image is divided into two parts: the target region and the background region. The gray value range [ 0 ,   t ] corresponds to the target region, and the gray value range [ t + 1 ,   L 1 ] corresponds to the background region. Let the probabilities of the two regions be ω 0 and ω 1 , and their average gray values be μ 0 and μ 1 , respectively. The average gray value of the entire image is μ . Then:
ω 0 = i = 0 t P i
μ 0 = i = 0 t i P i ω 0
ω 1 = i = t + 1 L 1 P i
μ 1 = i = t + 1 L 1 i P i ω 1
μ = i = 0 L 1 i P i
Based on this, the inter-class variance of single-threshold segmentation can be written as:
ν ( t ) = ω 0 ( μ 0 μ ) 2 + ω 1 ( μ 1 μ ) 2
For multi-threshold segmentation, if k thresholds t 1 , t 2 , , t k are set, the image will be divided into k + 1 gray-level regions. Correspondingly, the inter-class variance in the multi-threshold case can be further extended as follows:
ν ( t 1 , t 2 , , t k ) = j = 0 k ω j ( μ j μ ) 2
Wherein, the probability and average gray level of the j -th region are defined as follows:
ω j = i = t j + 1 t j + 1 P i
μ j = i = t j + 1 t j + 1 i P i ω j
Therefore, the multi-threshold image segmentation problem can be transformed into an optimization problem, namely, finding a set of optimal thresholds that maximizes the inter-class variance:
T b e s t = arg max ν ( t 1 , t 2 , , t k )
where T b e s t represents the optimal combination of thresholds.
To verify the effectiveness of the proposed algorithm in multi-threshold image segmentation, this paper selects 10 typical test images for experimental analysis, as shown in Figure 14, and conducts comparative tests using different threshold numbers. All algorithms are run independently 30 times under the same parameter conditions to ensure the fairness and reliability of the experimental results. Finally, the segmentation accuracy and stability of the algorithm are comprehensively evaluated using the mean and standard deviation of the objective function values.

4.1. Evaluation Metrics

To comprehensively evaluate the quality of image segmentation results, this paper uses Peak Signal-to-Noise Ratio (PSNR), Structural Similarity Index (SSIM), and Feature Similarity Index (FSIM) as evaluation metrics.
PSNR measures the degree of distortion between the original image and the segmented image; a higher value indicates higher image fidelity. The definition of PSNR is as follows:
P S N R = 10 l o g 10 ( 255 2 M S E ) ,
The mean squared error (MSE) can be expressed as:
M S E = 1 M N j = 1 M   k = 1 N [ I ( j , k ) I ( j , k ) ] 2 ,
where M × N represents the image size, and I and I represent the original image and the segmented image, respectively.
SSIM measures the similarity between two images in terms of brightness, contrast, and structural information. A value closer to 1 indicates a closer resemblance between the segmented image and the original image. The formula for calculating SSIM is:
S S I M ( I , I ) = ( 2 μ I μ I + C 1 ) ( 2 σ I I + C 2 ) ( μ I 2 + μ I 2 + C 1 ) ( σ I 2 + σ I 2 + C 2 ) ,
where μ I and μ I represent the average gray values of the two images, respectively, σ I 2 and σ I 2 represent variance, σ I I represents the covariance.
Unlike PSNR and SSIM, FSIM focuses more on edge, texture, and local feature information in an image, thus more effectively reflecting the preservation of image details. The expression for FSIM is:
F S I M ( I , I ) = x Ω S L ( x ) P C m ( x ) x Ω P C m ( x ) ,
where Ω represents the entire image region, S L ( x ) represents the local feature similarity at pixel x , and P C m ( x ) represents the phase consistency feature.
Overall, higher PSNR, SSIM, and FSIM values mean that the segmented image can better preserve the grayscale information, structural features, and details of the original image. Therefore, these metrics can comprehensively evaluate the performance of multi-threshold image segmentation algorithms.

4.2. MISBOA Analysis for Multilevel Threshold Segmentation Based on Otsu Criterion

This study applies the MISBOA to multilevel image thresholding and adopts the Otsu criterion as the objective function to search for the optimal threshold values for ten benchmark images. The segmentation performance of the proposed method is assessed by maximizing the Otsu objective function and further evaluated using three widely used image quality indicators, namely Peak Signal-to-Noise Ratio, Feature Similarity Index, and Structural Similarity Index. Larger values of these metrics indicate that the segmented image preserves more structural information, texture details, and visual quality from the original image. The experimental results are shown below.
Figure 15 shows the experimental results of MISBOA in the Otsu-based multi-threshold image segmentation task. As can be seen from the figure, with the increase in the number of thresholds, the target region, edge contours, and texture details in the image are gradually separated more clearly, indicating that MISBOA can effectively search for better threshold combinations, thereby improving segmentation quality. At lower threshold numbers, the segmentation results can already distinguish the foreground and background well and retain the main structural information of the image; as the number of thresholds further increases, the grayscale levels, local textures, and edge transitions in the image become richer and more natural, making the overall segmentation results more readable and visually continuous. For some test images with complex textures, uneven grayscale distribution, or blurred boundaries, MISBOA can still maintain the integrity of the target region well, reduce detail loss and over segmentation, demonstrating strong global search and local optimization capabilities. Overall, Figure 15 illustrates that MISBOA can obtain clear, stable, and visually high-quality segmentation results in the multi-threshold image segmentation task, verifying its effectiveness and practical value in complex image processing problems.
Table 11 presents the mean fitness (Ave) and standard deviation (Std) of different algorithms in the multi-threshold image segmentation task based on the Otsu objective function. Overall, the fitness values of each algorithm show an increasing trend with the increase in the number of thresholds, indicating that more thresholds can more fully exploit the gray-level distribution information in the image, thus achieving better segmentation results. However, compared with other comparative algorithms, MISBOA achieved a higher mean fitness value and a smaller standard deviation in most test images and under different threshold settings, indicating that it not only searches for better threshold combinations but also has better stability and consistency in multiple independent runs. Especially on images with complex textures, uneven gray-level distribution, and blurred edges, MISBOA’s advantage is more pronounced, with its Ave value significantly better than other algorithms, while its Std value remains at a low level. This shows that the proposed improvement strategy can effectively enhance population diversity, improve global search ability, and reduce the probability of the algorithm getting trapped in local optima. Overall, the experimental results in Table 11 fully demonstrate that MISBOA has higher optimization accuracy, stronger robustness, and better generalization ability in multi-threshold image segmentation tasks based on the Otsu objective function.
Table 12 presents the mean and standard deviation of PSNR for different algorithms on various test images in the Otsu multi-threshold segmentation task. Overall, the PSNR values of all algorithms generally improve with the increase in the number of thresholds, indicating that more thresholds can more fully preserve the grayscale information and detailed features in the original image, thereby reducing segmentation distortion. Compared to other comparison algorithms, MISBOA achieved higher PSNR values on most test images and under different threshold settings, with a smaller corresponding standard deviation, indicating that it can consistently obtain higher-quality segmentation results in multiple independent runs. Especially on images with complex textures, rich grayscale variations, and blurred edges, MISBOA’s advantages are more pronounced. Its higher PSNR value indicates that the segmented image better preserves the information of the original image, with lower pixel errors and less distortion. Meanwhile, the smaller Std value further demonstrates that MISBOA has good stability and robustness, and is not easily affected by random initialization and local optima. Overall, the results in Table 12 show that MISBOA achieves higher image reconstruction quality and better visual fidelity in Otsu-based multi-threshold image segmentation tasks.
Table 13 presents the mean and standard deviation of the FSIM scores for different algorithms on various test images in the Otsu multi-threshold image segmentation task. Overall, the FSIM scores of all algorithms generally improve with increasing threshold number, indicating that more thresholds better preserve edge, texture, and structural features in the image. Compared to other comparison algorithms, MISBOA achieved higher FSIM scores on most test images and under different threshold settings, with a smaller corresponding standard deviation. This suggests that it not only more effectively preserves important image features but also exhibits better stability and consistency in multiple independent runs. MISBOA’s advantage is particularly evident in images with rich textures, complex boundaries, and numerous details. Its higher FSIM score indicates that the segmentation results better preserve the edge contours, local textures, and visually salient features of the target region, making the segmented image more consistent with human visual perception. Meanwhile, the smaller standard deviation (Std) score further demonstrates that MISBOA performs more stably on complex images and is less susceptible to random factors. Overall, the experimental results in Table 13 show that MISBOA has stronger feature preservation capabilities and higher visual quality in Otsu-based multi-threshold image segmentation tasks.
Table 14 presents the mean and standard deviation of SSIM values for different algorithms on various test images in the Otsu multi-threshold image segmentation task. Overall, the SSIM values of all algorithms show an upward trend with increasing threshold number, indicating that a higher threshold number helps to more accurately preserve structural information and regional hierarchy in the image. Compared to other comparison algorithms, MISBOA achieved higher SSIM values on most test images and under different threshold settings, with a smaller standard deviation. This indicates that it not only better preserves the brightness, contrast, and structural features of the original image but also exhibits high stability and consistency in multiple independent runs. Especially in images with complex textures, blurred edges, and uneven grayscale distributions, MISBOA still maintains a high SSIM value, demonstrating that its segmentation results can more completely preserve the structural information of the target region, making the segmented image visually more natural and continuous. Meanwhile, the lower standard deviation further illustrates that MISBOA has good robustness in complex multi-threshold search spaces and is not easily affected by random initialization and local optima. Overall, the experimental results in Table 14 show that MISBOA has stronger structure preservation ability and better visual consistency in Otsu-based multi-threshold image segmentation tasks.
Table 15 presents the runtime comparison results of different algorithms on multiple benchmark images for multilevel threshold image segmentation tasks. Overall, MISBOA requires slightly more computational time than the original SBOA on most test images due to the introduction of multiple enhancement strategies, particularly the adaptive spiral Lévy flight and dynamic neighborhood-guided mutation mechanisms, which increase the computational complexity of the optimization process. However, the increase in runtime remains relatively limited and acceptable. For example, on most benchmark images, the runtime difference between MISBOA and SBOA is only a few seconds, while MISBOA achieves significantly better segmentation quality and optimization performance in terms of objective fitness values and image quality metrics. In addition, compared with several other algorithms such as ESC, GJA, and SSLO, MISBOA still maintains relatively competitive computational efficiency. Particularly, ESC exhibits substantially higher runtime on almost all benchmark images, whereas MISBOA achieves a better balance between segmentation accuracy and computational cost. Therefore, although MISBOA introduces a moderate increase in runtime compared with SBOA, this additional computational overhead is acceptable for multilevel threshold image segmentation problems considering the significant improvements in convergence accuracy, robustness, and segmentation quality achieved by the proposed algorithm.

5. Conclusions

In this paper, a Multi-Strategy Improved Secretary Bird Optimization Algorithm (MISBOA) is proposed to overcome the shortcomings of the original SBOA in terms of insufficient population diversity, weak local exploitation ability, and premature convergence. Three effective improvement strategies, namely chaotic elite initialization, adaptive spiral Lévy flight, and dynamic neighborhood-guided mutation, are incorporated into the original SBOA framework. These strategies significantly improve the balance between global exploration and local exploitation, enhance the ability to escape local optima, and strengthen the convergence accuracy and robustness of the algorithm.
To verify the performance of MISBOA, extensive experiments are conducted on the IEEE CEC2014, CEC2017, and CEC2020 benchmark suites. Compared with several advanced metaheuristic algorithms and representative CEC competition-winning algorithms, MISBOA achieves superior optimization accuracy, faster convergence speed, and stronger stability on most benchmark functions. In particular, MISBOA demonstrates highly competitive performance on complex multimodal, hybrid, and composition functions, indicating that the proposed strategies can effectively improve both exploration capability and exploitation performance. Furthermore, the convergence curves, boxplot analysis, statistical tests, strategy effectiveness analysis, and parameter sensitivity analysis consistently demonstrate that MISBOA possesses strong robustness, stable search behavior, and reliable optimization capability.
Furthermore, MISBOA is successfully applied to Otsu-based multilevel threshold image segmentation. Experimental results on multiple benchmark artistic images show that MISBOA can obtain higher objective fitness values and superior image quality metrics, including PSNR, FSIM, and SSIM. The segmented images also exhibit clearer object boundaries, richer detail preservation, and better visual effects. These findings confirm that MISBOA has strong applicability and effectiveness in solving complex artistic image segmentation problems.
Although MISBOA demonstrates promising optimization performance, several limitations still exist. First, the introduction of multiple enhancement strategies inevitably increases the computational complexity and computational overhead of the algorithm compared with the original SBOA. In particular, the dynamic neighborhood-guided mutation strategy requires additional neighborhood interaction calculations, which may increase the computational burden when solving high-dimensional optimization problems. Second, some control parameters in MISBOA are still empirically determined, and different optimization problems may require different parameter settings to achieve optimal performance. Therefore, the adaptive parameter adjustment capability of the algorithm still requires further investigation. Third, the current work mainly focuses on continuous numerical optimization and Otsu-based multilevel threshold image segmentation problems, while the performance of MISBOA on other challenging optimization scenarios, such as constrained optimization, multi-objective optimization, dynamic optimization, and discrete combinatorial optimization problems, has not yet been fully explored. In addition, although MISBOA exhibits strong optimization performance experimentally, deeper theoretical analysis and strict mathematical convergence proofs still remain insufficient.
Therefore, future work may focus on reducing the computational burden through adaptive neighborhood selection, parallel computing, or lightweight update mechanisms. In addition, MISBOA can be further extended to solve more real-world optimization problems, such as feature selection, engineering design, cloud task scheduling, wireless sensor network deployment, and UAV path planning. Future studies may also investigate adaptive parameter control mechanisms and theoretical convergence analysis to further improve the interpretability, scalability, and practical applicability of the proposed algorithm.

Author Contributions

Conceptualization, X.Y. and J.Q.; methodology, X.Y. and J.Q.; software, X.Y. and J.Q.; validation, X.Y. and J.Q.; formal analysis, X.Y. and J.Q.; investigation, X.Y. and J.Q.; resources, X.Y. and X.Z.; data curation, X.Y. and X.Z.; writing—original draft preparation, X.Y. and J.Q.; writing—review and editing, X.Y. and J.Q.; visualization, X.Y.; supervision, X.Y. and X.Z.; project administration, X.Y. and X.Z.; funding acquisition, X.Y. and X.Z. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

The original contributions presented in this study are included in the article. Further inquiries can be directed to the corresponding author.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Xu, W.; Fu, Y.-L.; Zhu, D. ResNet and Its Application to Medical Image Processing: Research Progress and Challenges. Comput. Methods Programs Biomed. 2023, 240, 107660. [Google Scholar] [CrossRef]
  2. Li, J.; Bhatti, U.A.; Nawaz, S.A.; Huang, M.; Ahmad, R.M.; Ghadi, Y.Y. Remote-Sensing Image Classification: A Comprehensive Review and Applications. In Deep Learning for Multimedia Processing Applications; CRC Press: Boca Raton, FL, USA, 2024; pp. 18–47. [Google Scholar]
  3. Ge, D.; Yao, X.; Xiang, W.; Chen, Y. Vehicle Detection and Tracking Based on Video Image Processing in Intelligent Transportation System. Neural Comput. Appl. 2023, 35, 2197–2209. [Google Scholar]
  4. Soltani Firouz, M.; Sardari, H. Defect Detection in Fruit and Vegetables by Using Machine Vision Systems and Image Processing. Food Eng. Rev. 2022, 14, 353–379. [Google Scholar] [CrossRef]
  5. Ruby, E.; Amirthayogam, G.; Sasi, G.; Chitra, T.; Choubey, A.; Gopalakrishnan, S. Advanced Image Processing Techniques for Automated Detection of Healthy and Infected Leaves in Agricultural Systems. Mesopotamian J. Comput. Sci. 2024, 4, 44–52. [Google Scholar] [CrossRef] [PubMed]
  6. Shakrani, K.V.; Kanyangarara, N.M.; Parowa, P.T.; Gupta, V.; Kumar, R. A Deep Learning Model for Face Recognition in Presence of Mask. Acta Inf. Malays 2022, 6, 43–46. [Google Scholar] [CrossRef]
  7. Burger, W.; Burge, M.J. Digital Image Processing: An Algorithmic Introduction; Springer Nature: Berlin/Heidelberg, Germany, 2022. [Google Scholar]
  8. Archana, R.; Jeevaraj, P.E. Deep Learning Models for Digital Image Processing: A Review. Artif. Intell. Rev. 2024, 57, 11. [Google Scholar] [CrossRef]
  9. Li, M.; Jiang, Y.; Zhang, Y.; Zhu, H. Medical Image Analysis Using Deep Learning Algorithms. Front. Public Health 2023, 11, 1273253. [Google Scholar] [CrossRef]
  10. Jurado, J.M.; López, A.; Pádua, L.; Sousa, J.J. Remote Sensing Image Fusion on 3D Scenarios: A Review of Applications for Agriculture and Forestry. Int. J. Appl. Earth Obs. Geoinf. 2022, 112, 102856. [Google Scholar] [CrossRef]
  11. Prunella, M.; Scardigno, R.M.; Buongiorno, D.; Brunetti, A.; Longo, N.; Carli, R.; Dotoli, M.; Bevilacqua, V. Deep Learning for Automatic Vision-Based Recognition of Industrial Surface Defects: A Survey. IEEE Access 2023, 11, 43370–43423. [Google Scholar] [CrossRef]
  12. Cohen, N.; Newman, Y.; Shamir, A. Semantic Segmentation in Art Paintings. Comput. Graph. Forum 2022, 41, 261–275. [Google Scholar] [CrossRef]
  13. Yuan, S.; Zhao, W.; Gao, S.; Xia, S.; Hang, B.; Qu, H. An Adaptive Threshold-Based Quantum Image Segmentation Algorithm and Its Simulation: S. Yuan et Al. Quantum Inf. Process. 2022, 21, 359. [Google Scholar] [CrossRef]
  14. Preethi, P.; Mamatha, H.R. Region-Based Convolutional Neural Network for Segmenting Text in Epigraphical Images. Artif. Intell. Appl. 2023, 1, 103–111. [Google Scholar] [CrossRef]
  15. Sasmal, B.; Dhal, K.G. A Survey on the Utilization of Superpixel Image for Clustering Based Image Segmentation. Multimed. Tools Appl. 2023, 82, 35493–35555. [Google Scholar] [CrossRef]
  16. Sun, R.; Lei, T.; Chen, Q.; Wang, Z.; Du, X.; Zhao, W.; Nandi, A.K. Survey of Image Edge Detection. Front. Signal Process. 2022, 2, 826967. [Google Scholar] [CrossRef]
  17. Gao, Y.; Jiang, Y.; Peng, Y.; Yuan, F.; Zhang, X.; Wang, J. Medical Image Segmentation: A Comprehensive Review of Deep Learning-Based Methods. Tomography 2025, 11, 52. [Google Scholar] [CrossRef]
  18. Goo, H.W.; Abdul Latiff, H. A Step-by-Step Guide for Cardiac Computed Tomography Ventricular Volumetry Using Three-Dimensional Threshold-Based Segmentation for Congenital Heart Disease. Pediatr. Radiol. 2025, 55, 2699–2703. [Google Scholar] [CrossRef]
  19. Nagendram, S.; Singh, A.; Harish Babu, G.; Joshi, R.; Pande, S.D.; Ahammad, S.H.; Dhabliya, D.; Bisht, A. Stochastic Gradient Descent Optimisation for Convolutional Neural Network for Medical Image Segmentation. Open Life Sci. 2023, 18, 20220665. [Google Scholar] [CrossRef]
  20. Mahajan, V.; Parulekar, S.; Magar, K.; Nagrale, S.; Ghule, G. Dynamic Programming Approach for Solving Variational Problems in Computer Vision. In Information and Communication Systems; CRC Press: Boca Raton, FL, USA, 2026; pp. 96–99. [Google Scholar]
  21. Liu, Q.; Li, N.; Jia, H.; Qi, Q.; Abualigah, L. A Chimp-Inspired Remora Optimization Algorithm for Multilevel Thresholding Image Segmentation Using Cross Entropy. Artif. Intell. Rev. 2023, 56, 159–216. [Google Scholar] [CrossRef]
  22. Ma, G.; Yue, X. An Improved Whale Optimization Algorithm Based on Multilevel Threshold Image Segmentation Using the Otsu Method. Eng. Appl. Artif. Intell. 2022, 113, 104960. [Google Scholar] [CrossRef]
  23. Abualigah, L.; Habash, M.; Hanandeh, E.S.; Hussein, A.M.; Shinwan, M.A.; Zitar, R.A.; Jia, H. Improved Reptile Search Algorithm by Salp Swarm Algorithm for Medical Image Segmentation. J. Bionic Eng. 2023, 20, 1766–1790. [Google Scholar] [CrossRef]
  24. Yu, M.; Zhang, J.; Yu, L.; Yang, H.; Lu, H.; Wei, X.; Xu, J. Alzheimer’s Disease Brain Image Segmentation Using Multi-Feature Fusion in 3D Rényi Entropy Model and Quantum Hybrid Optimization. Artif. Intell. Rev. 2026, 59, 95. [Google Scholar] [CrossRef]
  25. Fu, Y.; Liu, D.; Chen, J.; He, L. Secretary Bird Optimization Algorithm: A New Metaheuristic for Solving Global Optimization Problems. Artif. Intell. Rev. 2024, 57, 123. [Google Scholar] [CrossRef]
  26. Meng, Q.; Kuang, X.; Yu, Z.; He, M.; Cui, H. Augmented Secretary Bird Optimization Algorithm for Wireless Sensor Network Deployment and Engineering Problem. PLoS ONE 2025, 20, e0329705. [Google Scholar] [CrossRef]
  27. Qin, S.; Liu, J.; Bai, X.; Hu, G. A Multi-Strategy Improvement Secretary Bird Optimization Algorithm for Engineering Optimization Problems. Biomimetics 2024, 9, 478. [Google Scholar] [CrossRef]
  28. Liao, Y.; Xing, C.; Guo, Q. An Enhanced Secretary Bird Optimization Algorithm for Target Localization Based on TDOA. Phys. Commun. 2025, 73, 102853. [Google Scholar] [CrossRef]
  29. Liang, J.J.; Qu, B.Y.; Suganthan, P.N. Problem Definitions and Evaluation Criteria for the CEC 2014 Special Session and Competition on Single Objective Real-Parameter Numerical Optimization; Technical Report; Computational Intelligence Laboratory, Zhengzhou University: Zhengzhou, China; Nanyang Technological University: Singapore, 2013; Volume 635, p. 2014. [Google Scholar]
  30. Wu, G.; Mallipeddi, R.; Suganthan, P.N. Problem Definitions and Evaluation Criteria for the CEC 2017 Competition on Constrained Real-Parameter Optimization; Technical Report; National University of Defense Technology: Changsha, China; Kyungpook National University: Daegu, Republic of Korea; Nanyang Technological University: Singapore, 2017; Volume 9, p. 2017. [Google Scholar]
  31. Mohamed, A.W.; Hadi, A.A.; Mohamed, A.K.; Awad, N.H. Evaluating the Performance of Adaptive Gainingsharing Knowledge Based Algorithm on CEC 2020 Benchmark Problems. In 2020 IEEE Congress on Evolutionary Computation (CEC); IEEE: Piscataway, NJ, USA, 2020; pp. 1–8. [Google Scholar]
  32. Yu, M.; Yang, H.; Zhang, J.; Ouyang, K.; Fu, S.; Tan, P.; Jiang, F.; Xu, J. Bounty Hunter Optimizer: A Novel Metaheuristic with an Application to Multi-UAV Mobile Edge Computing and Path Planning. Knowl.-Based Syst. 2026, 341, 115836. [Google Scholar] [CrossRef]
  33. Xiao, W.; Ouyang, K.; Lian, J.J.; Gu, S.; Liu, Y.; Wei, D.; Sha, X.; Wang, J.; Fu, S.; Qiu, M. Newton Downhill Optimizer for Global Optimization. 2025; preprint. [CrossRef] [PubMed]
  34. Zhang, K.; Zhao, H.; Li, X.; Fu, C.; Jin, J. Gekko Japonicus Algorithm: A Novel Nature-Inspired Algorithm for Engineering Problems and Path Planning. J. Bionic Eng. 2026, 23, 431–471. [Google Scholar] [CrossRef]
  35. Ye, J.; Sunat, K.; Chiewchanwattana, S. Stochastic Social Learning Optimization: Combining Social Learning and Bucket Theory for Efficient Optimization. Knowl.-Based Syst. 2026, 341, 115767. [Google Scholar] [CrossRef]
  36. Chen, H.; Ahmadianfar, I.; Heidari, A.A.; Kordani, M.; Samadi Koucheksaraee, A.; Liang, G. LEE: A Physics-Inspired Optimizer Based on LangEvin Equation. Neurocomputing 2026, 666, 132288. [Google Scholar] [CrossRef]
  37. Deng, L.; Liu, S. Snow Ablation Optimizer: A Novel Metaheuristic Technique for Numerical Optimization and Engineering Design. Expert Syst. Appl. 2023, 225, 120069. [Google Scholar] [CrossRef]
  38. Fu, S.; Li, K.; Huang, H.; Ma, C.; Fan, Q.; Zhu, Y. Red-Billed Blue Magpie Optimizer: A Novel Metaheuristic Algorithm for 2D/3D UAV Path Planning and Engineering Design Problems. Artif. Intell. Rev. 2024, 57, 134. [Google Scholar]
  39. Ouyang, K.; Fu, S.; Chen, Y.; Cai, Q.; Heidari, A.A.; Chen, H. Escape: An Optimization Method Based on Crowd Evacuation Behaviors. Artif. Intell. Rev. 2024, 58, 19. [Google Scholar] [CrossRef]
  40. Woolson, R.F. Wilcoxon Signed-rank Test. In Wiley Encyclopedia of Clinical Trials; Wiley: Hoboken, NJ, USA, 2007; pp. 1–3. [Google Scholar]
  41. Sheldon, M.R.; Fillyaw, M.J.; Thompson, W.D. The Use and Interpretation of the Friedman Test in the Analysis of Ordinal-scale Data in Repeated Measures Designs. Physiother. Res. Int. 1996, 1, 221–228. [Google Scholar] [CrossRef]
Figure 1. Schematic diagram of the Chaotic Elite Initialization Strategy.
Figure 1. Schematic diagram of the Chaotic Elite Initialization Strategy.
Biomimetics 11 00385 g001
Figure 2. Schematic diagram of the Adaptive Spiral Lévy Flight Strategy.
Figure 2. Schematic diagram of the Adaptive Spiral Lévy Flight Strategy.
Biomimetics 11 00385 g002
Figure 3. Schematic diagram of the Dynamic Neighborhood-Guided Mutation Strategy.
Figure 3. Schematic diagram of the Dynamic Neighborhood-Guided Mutation Strategy.
Biomimetics 11 00385 g003
Figure 4. MISBOA flowchart.
Figure 4. MISBOA flowchart.
Biomimetics 11 00385 g004
Figure 5. Convergence Speed Comparison of Different Algorithms on the CEC2014 Test Suite.
Figure 5. Convergence Speed Comparison of Different Algorithms on the CEC2014 Test Suite.
Biomimetics 11 00385 g005
Figure 6. Boxplot-Based Performance Comparison of Different Algorithms on the CEC2014 Test Suite.
Figure 6. Boxplot-Based Performance Comparison of Different Algorithms on the CEC2014 Test Suite.
Biomimetics 11 00385 g006
Figure 7. Convergence Speed Comparison of Different Algorithms on the CEC2017 Test Suite.
Figure 7. Convergence Speed Comparison of Different Algorithms on the CEC2017 Test Suite.
Biomimetics 11 00385 g007aBiomimetics 11 00385 g007b
Figure 8. Boxplot-Based Performance Comparison of Different Algorithms on the CEC2017 Test Suite.
Figure 8. Boxplot-Based Performance Comparison of Different Algorithms on the CEC2017 Test Suite.
Biomimetics 11 00385 g008aBiomimetics 11 00385 g008b
Figure 9. Convergence Speed Comparison of Different Algorithms on the CEC2020 Test Suite.
Figure 9. Convergence Speed Comparison of Different Algorithms on the CEC2020 Test Suite.
Biomimetics 11 00385 g009
Figure 10. Boxplot-Based Performance Comparison of Different Algorithms on the CEC2020 Test Suite.
Figure 10. Boxplot-Based Performance Comparison of Different Algorithms on the CEC2020 Test Suite.
Biomimetics 11 00385 g010
Figure 11. Convergence curves compared to the CEC winner algorithm.
Figure 11. Convergence curves compared to the CEC winner algorithm.
Biomimetics 11 00385 g011
Figure 12. Box plots comparing the algorithm with the CEC winner.
Figure 12. Box plots comparing the algorithm with the CEC winner.
Biomimetics 11 00385 g012
Figure 13. Parameter sensitivity analysis experimental results.
Figure 13. Parameter sensitivity analysis experimental results.
Biomimetics 11 00385 g013aBiomimetics 11 00385 g013b
Figure 14. Benchmark Test Images Used for Segmentation Evaluation.
Figure 14. Benchmark Test Images Used for Segmentation Evaluation.
Biomimetics 11 00385 g014aBiomimetics 11 00385 g014b
Figure 15. Performance of MISBOA in Otsu-Based Multilevel Threshold Segmentation.
Figure 15. Performance of MISBOA in Otsu-Based Multilevel Threshold Segmentation.
Biomimetics 11 00385 g015aBiomimetics 11 00385 g015bBiomimetics 11 00385 g015cBiomimetics 11 00385 g015d
Table 1. Parameter Configurations of the Compared Algorithms.
Table 1. Parameter Configurations of the Compared Algorithms.
AlgorithmsParameter NameParameter ValueReference
BHOnTransfer, rho5, 0.25[32]
NDOu0.5[33]
GJAbeta_start, beta_end1.2, 0.3[34]
SSLOCR0.9[35]
LEEinT, upr1, 0.3[36]
SAON10.5[37]
RBMOEpsilon0.5[38]
ESCeliteSize, beta_base5, 1.5[39]
SBOAbeta1.5[25]
Table 2. Performance Comparison of Different Algorithms on the 30-Dimensional CEC2014 Benchmark Functions.
Table 2. Performance Comparison of Different Algorithms on the 30-Dimensional CEC2014 Benchmark Functions.
IDItemsBHONDOGJASSLOLEESAORBMOESCSBOAMISBOA
CEC2014-F1Ave2.5066 × 1052.1732 × 1066.0964 × 1064.7766 × 1072.6614 × 1062.0733 × 1061.8911 × 1058.3092 × 1066.0607 × 1062.1767 × 103
Std1.7409 × 1051.2405 × 1062.5346 × 1061.3085 × 1071.1783 × 1061.0938 × 1061.3707 × 1054.6988 × 1064.0035 × 1062.0669 × 103
CEC2014-F2Ave2.0009 × 1023.2135 × 1031.3679 × 1061.0512 × 1072.0003 × 1021.0908 × 1042.0021 × 1029.2482 × 1038.7464 × 1032.0000 × 102
Std2.2283 × 10−12.5095 × 1032.3735 × 1052.3774 × 1062.5235 × 10−29.9897 × 1032.7067 × 10−16.2854 × 1037.5205 × 1032.4186 × 10−14
CEC2014-F3Ave3.0044 × 1022.9023 × 1034.0530 × 1036.1515 × 1033.0002 × 1028.1133 × 1033.0025 × 1022.6203 × 1033.0248 × 1033.0000 × 102
Std1.3791 × 10001.9766 × 1031.3393 × 1033.0504 × 1036.8199 × 10−33.7347 × 1032.3921 × 10−14.7131 × 1032.1803 × 1034.9510 × 10−14
CEC2014-F4Ave4.3863 × 1024.8282 × 1025.1429 × 1025.5740 × 1024.8438 × 1024.8809 × 1024.7285 × 1025.1470 × 1024.9407 × 1024.0011 × 102
Std3.3035 × 1013.6196 × 1013.1459 × 1012.0410 × 1013.3222 × 1013.6493 × 1012.5577 × 1012.8831 × 1013.0176 × 1012.0105 × 10−1
CEC2014-F5Ave5.2016 × 1025.2057 × 1025.2093 × 1025.2048 × 1025.2054 × 1025.2100 × 1025.2030 × 1025.2097 × 1025.2012 × 1025.2074 × 102
Std2.0395 × 10−11.7020 × 10−15.7840 × 10−25.3882 × 10−22.0339 × 10−16.2369 × 10−21.1585 × 10−15.0138 × 10−26.0937 × 10−29.6401 × 10−2
CEC2014-F6Ave6.0755 × 1026.1234 × 1026.1560 × 1026.2036 × 1026.0837 × 1026.0463 × 1026.0894 × 1026.0249 × 1026.1009 × 1026.0057 × 102
Std4.0067 × 10002.7379 × 10001.9030 × 10001.2525 × 10003.0902 × 10002.1270 × 10003.8291 × 10001.2591 × 10002.6151 × 10007.9730 × 10−1
CEC2014-F7Ave7.0002 × 1027.0002 × 1027.0095 × 1027.0105 × 1027.0000 × 1027.0001 × 1027.0001 × 1027.0000 × 1027.0001 × 1027.0000 × 102
Std1.3126 × 10−24.1455 × 10−23.4725 × 10−21.2865 × 10−24.3456 × 10−31.4565 × 10−28.0940 × 10−31.7810 × 10−31.5925 × 10−24.2222 × 10−14
CEC2014-F8Ave8.0141 × 1028.4968 × 1028.1184 × 1028.2880 × 1028.2534 × 1028.4458 × 1028.5284 × 1028.1038 × 1028.4521 × 1028.1386 × 102
Std1.0506 × 10001.4750 × 1013.0762 × 10003.2199 × 10007.6367 × 10001.0673 × 1011.6732 × 1013.5213 × 10001.4511 × 1014.4337 × 1000
CEC2014-F9Ave9.2952 × 1029.8041 × 1029.6428 × 1021.0032 × 1039.5390 × 1029.5486 × 1029.4735 × 1029.7227 × 1029.6825 × 1029.1844 × 102
Std6.8282 × 10001.8257 × 1011.6642 × 1011.0900 × 1011.4033 × 1011.3836 × 1011.3572 × 1012.2924 × 1011.3417 × 1017.4673 × 1000
CEC2014-F10Ave1.1430 × 1031.6611 × 1031.4575 × 1031.6655 × 1032.8879 × 1032.8874 × 1033.5463 × 1031.2096 × 1031.7793 × 1031.2235 × 103
Std1.2284 × 1023.7858 × 1021.8627 × 1021.5438 × 1024.8829 × 1025.0340 × 1026.1863 × 1021.6878 × 1022.5914 × 1021.4805 × 102
CEC2014-F11Ave3.5818 × 1034.4586 × 1033.6424 × 1034.7279 × 1034.6031 × 1033.9016 × 1034.5428 × 1036.3632 × 1033.9689 × 1033.3364 × 103
Std4.6536 × 1027.3914 × 1026.7934 × 1022.9476 × 1026.5107 × 1027.3440 × 1024.4563 × 1024.8121 × 1027.0654 × 1026.1142 × 102
CEC2014-F12Ave1.2004 × 1031.2006 × 1031.2006 × 1031.2007 × 1031.2005 × 1031.2017 × 1031.2008 × 1031.2021 × 1031.2002 × 1031.2005 × 103
Std1.3763 × 10−12.5121 × 10−12.4100 × 10−11.3575 × 10−12.3348 × 10−11.0905 × 10003.1518 × 10−13.7220 × 10−11.1210 × 10−13.7475 × 10−1
CEC2014-F13Ave1.3002 × 1031.3005 × 1031.3004 × 1031.3004 × 1031.3004 × 1031.3005 × 1031.3003 × 1031.3003 × 1031.3004 × 1031.3002 × 103
Std5.8921 × 10−22.7362 × 10−16.0189 × 10−24.3852 × 10−25.9542 × 10−28.7354 × 10−27.5534 × 10−24.4323 × 10−21.0615 × 10−13.5293 × 10−2
CEC2014-F14Ave1.4003 × 1031.4003 × 1031.4003 × 1031.4003 × 1031.4003 × 1031.4004 × 1031.4004 × 1031.4003 × 1031.4003 × 1031.4003 × 103
Std5.7789 × 10−25.5809 × 10−24.7677 × 10−22.7024 × 10−28.2078 × 10−21.5322 × 10−12.2430 × 10−14.5337 × 10−21.0950 × 10−12.7868 × 10−2
CEC2014-F15Ave1.5042 × 1031.5092 × 1031.5184 × 1031.5177 × 1031.5061 × 1031.5159 × 1031.5052 × 1031.5098 × 1031.5071 × 1031.5031 × 103
Std9.7598 × 10−13.4790 × 10003.6426 × 10001.7337 × 10001.7166 × 10003.8003 × 10001.3539 × 10001.1543 × 10002.3906 × 10006.9901 × 10−1
CEC2014-F16Ave1.6104 × 1031.6115 × 1031.6109 × 1031.6115 × 1031.6119 × 1031.6126 × 1031.6114 × 1031.6118 × 1031.6107 × 1031.6099 × 103
Std5.6080 × 10−16.2709 × 10−15.4586 × 10−13.6655 × 10−16.1340 × 10−13.5099 × 10−16.6402 × 10−14.6880 × 10−17.4399 × 10−19.4974 × 10−1
CEC2014-F17Ave5.5852 × 1033.0809 × 1053.6616 × 1052.6380 × 1066.7220 × 1032.4155 × 1052.8542 × 1031.1021 × 1064.1504 × 1052.2941 × 103
Std4.5609 × 1032.0216 × 1052.0292 × 1058.2519 × 1052.8337 × 1032.1127 × 1052.9209 × 1027.8913 × 1052.7741 × 1053.4118 × 102
CEC2014-F18Ave1.9127 × 1033.9694 × 1032.9382 × 1044.6587 × 1042.2162 × 1034.1689 × 1033.1638 × 1033.3782 × 1034.1572 × 1031.8158 × 103
Std4.5847 × 1012.3759 × 1038.0689 × 1034.4429 × 1048.7391 × 1014.0722 × 1035.0085 × 1031.2416 × 1033.2243 × 1031.8798 × 101
CEC2014-F19Ave1.9077 × 1031.9145 × 1031.9111 × 1031.9130 × 1031.9093 × 1031.9102 × 1031.9114 × 1031.9075 × 1031.9085 × 1031.9037 × 103
Std1.5887 × 10002.2969 × 1011.5497 × 10001.6027 × 10001.3737 × 1011.0218 × 1011.4669 × 1011.1062 × 1011.0651 × 1016.7297 × 10−1
CEC2014-F20Ave2.2132 × 1031.1512 × 1045.2819 × 1031.0811 × 1042.0948 × 1032.6618 × 1042.0820 × 1036.7316 × 1034.6816 × 1032.0069 × 103
Std1.0351 × 1024.0277 × 1032.5286 × 1033.9214 × 1031.5978 × 1011.1507 × 1042.5385 × 1013.3594 × 1032.7647 × 1032.1031 × 1000
CEC2014-F21Ave2.9180 × 1038.4199 × 1041.4274 × 1054.0361 × 1054.3007 × 1031.5535 × 1052.9610 × 1032.4441 × 1051.1797 × 1052.3591 × 103
Std2.9845 × 1027.0848 × 1041.1743 × 1051.3362 × 1054.0517 × 1029.8093 × 1042.3176 × 1022.1481 × 1051.2468 × 1051.2400 × 102
CEC2014-F22Ave2.3974 × 1032.6189 × 1032.6263 × 1032.5957 × 1032.4759 × 1032.6471 × 1032.5076 × 1032.4037 × 1032.4288 × 1032.3616 × 103
Std8.9222 × 1011.5423 × 1021.5234 × 1029.8016 × 1011.4043 × 1022.1090 × 1021.0856 × 1021.0767 × 1021.0711 × 1025.2308 × 101
CEC2014-F23Ave2.5000 × 1032.6152 × 1032.6154 × 1032.6164 × 1032.5000 × 1032.6152 × 1032.6152 × 1032.6152 × 1032.6152 × 1032.6152 × 103
Std0.0000 × 10002.8497 × 10−75.7549 × 10−23.6706 × 10−10.0000 × 10001.1860 × 10−57.4315 × 10−83.1751 × 10−49.0475 × 10−71.4964 × 10−12
CEC2014-F24Ave2.6000 × 1032.6384 × 1032.6264 × 1032.6384 × 1032.6000 × 1032.6086 × 1032.6328 × 1032.6275 × 1032.6000 × 1032.6244 × 103
Std0.0000 × 10009.6732 × 10001.9696 × 10002.2380 × 10000.0000 × 10001.0735 × 1018.6256 × 10004.2284 × 10004.2152 × 10−41.4479 × 1000
CEC2014-F25Ave2.7000 × 1032.7087 × 1032.7097 × 1032.7129 × 1032.7000 × 1032.7033 × 1032.7043 × 1032.7073 × 1032.7015 × 1032.7030 × 103
Std0.0000 × 10002.8358 × 10003.0918 × 10001.9317 × 10000.0000 × 10004.5657 × 10001.8730 × 10001.2664 × 10002.9335 × 10003.0097 × 10−1
CEC2014-F26Ave2.7036 × 1032.7042 × 1032.7635 × 1032.7004 × 1032.7003 × 1032.7237 × 1032.7225 × 1032.7069 × 1032.7303 × 1032.7002 × 103
Std1.8209 × 1012.0533 × 1014.8873 × 1015.1958 × 10−26.5127 × 10−24.2809 × 1016.7846 × 1012.5378 × 1014.6428 × 1013.2830 × 10−2
CEC2014-F27Ave2.9000 × 1033.2097 × 1033.3272 × 1033.2543 × 1032.9429 × 1033.1839 × 1033.3264 × 1033.0923 × 1033.2220 × 1033.0209 × 103
Std0.0000 × 10001.2366 × 1021.9481 × 1021.0923 × 1028.8021 × 1018.9489 × 1011.4673 × 1024.6584 × 1011.2048 × 1023.8252 × 101
CEC2014-F28Ave3.2592 × 1033.8593 × 1033.9855 × 1033.7712 × 1033.0000 × 1033.8219 × 1033.9091 × 1033.6541 × 1033.6844 × 1033.6785 × 103
Std2.3529 × 1022.4361 × 1024.3070 × 1022.7873 × 1010.0000 × 10002.3672 × 1022.0851 × 1024.4931 × 1016.2813 × 1012.3489 × 101
CEC2014-F29Ave6.8506 × 1044.2437 × 1032.9974 × 1051.1505 × 1046.8265 × 1055.9885 × 1054.7270 × 1064.5430 × 1035.1207 × 1033.4499 × 103
Std2.3017 × 1053.3950 × 1021.5902 × 1062.1707 × 1042.5939 × 1062.2620 × 1066.1732 × 1064.2237 × 1021.5422 × 1032.2320 × 102
CEC2014-F30Ave5.0853 × 1035.5940 × 1036.2655 × 1031.3548 × 1046.1903 × 1036.0456 × 1036.9538 × 1036.8012 × 1036.0340 × 1033.6211 × 103
Std4.2035 × 1039.2568 × 1028.2302 × 1022.7440 × 1031.1597 × 1031.0430 × 1032.5866 × 1032.6277 × 1039.8982 × 1022.0235 × 102
Table 3. Performance Comparison of Different Algorithms on the 30-Dimensional CEC2017 Benchmark Functions.
Table 3. Performance Comparison of Different Algorithms on the 30-Dimensional CEC2017 Benchmark Functions.
IDItemsBHONDOGJASSLOLEESAORBMOESCSBOAMISBOA
CEC2017-F1Ave1.0740 × 1023.6289 × 1031.2483 × 1061.2195 × 1071.6391 × 1024.2386 × 1034.0946 × 1022.8119 × 1035.2727 × 1031.0000 × 102
Std1.4039 × 1014.1975 × 1032.0568 × 1054.0018 × 1066.8159 × 1015.8184 × 1033.4828 × 1023.6231 × 1035.3558 × 1032.6782 × 10−14
CEC2017-F3Ave3.0046 × 1025.7796 × 1043.1905 × 1031.0716 × 1051.0232 × 1037.1659 × 1043.0078 × 1024.4081 × 1045.9832 × 1033.0000 × 102
Std4.3867 × 10−11.2400 × 1041.3429 × 1031.4848 × 1044.8830 × 1022.1870 × 1048.5749 × 10−11.3502 × 1043.1803 × 1033.2600 × 10−9
CEC2017-F4Ave4.6916 × 1024.7957 × 1025.0089 × 1025.3286 × 1024.9795 × 1024.9503 × 1024.7856 × 1025.0186 × 1024.9559 × 1024.2585 × 102
Std2.5160 × 1013.4673 × 1012.3959 × 1011.2040 × 1011.4348 × 1011.4288 × 1012.4333 × 1012.3444 × 1012.3162 × 1012.8065 × 101
CEC2017-F5Ave5.2875 × 1025.8186 × 1025.6398 × 1026.0096 × 1025.4852 × 1025.5250 × 1025.4794 × 1025.7739 × 1025.6455 × 1025.2189 × 102
Std6.5946 × 10004.6020 × 1011.9621 × 1011.0160 × 1011.3792 × 1011.2937 × 1011.0442 × 1011.9085 × 1011.5616 × 1016.3789 × 1000
CEC2017-F6Ave6.0028 × 1026.0241 × 1026.0563 × 1026.0266 × 1026.0000 × 1026.0004 × 1026.0004 × 1026.0000 × 1026.0055 × 1026.0000 × 102
Std2.3263 × 10−12.9305 × 10001.9400 × 10003.3107 × 10−12.0635 × 10−46.1913 × 10−25.3407 × 10−24.2105 × 10−36.1343 × 10−11.3378 × 10−6
CEC2017-F7Ave7.6558 × 1028.3293 × 1028.0812 × 1028.9383 × 1027.8168 × 1028.2386 × 1027.7783 × 1028.2475 × 1028.0460 × 1027.4829 × 102
Std9.4642 × 10002.8546 × 1011.5932 × 1011.2263 × 1011.4760 × 1016.3526 × 1011.3283 × 1011.5747 × 1012.8026 × 1016.1372 × 1000
CEC2017-F8Ave8.2869 × 1028.7289 × 1028.6388 × 1029.0264 × 1028.5423 × 1028.5255 × 1028.5372 × 1028.7526 × 1028.5984 × 1028.1834 × 102
Std7.4096 × 10001.9211 × 1011.5371 × 1011.0846 × 1011.4316 × 1011.4265 × 1011.7585 × 1012.1218 × 1011.7338 × 1014.3853 × 1000
CEC2017-F9Ave9.2509 × 1021.2225 × 1039.7483 × 1021.6693 × 1039.0152 × 1029.0546 × 1029.0890 × 1029.0084 × 1029.5482 × 1029.0003 × 102
Std2.6963 × 1013.3651 × 1024.1124 × 1011.7538 × 1023.5595 × 10001.2454 × 1011.4554 × 1011.5142 × 10008.4825 × 1018.6397 × 10−2
CEC2017-F10Ave3.8951 × 1034.8517 × 1034.0983 × 1034.8336 × 1034.4588 × 1033.8680 × 1034.4890 × 1036.4250 × 1034.2045 × 1033.2613 × 103
Std4.8122 × 1026.9530 × 1026.7577 × 1023.8861 × 1026.2092 × 1025.0078 × 1026.0145 × 1024.8994 × 1025.8371 × 1025.3609 × 102
CEC2017-F11Ave1.1998 × 1031.1783 × 1031.2064 × 1031.6102 × 1031.1671 × 1031.1665 × 1031.1596 × 1031.1741 × 1031.1764 × 1031.1211 × 103
Std3.2665 × 1013.3516 × 1013.4591 × 1011.6262 × 1023.0603 × 1014.6103 × 1013.0849 × 1012.4623 × 1013.3387 × 1012.1412 × 101
CEC2017-F12Ave2.7334 × 1041.0588 × 1052.3382 × 1065.2432 × 1061.7946 × 1053.2335 × 1051.8770 × 1047.1805 × 1053.4547 × 1052.7938 × 103
Std1.8891 × 1048.7463 × 1041.2377 × 1062.2234 × 1062.6087 × 1052.7853 × 1051.4759 × 1046.2879 × 1053.1649 × 1057.8023 × 102
CEC2017-F13Ave3.5923 × 1031.2230 × 1041.0536 × 1051.9841 × 1057.0239 × 1031.8695 × 1044.5262 × 1031.1995 × 1042.0372 × 1041.3489 × 103
Std1.2176 × 1031.0232 × 1043.0763 × 1041.8661 × 1055.9008 × 1031.8662 × 1041.0995 × 1049.4711 × 1032.0948 × 1043.6688 × 101
CEC2017-F14Ave1.5448 × 1031.6923 × 1041.4493 × 1049.8324 × 1041.5059 × 1032.4081 × 1041.4594 × 1034.9109 × 1041.8495 × 1041.4282 × 103
Std6.1477 × 1011.2532 × 1041.2729 × 1046.9423 × 1041.0893 × 1011.9232 × 1041.3063 × 1015.9674 × 1041.7469 × 1043.6274 × 1000
CEC2017-F15Ave1.7486 × 1038.7618 × 1033.3355 × 1044.0356 × 1041.7647 × 1035.5854 × 1031.6751 × 1031.0353 × 1041.1047 × 1041.5143 × 103
Std1.1110 × 1027.6780 × 1031.4281 × 1042.9036 × 1046.0349 × 1017.5008 × 1036.4461 × 1018.5785 × 1038.3287 × 1036.7724 × 1000
CEC2017-F16Ave1.9866 × 1032.4280 × 1032.4762 × 1032.5923 × 1032.2445 × 1032.3497 × 1032.2201 × 1032.0926 × 1032.2408 × 1032.0377 × 103
Std2.0850 × 1023.0132 × 1022.2409 × 1021.3612 × 1022.6898 × 1022.6690 × 1021.8825 × 1022.1612 × 1022.2161 × 1022.3614 × 102
CEC2017-F17Ave1.8056 × 1032.0274 × 1031.9327 × 1031.9934 × 1031.9042 × 1032.0287 × 1031.9497 × 1031.8140 × 1031.8556 × 1031.7439 × 103
Std4.6432 × 1011.7959 × 1021.0746 × 1028.1197 × 1011.1721 × 1022.0915 × 1029.7818 × 1018.1015 × 1018.2337 × 1013.8824 × 101
CEC2017-F18Ave3.5039 × 1032.4241 × 1052.3512 × 1056.8135 × 1054.9840 × 1033.8670 × 1051.9144 × 1035.5822 × 1052.6816 × 1051.8752 × 103
Std1.6423 × 1032.3965 × 1052.3267 × 1053.3020 × 1053.2704 × 1034.3688 × 1053.3725 × 1016.4101 × 1051.4387 × 1054.4420 × 101
CEC2017-F19Ave2.0563 × 1031.0845 × 1044.5153 × 1045.1731 × 1041.9893 × 1036.4958 × 1031.9441 × 1031.2806 × 1041.3130 × 1041.9129 × 103
Std6.4774 × 1011.2607 × 1042.7267 × 1043.2759 × 1042.8480 × 1013.7784 × 1031.7652 × 1011.3053 × 1041.5142 × 1044.4667 × 1000
CEC2017-F20Ave2.1398 × 1032.3182 × 1032.2774 × 1032.3562 × 1032.2589 × 1032.3239 × 1032.2698 × 1032.1269 × 1032.2297 × 1032.0891 × 103
Std6.1937 × 1011.4433 × 1021.1556 × 1029.3653 × 1011.0974 × 1021.7134 × 1021.2085 × 1026.6802 × 1011.0293 × 1026.1402 × 101
CEC2017-F21Ave2.3304 × 1032.3706 × 1032.3624 × 1032.3982 × 1032.3464 × 1032.3581 × 1032.3575 × 1032.3727 × 1032.3461 × 1032.3188 × 103
Std6.7739 × 10002.1658 × 1011.5823 × 1011.2376 × 1011.3204 × 1011.6117 × 1011.7772 × 1011.9821 × 1011.1288 × 1016.8398 × 1000
CEC2017-F22Ave2.3003 × 1032.4268 × 1032.3120 × 1032.3240 × 1033.4112 × 1032.8764 × 1034.3287 × 1033.3803 × 1032.3008 × 1032.3000 × 103
Std1.0373 × 10005.3421 × 1027.9133 × 10−15.6797 × 10001.7464 × 1031.1937 × 1031.9617 × 1032.2038 × 1031.2847 × 10001.6889 × 10−13
CEC2017-F23Ave2.6854 × 1032.7337 × 1032.7251 × 1032.7465 × 1032.7041 × 1032.7049 × 1032.7253 × 1032.7068 × 1032.6996 × 1032.6600 × 103
Std8.5479 × 10002.3965 × 1012.1614 × 1011.1534 × 1011.3833 × 1011.3782 × 1012.6433 × 1012.2609 × 1011.6947 × 1011.0466 × 101
CEC2017-F24Ave2.8560 × 1032.9096 × 1032.8888 × 1032.9149 × 1032.8783 × 1032.8798 × 1032.8995 × 1032.9132 × 1032.8692 × 1032.8320 × 103
Std1.0336 × 1012.6077 × 1011.8817 × 1011.4235 × 1011.8662 × 1011.6584 × 1013.2291 × 1011.4565 × 1011.5848 × 1015.8100 × 1000
CEC2017-F25Ave2.8893 × 1032.8908 × 1032.9135 × 1032.9207 × 1032.8873 × 1032.8867 × 1032.8892 × 1032.8889 × 1032.8933 × 1032.8869 × 103
Std6.6324 × 10009.7651 × 10001.8745 × 1018.8034 × 10008.2619 × 10−11.8729 × 10006.6018 × 10004.3333 × 10001.2431 × 1011.0303 × 10−1
CEC2017-F26Ave3.4460 × 1034.1009 × 1033.6682 × 1034.6996 × 1034.2180 × 1034.1323 × 1034.3594 × 1033.9437 × 1033.7868 × 1033.6386 × 103
Std5.8271 × 1028.9344 × 1029.8808 × 1021.5191 × 1021.3092 × 1023.7319 × 1024.9309 × 1021.5738 × 1026.3072 × 1021.0213 × 102
CEC2017-F27Ave3.2135 × 1033.2407 × 1033.2421 × 1033.2345 × 1033.2141 × 1033.2227 × 1033.2239 × 1033.2173 × 1033.2108 × 1033.2090 × 103
Std1.0289 × 1011.9179 × 1011.8671 × 1017.1712 × 10001.1141 × 1011.3915 × 1012.2498 × 1018.2055 × 10001.1409 × 1011.1028 × 101
CEC2017-F28Ave3.1712 × 1033.2288 × 1033.2447 × 1033.2882 × 1033.2284 × 1033.2159 × 1033.3235 × 1033.2243 × 1033.2196 × 1033.1335 × 103
Std5.7453 × 1011.0445 × 1022.0971 × 1011.1244 × 1012.6018 × 1011.8035 × 1016.0940 × 1021.7275 × 1012.3788 × 1015.2481 × 101
CEC2017-F29Ave3.4945 × 1033.6068 × 1033.6311 × 1033.6685 × 1033.6090 × 1033.6583 × 1033.6456 × 1033.4485 × 1033.5081 × 1033.3630 × 103
Std9.7275 × 1011.5391 × 1021.8566 × 1026.5626 × 1011.3069 × 1021.3517 × 1021.3415 × 1027.4082 × 1011.1446 × 1021.9823 × 101
CEC2017-F30Ave7.3532 × 1039.3334 × 1031.6175 × 1059.5922 × 1041.7642 × 1048.5175 × 1037.0105 × 1031.0911 × 1042.0223 × 1045.3068 × 103
Std2.2403 × 1033.0397 × 1039.9323 × 1043.5134 × 1045.8532 × 1033.6042 × 1031.6945 × 1034.4873 × 1032.4201 × 1041.3538 × 102
Table 4. Performance Comparison of Different Algorithms on the 100-Dimensional CEC2017 Benchmark Functions.
Table 4. Performance Comparison of Different Algorithms on the 100-Dimensional CEC2017 Benchmark Functions.
IDItemsBHONDOGJASSLOLEESAORBMOESCSBOAMISBOA
CEC2017-F1Ave2.3656 × 1052.1626 × 1082.8232 × 1071.3296 × 10104.6316 × 1041.4426 × 1083.9710 × 1078.6900 × 1092.3778 × 1086.7162 × 103
Std1.9031 × 1054.8936 × 1083.2417 × 1061.0328 × 1099.7020 × 1046.7772 × 1072.6587 × 1073.4946 × 1095.0375 × 1085.6948 × 103
CEC2017-F3Ave1.1238 × 1054.9515 × 1052.9307 × 1055.6949 × 1052.3626 × 1057.9730 × 1057.9903 × 1044.8855 × 1052.4441 × 1053.1722 × 105
Std1.8219 × 1045.6885 × 1044.2376 × 1044.9903 × 1042.7139 × 1041.7806 × 1051.5551 × 1045.0067 × 1042.3827 × 1042.2250 × 104
CEC2017-F4Ave7.1858 × 1029.2884 × 1029.2122 × 1022.5730 × 1037.4919 × 1027.6995 × 1028.5117 × 1021.4783 × 1039.5445 × 1026.4263 × 102
Std5.6997 × 1017.6884 × 1016.5320 × 1011.2746 × 1026.0462 × 1015.1533 × 1015.8474 × 1012.7996 × 1028.7135 × 1015.0854 × 101
CEC2017-F5Ave8.3803 × 1029.7909 × 1029.5883 × 1021.3573 × 1038.3476 × 1021.2069 × 1039.3365 × 1021.0478 × 1039.9938 × 1026.2995 × 102
Std5.4671 × 1017.0918 × 1018.2643 × 1013.7609 × 1015.9760 × 1012.3507 × 1027.0651 × 1011.2999 × 1027.5345 × 1012.1719 × 101
CEC2017-F6Ave6.1784 × 1026.2240 × 1026.2534 × 1026.2600 × 1026.0807 × 1026.1170 × 1026.1111 × 1026.0584 × 1026.2608 × 1026.0115 × 102
Std3.8183 × 10005.4665 × 10003.6385 × 10001.1616 × 10003.8598 × 10003.0288 × 10003.4458 × 10001.3344 × 10005.5798 × 10004.4594 × 10−1
CEC2017-F7Ave1.5294 × 1031.7855 × 1031.4494 × 1032.3961 × 1031.2976 × 1031.9557 × 1031.3352 × 1031.5178 × 1031.9246 × 1039.1940 × 102
Std1.2869 × 1021.8724 × 1026.5704 × 1014.2081 × 1017.2251 × 1015.0828 × 1018.3361 × 1011.1265 × 1022.0701 × 1022.3951 × 101
CEC2017-F8Ave1.1862 × 1031.3151 × 1031.2322 × 1031.6595 × 1031.1113 × 1031.4270 × 1031.2227 × 1031.3644 × 1031.2882 × 1039.3150 × 102
Std6.1575 × 1018.5719 × 1016.1181 × 1013.2115 × 1015.1768 × 1012.1662 × 1021.0006 × 1021.1717 × 1026.3832 × 1012.1689 × 101
CEC2017-F9Ave9.1382 × 1032.6044 × 1041.3531 × 1042.9839 × 1046.5359 × 1039.0870 × 1036.1915 × 1035.3717 × 1031.7130 × 1049.4629 × 102
Std2.3868 × 1039.0571 × 1035.6651 × 1034.1849 × 1031.6765 × 1032.8502 × 1032.3205 × 1031.6787 × 1033.2980 × 1033.4376 × 101
CEC2017-F10Ave1.5224 × 1042.3979 × 1041.4171 × 1042.1661 × 1041.5521 × 1042.0339 × 1041.9326 × 1042.8178 × 1041.4382 × 1042.9217 × 104
Std1.1596 × 1034.0393 × 1031.1554 × 1035.2214 × 1021.2388 × 1036.9978 × 1031.7473 × 1036.6470 × 1021.8747 × 1038.9907 × 102
CEC2017-F11Ave2.6851 × 1035.7817 × 1043.7572 × 1031.1568 × 1051.5462 × 1041.2635 × 1053.4177 × 1034.2050 × 1041.2155 × 1042.6260 × 103
Std1.7968 × 1021.9018 × 1047.5299 × 1021.5916 × 1044.2986 × 1033.7462 × 1043.4655 × 1029.7885 × 1034.7945 × 1031.8456 × 102
CEC2017-F12Ave7.4148 × 1064.1636 × 1071.7013 × 1083.3919 × 1092.6075 × 1074.4456 × 1073.2439 × 1073.6758 × 1085.4397 × 1073.6697 × 106
Std2.8801 × 1062.5223 × 1075.2121 × 1073.6296 × 1081.0571 × 1072.6693 × 1072.7889 × 1072.5097 × 1082.6916 × 1071.5510 × 106
CEC2017-F13Ave1.3917 × 1048.9109 × 1038.3288 × 1053.2118 × 1076.3794 × 1038.0810 × 1031.5315 × 1043.4792 × 1041.0632 × 1044.0617 × 103
Std6.0828 × 1037.1554 × 1031.0378 × 1051.0888 × 1074.8554 × 1035.4849 × 1032.3616 × 1041.1822 × 1049.4458 × 1032.2374 × 103
CEC2017-F14Ave5.6774 × 1041.0487 × 1061.5424 × 1061.6347 × 1074.0947 × 1058.3518 × 1052.3522 × 1034.7472 × 1061.7399 × 1062.5560 × 104
Std3.5301 × 1045.6758 × 1054.2439 × 1054.5129 × 1062.2547 × 1054.1761 × 1051.9075 × 1023.1375 × 1069.3930 × 1051.7086 × 104
CEC2017-F15Ave6.8646 × 1035.2421 × 1033.2655 × 1052.1906 × 1066.0308 × 1035.0891 × 1036.7004 × 1031.6607 × 1046.3186 × 1032.5555 × 103
Std6.9871 × 1033.5998 × 1035.1891 × 1041.2305 × 1065.9219 × 1034.1559 × 1037.5220 × 1035.4254 × 1035.0903 × 1031.0446 × 103
CEC2017-F16Ave4.5108 × 1035.2095 × 1035.8084 × 1037.9535 × 1035.3750 × 1035.1321 × 1036.0382 × 1036.7069 × 1034.9341 × 1033.9377 × 103
Std6.7589 × 1027.7525 × 1026.2921 × 1022.7254 × 1027.2387 × 1026.2585 × 1027.5143 × 1027.5548 × 1027.1780 × 1026.2776 × 102
CEC2017-F17Ave4.2193 × 1034.6872 × 1035.3200 × 1036.3280 × 1034.8059 × 1035.1044 × 1035.1280 × 1035.0645 × 1034.5074 × 1033.7065 × 103
Std5.2659 × 1025.4104 × 1025.8614 × 1022.5693 × 1025.0609 × 1021.0927 × 1035.5306 × 1024.5268 × 1024.6538 × 1023.8564 × 102
CEC2017-F18Ave1.7430 × 1055.0972 × 1061.7135 × 1061.8128 × 1077.9193 × 1053.4358 × 1068.7935 × 1048.3247 × 1063.4329 × 1067.8461 × 104
Std7.4403 × 1043.0340 × 1065.1663 × 1054.8052 × 1064.1902 × 1052.1150 × 1063.9863 × 1043.4027 × 1061.7623 × 1061.9852 × 104
CEC2017-F19Ave6.4859 × 1035.7996 × 1035.9772 × 1054.6921 × 1066.0335 × 1034.9609 × 1036.9109 × 1032.5038 × 1048.6746 × 1033.3521 × 103
Std6.2478 × 1034.7900 × 1031.6030 × 1052.7171 × 1066.1895 × 1033.0320 × 1035.4175 × 1034.6720 × 1049.0864 × 1031.3850 × 103
CEC2017-F20Ave4.5133 × 1035.6774 × 1034.6167 × 1036.0873 × 1035.0227 × 1035.4992 × 1034.9890 × 1035.7320 × 1034.3832 × 1034.3067 × 103
Std3.9588 × 1026.5777 × 1024.8729 × 1022.7658 × 1024.7156 × 1021.4038 × 1035.0777 × 1023.3659 × 1025.1315 × 1026.5664 × 102
CEC2017-F21Ave2.7132 × 1032.8101 × 1032.7456 × 1033.1871 × 1032.6387 × 1032.9009 × 1032.8686 × 1032.7763 × 1032.7793 × 1032.4481 × 103
Std6.8494 × 1016.4857 × 1015.9494 × 1013.3741 × 1015.0480 × 1012.1268 × 1021.0823 × 1021.4014 × 1025.8507 × 1012.0727 × 101
CEC2017-F22Ave1.9147 × 1042.3964 × 1041.4600 × 1042.3618 × 1041.8503 × 1042.2047 × 1042.2662 × 1042.9752 × 1041.8465 × 1043.0181 × 104
Std3.4351 × 1033.8542 × 1035.7353 × 1032.3026 × 1031.2258 × 1036.9765 × 1031.7331 × 1039.3367 × 1021.8855 × 1034.6507 × 103
CEC2017-F23Ave3.2901 × 1033.3057 × 1033.2787 × 1033.5467 × 1033.1765 × 1033.1796 × 1033.5807 × 1033.1279 × 1033.2147 × 1033.0198 × 103
Std6.1841 × 1018.6901 × 1016.0468 × 1012.3372 × 1014.8020 × 1015.6195 × 1011.6950 × 1025.1835 × 1015.0010 × 1013.2517 × 101
CEC2017-F24Ave3.8708 × 1033.9951 × 1033.6959 × 1034.1662 × 1033.6581 × 1033.6391 × 1034.2663 × 1033.6577 × 1033.7900 × 1033.4339 × 103
Std1.1900 × 1021.1000 × 1027.3386 × 1013.2190 × 1016.7183 × 1016.4127 × 1012.0348 × 1028.3090 × 1019.1430 × 1013.3121 × 101
CEC2017-F25Ave3.3821 × 1033.6049 × 1033.6035 × 1035.6725 × 1033.4252 × 1033.4859 × 1033.5348 × 1034.3815 × 1033.6110 × 1033.2703 × 103
Std5.1848 × 1019.8536 × 1016.9321 × 1011.6037 × 1026.6191 × 1015.0934 × 1017.9807 × 1013.0052 × 1021.2027 × 1025.0850 × 101
CEC2017-F26Ave1.1720 × 1041.4015 × 1041.4567 × 1041.5412 × 1041.0052 × 1049.4798 × 1031.3063 × 1049.6390 × 1031.3782 × 1047.0934 × 103
Std1.2317 × 1032.0469 × 1035.8420 × 1033.6692 × 1027.5648 × 1025.1247 × 1021.7015 × 1036.5037 × 1023.2203 × 1032.3801 × 102
CEC2017-F27Ave3.6557 × 1033.7558 × 1033.7740 × 1033.8946 × 1033.5658 × 1033.4287 × 1033.5226 × 1033.7109 × 1033.5892 × 1033.5068 × 103
Std9.4630 × 1011.0374 × 1021.2417 × 1026.0549 × 1019.9748 × 1014.0292 × 1016.2107 × 1017.9100 × 1017.5451 × 1013.6778 × 101
CEC2017-F28Ave3.4883 × 1033.8545 × 1033.7399 × 1036.9463 × 1033.5473 × 1033.5151 × 1033.7818 × 1036.2668 × 1033.7350 × 1033.4021 × 103
Std3.9728 × 1011.7091 × 1025.7352 × 1014.3816 × 1023.0065 × 1013.4859 × 1011.4084 × 1027.9983 × 1025.8356 × 1013.7373 × 101
CEC2017-F29Ave6.2833 × 1036.4310 × 1037.2054 × 1038.2914 × 1036.8524 × 1036.0556 × 1037.2724 × 1036.1302 × 1036.3823 × 1035.1616 × 103
Std5.1510 × 1024.4050 × 1024.8165 × 1023.1281 × 1025.2648 × 1025.5642 × 1026.2413 × 1027.1563 × 1025.1835 × 1023.6989 × 102
CEC2017-F30Ave5.1238 × 1041.8996 × 1054.0863 × 1062.1047 × 1079.0194 × 1042.7021 × 1047.0792 × 1046.2361 × 1065.7704 × 1041.1205 × 104
Std3.7408 × 1041.7521 × 1051.1122 × 1064.3527 × 1064.1427 × 1042.1326 × 1041.2400 × 1051.1453 × 1074.9220 × 1042.8422 × 103
Table 5. Performance Comparison of Different Algorithms on the 10-Dimensional CEC2020 Benchmark Functions.
Table 5. Performance Comparison of Different Algorithms on the 10-Dimensional CEC2020 Benchmark Functions.
IDItemsBHONDOGJASSLOLEESAORBMOESCSBOAMISBOA
CEC2020-F1Ave1.0000 × 1022.0320 × 1035.1276 × 1041.7130 × 1031.0000 × 1021.4940 × 1031.0000 × 1021.4128 × 1033.4987 × 1031.0000 × 102
Std0.0000 × 10002.2764 × 1031.5061 × 1041.4145 × 1036.1731 × 10−61.7886 × 1031.0998 × 10−91.8063 × 1033.8100 × 1030.0000 × 1000
CEC2020-F2Ave1.1673 × 1031.3691 × 1031.3519 × 1031.2821 × 1031.5156 × 1031.5442 × 1031.3842 × 1031.2153 × 1031.3187 × 1031.1353 × 103
Std6.6420 × 1011.9253 × 1021.6758 × 1028.7577 × 1011.9987 × 1022.4909 × 1021.4950 × 1029.5647 × 1011.5524 × 1026.7669 × 101
CEC2020- F3Ave7.1302 × 1027.2386 × 1027.1878 × 1027.2011 × 1027.1867 × 1027.1790 × 1027.1610 × 1027.1495 × 1027.1926 × 1027.1432 × 102
Std1.1134 × 10006.2820 × 10003.5085 × 10002.6383 × 10004.3009 × 10003.3847 × 10004.0017 × 10001.8063 × 10005.2250 × 10001.9631 × 1000
CEC2020- F4Ave1.9005 × 1031.9011 × 1031.9009 × 1031.9011 × 1031.9008 × 1031.9009 × 1031.9007 × 1031.9011 × 1031.9009 × 1031.9006 × 103
Std2.1196 × 10−15.2379 × 10−13.8904 × 10−12.2809 × 10−12.2350 × 10−13.4985 × 10−11.8610 × 10−12.0396 × 10−13.1218 × 10−12.0031 × 10−1
CEC2020- F5Ave1.8181 × 1035.4815 × 1033.1354 × 1031.2650 × 1041.7566 × 1033.3108 × 1031.7488 × 1035.1592 × 1032.9188 × 1031.7079 × 103
Std9.0924 × 1012.9586 × 1031.2181 × 1036.7002 × 1034.0437 × 1011.1072 × 1033.3008 × 1013.0830 × 1031.1159 × 1039.0020 × 1000
CEC2020- F6Ave1.6170 × 1031.6874 × 1031.7296 × 1031.6031 × 1031.6012 × 1031.6875 × 1031.6282 × 1031.6179 × 1031.6214 × 1031.6005 × 103
Std4.0928 × 1017.9769 × 1018.2648 × 1011.6116 × 10003.3895 × 10−19.4651 × 1015.1459 × 1013.9963 × 1014.5224 × 1012.3636 × 10−1
CEC2020- F7Ave2.1107 × 1032.4271 × 1033.5007 × 1032.8563 × 1032.1179 × 1038.4079 × 1032.1129 × 1032.6306 × 1032.2323 × 1032.1003 × 103
Std2.5176 × 1011.2338 × 1031.2997 × 1036.1264 × 1028.9514 × 10004.9000 × 1031.5142 × 1018.6007 × 1021.1022 × 1022.8797 × 10−1
CEC2020- F8Ave2.2941 × 1032.2992 × 1032.3042 × 1032.2974 × 1032.2922 × 1032.2982 × 1032.2978 × 1032.3003 × 1032.2941 × 1032.2933 × 103
Std2.3273 × 1011.4046 × 1019.9570 × 10−11.0513 × 1012.6286 × 1011.3058 × 1011.6289 × 1012.6509 × 10−12.4049 × 1012.5371 × 101
CEC2020- F9Ave2.6007 × 1032.6307 × 1032.7046 × 1032.6949 × 1032.6995 × 1032.7444 × 1032.7141 × 1032.7366 × 1032.7063 × 1032.6076 × 103
Std1.1717 × 1021.1994 × 1028.1504 × 1016.3528 × 1019.0782 × 1016.1567 × 10007.2693 × 1012.6107 × 10008.2351 × 1011.1705 × 102
CEC2020- F10Ave2.9178 × 1032.9268 × 1032.9231 × 1032.8942 × 1032.9091 × 1032.9366 × 1032.9140 × 1032.9351 × 1032.9122 × 1032.9133 × 103
Std2.2831 × 1012.3330 × 1012.2924 × 1013.3719 × 1012.0275 × 1011.9358 × 1012.2738 × 1012.0629 × 1012.1337 × 1012.2138 × 101
Table 6. Performance Comparison of Different Algorithms on the 20-Dimensional CEC2020 Benchmark Functions.
Table 6. Performance Comparison of Different Algorithms on the 20-Dimensional CEC2020 Benchmark Functions.
IDItemsBHONDOGJASSLOLEESAORBMOESCSBOAMISBOA
CEC2020-F1Ave1.0000 × 1022.6474 × 1033.6400 × 1059.6632 × 1041.0003 × 1021.8602 × 1031.0006 × 1021.4788 × 1033.8620 × 1031.0000 × 102
Std5.2596 × 10−72.6801 × 1036.0721 × 1044.9678 × 1043.3184 × 10−22.5999 × 1039.5109 × 10−21.6985 × 1033.8546 × 1032.6389 × 10−15
CEC2020-F2Ave1.3133 × 1031.6728 × 1031.7697 × 1031.7812 × 1032.3493 × 1032.1489 × 1032.4181 × 1031.3455 × 1031.8534 × 1031.2239 × 103
Std1.2688 × 1022.7333 × 1023.1742 × 1021.3158 × 1025.4236 × 1024.3716 × 1023.6818 × 1022.1398 × 1023.2082 × 1021.1880 × 102
CEC2020- F3Ave7.2467 × 1027.6072 × 1027.5152 × 1027.5446 × 1027.4120 × 1027.4191 × 1027.4805 × 1027.3167 × 1027.4779 × 1027.2780 × 102
Std1.9301 × 10002.9888 × 1017.1785 × 10005.3007 × 10007.8036 × 10007.4569 × 10008.3167 × 10004.7777 × 10001.1321 × 1013.5604 × 1000
CEC2020- F4Ave1.9012 × 1031.9034 × 1031.9060 × 1031.9038 × 1031.9028 × 1031.9025 × 1031.9025 × 1031.9033 × 1031.9027 × 1031.9015 × 103
Std2.8079 × 10−11.8456 × 10001.6494 × 10004.6540 × 10−11.1288 × 10001.8444 × 10009.1032 × 10−16.5264 × 10−19.5541 × 10−13.4225 × 10−1
CEC2020- F5Ave2.5462 × 1038.7376 × 1049.7698 × 1044.3548 × 1052.5373 × 1031.0054 × 1052.1211 × 1032.2152 × 1051.1113 × 1051.8584 × 103
Std3.1032 × 1025.9723 × 1043.4071 × 1042.4844 × 1052.5393 × 1025.0959 × 1041.2771 × 1021.7251 × 1059.7544 × 1047.7977 × 101
CEC2020- F6Ave1.6032 × 1031.7148 × 1031.6912 × 1031.6114 × 1031.6182 × 1031.8301 × 1031.7152 × 1031.6133 × 1031.6486 × 1031.6023 × 103
Std2.2062 × 10009.8260 × 1017.8896 × 1013.0660 × 10001.0292 × 1011.6252 × 1021.4309 × 1022.2822 × 1017.2413 × 1011.5090 × 1000
CEC2020- F7Ave2.3531 × 1038.9650 × 1044.8649 × 1041.0608 × 1052.7291 × 1039.2191 × 1042.4673 × 1038.4762 × 1043.0750 × 1042.1406 × 103
Std1.3704 × 1028.6398 × 1043.4140 × 1046.3115 × 1041.8521 × 1028.6143 × 1041.1016 × 1028.5509 × 1043.2334 × 1045.1018 × 101
CEC2020- F8Ave2.3004 × 1032.3008 × 1032.3081 × 1032.3019 × 1032.5158 × 1032.3537 × 1032.4607 × 1032.4741 × 1032.3003 × 1032.3000 × 103
Std5.5270 × 10−17.0819 × 10−18.8076 × 10−15.3323 × 10−16.6153 × 1022.9269 × 1026.1192 × 1026.6256 × 1026.1521 × 10−11.1942 × 10−13
CEC2020- F9Ave2.8122 × 1032.8420 × 1032.8279 × 1032.8326 × 1032.8284 × 1032.8295 × 1032.8368 × 1032.8315 × 1032.8224 × 1032.8050 × 103
Std5.2927 × 10002.3999 × 1011.2236 × 1016.0194 × 10001.1552 × 1011.1981 × 1011.2564 × 1011.1963 × 1011.2817 × 1014.0310 × 1000
CEC2020- F10Ave2.9146 × 1032.9511 × 1032.9701 × 1032.9176 × 1032.9219 × 1032.9259 × 1032.9246 × 1032.9211 × 1032.9342 × 1032.9136 × 103
Std6.8313 × 10003.3864 × 1012.6325 × 1014.1139 × 10002.2081 × 1012.3885 × 1012.3990 × 1011.7529 × 1012.8985 × 1016.6357 × 10−1
Table 7. Experimental Results of the Wilcoxon Signed-Rank Test. (W/T/L).
Table 7. Experimental Results of the Wilcoxon Signed-Rank Test. (W/T/L).
MISBOA.VSBHONDOGJASSLOLEESAORBMOESCSBOA
CEC2014 (dim = 30)23/7/027/2/128/2/028/1/122/2/627/2/128/1/125/4/123/3/4
CEC2017 (dim = 30)27/2/130/0/029/1/030/0/029/1/029/1/029/1/028/2/028/2/0
CEC2017 (dim = 100)24/3/328/0/226/1/328/0/225/2/326/1/326/2/228/1/126/1/3
CEC2020 (dim = 10)5/3/29/1/09/1/08/2/08/2/010/0/08/2/010/0/09/1/0
CEC2020 (dim = 20)7/1/210/0/010/0/010/0/010/0/09/1/010/0/09/1/010/0/0
Table 8. Friedman mean rank test result.
Table 8. Friedman mean rank test result.
SuitesCEC2014CEC2017CEC2020
Dimensions30301001020
Algorithms M . R T . R M . R T . R M . R T . R M . R T . R M . R T . R
BHO2.3023.1023.9032.2022.102
NDO6.4376.6786.7387.5087.008
GJA7.4797.6096.1777.90107.809
SSLO8.40109.77109.70107.1078.4010
LEE4.3734.5333.6725.3045.003
SAO7.0085.5055.2757.7096.207
RBMO5.3344.5335.2044.8035.704
ESC6.1766.5777.0095.6055.906
SBOA5.5355.7065.5065.6055.704
MISBOA2.0011.0311.8711.3011.201
Table 9. Experimental results compared with CEC winner algorithm.
Table 9. Experimental results compared with CEC winner algorithm.
AlgorithmItemsLSHADELSHADE-SPACMALSHADE-cnEpSinMISBOA
CEC2017-F1Ave1.0708 × 1021.0001 × 1021.7712 × 1031.0000 × 102
Std1.7515 × 1014.8689 × 10−22.4661 × 1032.0270 × 10−14
CEC2017-F3Ave4.3045 × 1033.5032 × 1043.9070 × 1033.0000 × 102
Std2.0679 × 1045.4744 × 1046.6174 × 1031.8533 × 10−10
CEC2017-F4Ave4.6797 × 1024.5903 × 1024.8859 × 1024.3582 × 102
Std2.1733 × 1013.3214 × 1012.8736 × 1012.6922 × 101
CEC2017-F5Ave5.2977 × 1025.3351 × 1025.3480 × 1025.2040 × 102
Std4.8004 × 10005.2945 × 10006.2344 × 10005.3405 × 1000
CEC2017-F6Ave6.0009 × 1026.0035 × 1026.0067 × 1026.0000 × 102
Std1.1217 × 10−13.5811 × 10−14.8942 × 10−11.9196 × 10−6
CEC2017-F7Ave7.6497 × 1027.6628 × 1027.6962 × 1027.4610 × 102
Std7.7942 × 10008.9243 × 10009.1815 × 10004.7083 × 1000
CEC2017-F8Ave8.2823 × 1028.3177 × 1028.3493 × 1028.1987 × 102
Std6.3110 × 10008.2330 × 10005.2959 × 10005.8919 × 1000
CEC2017-F9Ave9.2084 × 1029.2396 × 1029.2642 × 1029.0001 × 102
Std1.5364 × 1012.9162 × 1012.3478 × 1012.7318 × 10−2
CEC2017-F10Ave3.5280 × 1033.7472 × 1033.7694 × 1033.3798 × 103
Std3.0783 × 1024.4807 × 1023.3263 × 1025.7834 × 102
CEC2017-F11Ave1.1932 × 1031.2112 × 1031.2193 × 1031.1251 × 103
Std4.5062 × 1014.4834 × 1014.3971 × 1012.5571 × 101
CEC2017-F12Ave2.6469 × 1042.9180 × 1042.7267 × 1042.5468 × 103
Std2.0869 × 1042.0623 × 1041.5669 × 1045.6942 × 102
CEC2017-F13Ave1.6453 × 1034.5828 × 1034.1883 × 1031.3452 × 103
Std2.0936 × 1021.6759 × 1031.1327 × 1033.2223 × 101
CEC2017-F14Ave1.4891 × 1031.5474 × 1031.5493 × 1031.4281 × 103
Std2.8302 × 1015.1296 × 1014.5612 × 1013.6879 × 1000
CEC2017-F15Ave1.6953 × 1031.8583 × 1031.9588 × 1031.5176 × 103
Std1.2336 × 1029.7534 × 1011.9385 × 1026.9654 × 1000
CEC2017-F16Ave2.1973 × 1032.2197 × 1032.0098 × 1031.9806 × 103
Std2.2161 × 1022.0916 × 1021.9007 × 1022.3374 × 102
CEC2017-F17Ave1.8120 × 1031.8293 × 1031.8281 × 1031.7369 × 103
Std4.4827 × 1015.4628 × 1016.3643 × 1017.6043 × 1000
CEC2017-F18Ave2.0552 × 1037.9281 × 1036.0787 × 1031.8657 × 103
Std2.1935 × 1027.1912 × 1034.3390 × 1033.4847 × 101
CEC2017-F19Ave1.9953 × 1032.0495 × 1032.0631 × 1031.9130 × 103
Std5.4975 × 1018.1484 × 1016.6187 × 1013.8464 × 1000
CEC2017-F20Ave2.2023 × 1032.2135 × 1032.1694 × 1032.0936 × 103
Std8.0431 × 1011.0684 × 1026.7029 × 1016.0960 × 101
CEC2017-F21Ave2.3295 × 1032.3346 × 1032.3381 × 1032.3185 × 103
Std5.6685 × 10006.5256 × 10008.2807 × 10006.7052 × 1000
CEC2017-F22Ave2.4894 × 1032.3012 × 1032.3798 × 1032.3000 × 103
Std7.0965 × 1021.7589 × 10004.3251 × 1021.4626 × 10−13
CEC2017-F23Ave2.6797 × 1032.6870 × 1032.6885 × 1032.6598 × 103
Std6.1832 × 10008.7358 × 10009.3977 × 10009.6610 × 1000
CEC2017-F24Ave2.8487 × 1032.8611 × 1032.8574 × 1032.8339 × 103
Std5.3234 × 10001.0471 × 1011.1075 × 1015.6674 × 1000
CEC2017-F25Ave2.8886 × 1032.8914 × 1032.8893 × 1032.8869 × 103
Std6.8082 × 10009.1486 × 10003.8007 × 10008.2095 × 10−2
CEC2017-F26Ave3.8914 × 1033.9787 × 1033.9573 × 1033.6409 × 103
Std1.2628 × 1022.4512 × 1022.5347 × 1029.3325 × 101
CEC2017-F27Ave3.2163 × 1033.2222 × 1033.2174 × 1033.2107 × 103
Std9.9239 × 10009.9340 × 10001.0903 × 1017.2401 × 1000
CEC2017-F28Ave3.1916 × 1033.1553 × 1033.2064 × 1033.1290 × 103
Std5.4058 × 1015.9772 × 1013.6538 × 1014.8940 × 101
CEC2017-F29Ave3.4567 × 1033.4442 × 1033.4773 × 1033.3715 × 103
Std6.0365 × 1016.8641 × 1016.8330 × 1011.9535 × 101
CEC2017-F30Ave5.8124 × 1038.5509 × 1037.9381 × 1035.2900 × 103
Std6.6711 × 1023.2951 × 1032.6561 × 1031.6663 × 102
Table 10. Strategy effectiveness analysis experimental results.
Table 10. Strategy effectiveness analysis experimental results.
SuitesCEC2014CEC2017CEC2020
Dimensions30301001020
Algorithms M . R T . R M . R T . R M . R T . R M . R T . R M . R T . R
SBOA4.4054.9754.8354.2054.405
SBOA13.4343.5043.4043.8043.904
SBOA23.1032.8333.1333.0023.103
SBOA32.5722.6722.3023.0022.602
MISBOA1.5011.0311.3311.0011.001
Table 11. Ave and Std of the optimal fitness values with Otsu as the objective function.
Table 11. Ave and Std of the optimal fitness values with Otsu as the objective function.
ImageThresholdMetricBHONDOGJASSLOLEESAORBMOESCSBOAMISBOA
baboon4Ave1.008 × 1031.008 × 1031.008 × 1031.008 × 1031.008 × 1031.008 × 1031.008 × 1031.008 × 1031.008 × 1031.008 × 103
Std7.357 × 10−39.781 × 10−22.313 × 10−138.290 × 10−22.313 × 10−132.313 × 10−132.313 × 10−131.873 × 10−24.823 × 10−34.823 × 10−3
6Ave1.036 × 1031.002 × 1031.036 × 1031.036 × 1031.036 × 1031.036 × 1031.036 × 1031.036 × 1031.036 × 1031.036 × 103
Std3.299 × 10−21.892 × 1021.600 × 10−22.586 × 10−14.625 × 10−132.194 × 10−21.836 × 10−22.540 × 10−13.795 × 10−35.532 × 10−4
8Ave1.049 × 1037.690 × 1021.049 × 1038.380 × 1021.049 × 1031.049 × 1031.014 × 1031.048 × 1031.049 × 1031.049 × 103
Std1.739 × 10−14.717 × 1025.449 × 10−24.262 × 1023.416 × 10−35.035 × 10−21.915 × 1024.951 × 10−14.070 × 10−28.525 × 10−2
10Ave1.055 × 1034.221 × 1021.055 × 1035.965 × 1021.056 × 1031.020 × 1038.444 × 1021.054 × 1039.851 × 1021.056 × 103
Std2.146 × 10−15.258 × 1021.358 × 10−15.305 × 1022.799 × 10−21.927 × 1024.294 × 1024.437 × 10−12.678 × 1026.553 × 10−2
bank4Ave3.602 × 1033.602 × 1033.602 × 1033.602 × 1033.602 × 1033.602 × 1033.602 × 1033.602 × 1033.602 × 1033.602 × 103
Std2.776 × 10−23.824 × 10−22.957 × 10−31.088 × 10−11.850 × 10−122.183 × 10−13.139 × 10−32.454 × 10−15.688 × 10−32.957 × 10−3
6Ave3.681 × 1033.681 × 1033.681 × 1033.680 × 1033.681 × 1033.681 × 1033.681 × 1033.680 × 1033.681 × 1033.681 × 103
Std6.435 × 10−27.107 × 10−12.099 × 10−28.351 × 10−11.388 × 10−121.548 × 10−23.033 × 10−29.351 × 10−12.164 × 10−21.388 × 10−12
8Ave3.711 × 1033.711 × 1033.712 × 1033.710 × 1033.712 × 1033.711 × 1033.711 × 1033.709 × 1033.711 × 1033.712 × 103
Std2.104 × 10−11.322 × 10005.751 × 10−28.201 × 10−18.268 × 10−31.745 × 10003.917 × 10−11.204 × 10004.103 × 10−12.077 × 10−1
10Ave3.727 × 1033.727 × 1033.728 × 1033.725 × 1033.728 × 1033.727 × 1033.727 × 1033.724 × 1033.727 × 1033.728 × 103
Std5.755 × 10−11.304 × 10001.962 × 10−11.129 × 10003.469 × 10−31.279 × 10008.652 × 10−11.088 × 10009.422 × 10−13.982 × 10−1
barbara4Ave2.645 × 1032.645 × 1032.645 × 1032.645 × 1032.645 × 1032.645 × 1032.645 × 1032.645 × 1032.645 × 1032.645 × 103
Std1.850 × 10−121.464 × 10−21.850 × 10−127.256 × 10−21.850 × 10−121.850 × 10−121.850 × 10−124.736 × 10−21.850 × 10−121.850 × 10−12
6Ave2.701 × 1032.701 × 1032.702 × 1032.701 × 1032.702 × 1032.702 × 1032.702 × 1032.701 × 1032.702 × 1032.702 × 103
Std4.806 × 10−24.179 × 10−11.692 × 10−25.258 × 10−19.250 × 10−131.167 × 10−24.875 × 10−26.425 × 10−11.017 × 10−29.250 × 10−13
8Ave2.727 × 1032.727 × 1032.727 × 1032.726 × 1032.727 × 1032.727 × 1032.727 × 1032.725 × 1032.727 × 1032.727 × 103
Std9.586 × 10−23.919 × 10−13.799 × 10−25.743 × 10−14.625 × 10−132.125 × 10−23.254 × 10−17.797 × 10−15.484 × 10−22.079 × 10−2
10Ave2.739 × 1032.739 × 1032.740 × 1032.738 × 1032.740 × 1032.740 × 1032.739 × 1032.737 × 1032.740 × 1032.740 × 103
Std3.057 × 10−11.140 × 10002.730 × 10−16.164 × 10−11.327 × 10−22.295 × 10−14.912 × 10−18.514 × 10−14.416 × 10−19.999 × 10−2
boat4Ave1.970 × 1031.970 × 1031.970 × 1031.970 × 1031.970 × 1031.970 × 1031.970 × 1031.970 × 1031.970 × 1031.970 × 103
Std2.376 × 10−32.694 × 10−20.000 × 10001.342 × 10−10.000 × 10000.000 × 10000.000 × 10004.724 × 10−20.000 × 10000.000 × 1000
6Ave2.025 × 1032.025 × 1032.025 × 1032.024 × 1032.025 × 1032.025 × 1032.025 × 1032.025 × 1032.025 × 1032.025 × 103
Std8.649 × 10−29.811 × 10−22.050 × 10−25.452 × 10−11.156 × 10−121.837 × 10−22.599 × 10−23.903 × 10−12.405 × 10−27.595 × 10−3
8Ave2.049 × 1032.048 × 1032.049 × 1032.047 × 1032.049 × 1032.049 × 1032.049 × 1032.047 × 1032.049 × 1032.049 × 103
Std1.587 × 10−17.285 × 10−14.102 × 10−26.925 × 10−11.307 × 10−32.958 × 10−22.787 × 10−19.528 × 10−12.484 × 10−15.789 × 10−2
10Ave2.060 × 1032.060 × 1032.061 × 1032.059 × 1032.061 × 1032.061 × 1032.061 × 1032.059 × 1032.061 × 1032.061 × 103
Std3.238 × 10−16.520 × 10−11.551 × 10−15.862 × 10−11.344 × 10−21.674 × 10−12.361 × 10−17.034 × 10−12.476 × 10−11.490 × 10−1
brain4Ave3.731 × 1033.731 × 1033.731 × 1033.731 × 1033.731 × 1033.731 × 1033.731 × 1033.731 × 1033.731 × 1033.731 × 103
Std2.313 × 10−125.278 × 10−22.313 × 10−123.779 × 10−22.313 × 10−122.313 × 10−122.313 × 10−124.472 × 10−22.313 × 10−122.313 × 10−12
6Ave3.752 × 1033.751 × 1033.751 × 1033.751 × 1033.751 × 1033.751 × 1033.751 × 1033.751 × 1033.751 × 1033.751 × 103
Std8.481 × 10−26.276 × 10−14.957 × 10−12.890 × 10−14.166 × 10−15.986 × 10−13.631 × 10−15.265 × 10−16.086 × 10−15.403 × 10−1
8Ave3.764 × 1033.763 × 1033.764 × 1033.763 × 1033.764 × 1033.763 × 1033.764 × 1033.763 × 1033.764 × 1033.764 × 103
Std1.417 × 10−18.931 × 10−12.822 × 10−22.554 × 10−15.019 × 10−31.255 × 10009.029 × 10−25.291 × 10−17.783 × 10−26.148 × 10−2
10Ave3.769 × 1033.769 × 1033.769 × 1033.769 × 1033.769 × 1033.769 × 1033.769 × 1033.768 × 1033.769 × 1033.769 × 103
Std1.224 × 10−13.473 × 10−19.266 × 10−22.411 × 10−12.170 × 10−28.466 × 10−21.374 × 10−13.721 × 10−11.247 × 10−12.270 × 10−1
bridge4Ave2.640 × 1032.640 × 1032.640 × 1032.640 × 1032.640 × 1032.640 × 1032.640 × 1032.640 × 1032.640 × 1032.640 × 103
Std6.308 × 10−33.850 × 10−21.388 × 10−127.806 × 10−21.388 × 10−121.388 × 10−121.388 × 10−121.691 × 10−11.388 × 10−121.388 × 10−12
6Ave2.719 × 1032.718 × 1032.719 × 1032.718 × 1032.719 × 1032.719 × 1032.719 × 1032.718 × 1032.719 × 1032.719 × 103
Std7.795 × 10−25.065 × 10−11.242 × 10−27.046 × 10−12.313 × 10−122.204 × 10−27.592 × 10−28.565 × 10−11.690 × 10−21.074 × 10−2
8Ave2.752 × 1032.751 × 1032.752 × 1032.750 × 1032.752 × 1032.752 × 1032.752 × 1032.750 × 1032.752 × 1032.752 × 103
Std2.085 × 10−19.252 × 10−14.128 × 10−21.026 × 10005.943 × 10−32.048 × 10−23.281 × 10−11.165 × 10001.005 × 10−12.886 × 10−2
10Ave2.768 × 1032.767 × 1032.768 × 1032.766 × 1032.768 × 1032.768 × 1032.768 × 1032.766 × 1032.768 × 1032.768 × 103
Std4.287 × 10−11.534 × 10001.480 × 10−17.036 × 10−12.744 × 10−26.493 × 10−13.813 × 10−18.860 × 10−12.553 × 10−16.314 × 10−1
camera4Ave4.601 × 1034.600 × 1034.600 × 1034.601 × 1034.600 × 1034.599 × 1034.601 × 1034.601 × 1034.601 × 1034.601 × 103
Std6.121 × 10−11.125 × 10001.018 × 10003.118 × 10−19.838 × 10−11.267 × 10006.774 × 10−35.419 × 10−18.166 × 10−11.116 × 10−2
6Ave4.652 × 1034.652 × 1034.652 × 1034.651 × 1034.652 × 1034.652 × 1034.652 × 1034.651 × 1034.652 × 1034.652 × 103
Std6.146 × 10−23.386 × 10−18.109 × 10−34.799 × 10−19.250 × 10−133.344 × 10−36.793 × 10−23.450 × 10−13.532 × 10−37.707 × 10−3
8Ave4.670 × 1034.670 × 1034.669 × 1034.669 × 1034.669 × 1034.670 × 1034.670 × 1034.669 × 1034.670 × 1034.670 × 103
Std5.763 × 10−19.557 × 10−16.473 × 10−17.773 × 10−16.870 × 10−17.990 × 10−18.342 × 10−16.971 × 10−18.696 × 10−18.593 × 10−1
10Ave4.681 × 1034.680 × 1034.681 × 1034.679 × 1034.681 × 1034.681 × 1034.681 × 1034.679 × 1034.681 × 1034.681 × 103
Std1.987 × 10−11.246 × 10001.085 × 10−16.064 × 10−14.589 × 10−24.651 × 10−24.228 × 10−17.403 × 10−11.043 × 10−13.906 × 10−1
cell4Ave2.567 × 1032.567 × 1032.567 × 1032.567 × 1032.567 × 1032.567 × 1032.567 × 1032.567 × 1032.567 × 1032.567 × 103
Std5.157 × 10−39.250 × 10−139.250 × 10−134.078 × 10−29.250 × 10−139.250 × 10−139.250 × 10−133.711 × 10−39.250 × 10−139.250 × 10−13
6Ave2.596 × 1032.596 × 1032.596 × 1032.596 × 1032.596 × 1032.596 × 1032.596 × 1032.596 × 1032.596 × 1032.596 × 103
Std9.540 × 10−22.254 × 10−11.417 × 10−12.079 × 10−11.338 × 10−11.443 × 10−11.484 × 10−11.685 × 10−11.166 × 10−18.480 × 10−2
8Ave2.612 × 1032.612 × 1032.612 × 1032.611 × 1032.612 × 1032.612 × 1032.612 × 1032.611 × 1032.612 × 1032.612 × 103
Std1.108 × 10−14.209 × 10−11.781 × 10−13.816 × 10−11.511 × 10−35.411 × 10−29.064 × 10−23.157 × 10−11.087 × 10−14.626 × 10−2
10Ave2.619 × 1032.619 × 1032.619 × 1032.618 × 1032.620 × 1032.619 × 1032.619 × 1032.618 × 1032.620 × 1032.620 × 103
Std2.674 × 10−15.644 × 10−13.128 × 10−15.584 × 10−14.021 × 10−36.670 × 10−14.164 × 10−13.553 × 10−13.119 × 10−13.201 × 10−1
columbia4Ave1.827 × 1031.827 × 1031.827 × 1031.827 × 1031.827 × 1031.827 × 1031.827 × 1031.827 × 1031.827 × 1031.827 × 103
Std9.250 × 10−132.239 × 10−29.250 × 10−137.610 × 10−29.250 × 10−131.075 × 10−37.197 × 10−43.142 × 10−29.250 × 10−139.250 × 10−13
6Ave1.878 × 1031.878 × 1031.878 × 1031.877 × 1031.878 × 1031.878 × 1031.878 × 1031.878 × 1031.878 × 1031.878 × 103
Std2.831 × 10−23.070 × 10−11.985 × 10−22.857 × 10−16.938 × 10−132.776 × 10−24.494 × 10−25.555 × 10−13.277 × 10−22.655 × 10−3
8Ave1.899 × 1031.899 × 1031.899 × 1031.898 × 1031.899 × 1031.899 × 1031.899 × 1031.898 × 1031.899 × 1031.899 × 103
Std9.978 × 10−28.472 × 10−16.044 × 10−25.039 × 10−19.072 × 10−33.866 × 10−21.108 × 10−16.579 × 10−14.299 × 10−22.129 × 10−2
10Ave1.910 × 1031.910 × 1031.910 × 1031.908 × 1031.910 × 1031.910 × 1031.910 × 1031.908 × 1031.910 × 1031.910 × 103
Std2.226 × 10−16.125 × 10−11.688 × 10−16.336 × 10−14.588 × 10−31.607 × 10−12.833 × 10−16.890 × 10−11.852 × 10−14.951 × 10−2
couple4Ave1.733 × 1031.733 × 1031.733 × 1031.733 × 1031.733 × 1031.733 × 1031.733 × 1031.733 × 1031.733 × 1031.733 × 103
Std2.928 × 10−21.957 × 10−11.156 × 10−129.090 × 10−21.156 × 10−121.588 × 10−29.365 × 10−31.592 × 10−11.588 × 10−21.156 × 10−12
6Ave1.799 × 1031.799 × 1031.799 × 1031.798 × 1031.799 × 1031.799 × 1031.799 × 1031.798 × 1031.799 × 1031.799 × 103
Std8.390 × 10−29.501 × 10−22.431 × 10−26.145 × 10−12.367 × 10−31.792 × 10−23.931 × 10−27.056 × 10−11.401 × 10−22.367 × 10−3
8Ave1.826 × 1031.826 × 1031.826 × 1031.825 × 1031.826 × 1031.826 × 1031.826 × 1031.825 × 1031.826 × 1031.826 × 103
Std1.840 × 10−17.990 × 10−15.759 × 10−28.329 × 10−10.000 × 10001.800 × 10−21.184 × 10−19.247 × 10−11.309 × 10−12.180 × 10−2
10Ave1.839 × 1031.839 × 1031.840 × 1031.838 × 1031.840 × 1031.840 × 1031.839 × 1031.837 × 1031.839 × 1031.840 × 103
Std4.315 × 10−11.314 × 10001.323 × 10−16.939 × 10−17.430 × 10−32.443 × 10−13.022 × 10−19.746 × 10−15.120 × 10−11.463 × 10−1
Table 12. Ave and Std of all test images for PSNR in Otsu.
Table 12. Ave and Std of all test images for PSNR in Otsu.
ImageThresholdMetricBHONDOGJASSLOLEESAORBMOESCSBOAMISBOA
baboon4Ave2.0043 × 1012.0013 × 1012.0043 × 1011.9984 × 1012.0043 × 1012.0043 × 1012.0043 × 1012.0027 × 1012.0038 × 1012.0038 × 101
Std1.8220 × 10−39.3751 × 10−27.2269 × 10−151.5140 × 10−17.2269 × 10−157.2269 × 10−157.2269 × 10−154.9761 × 10−22.8753 × 10−22.8753 × 10−2
6Ave2.2783 × 1012.2199 × 1012.2788 × 1012.2706 × 1012.2732 × 1012.2729 × 1012.2733 × 1012.2634 × 1012.2772 × 1012.2747 × 101
Std1.6022 × 10−13.1269 × 10001.3727 × 10−14.5581 × 10−17.2269 × 10−157.9669 × 10−25.2945 × 10−24.4727 × 10−11.1033 × 10−15.6263 × 10−2
8Ave2.5170 × 1011.9878 × 1012.5180 × 1012.1069 × 1012.5346 × 1012.5187 × 1012.4900 × 1012.4725 × 1012.5248 × 1012.5180 × 101
Std4.9283 × 10−18.6792 × 10003.0325 × 10−17.7697 × 10004.0809 × 10−23.5620 × 10−11.0685 × 10007.3364 × 10−13.7311 × 10−13.9277 × 10−1
10Ave2.6875 × 1011.4206 × 1012.6782 × 1011.7943 × 1012.6825 × 1012.6506 × 1012.5146 × 1012.6034 × 1012.6305 × 1012.6810 × 101
Std5.0870 × 10−11.0532 × 1013.5161 × 10−11.0714 × 1011.0775 × 10−11.8776 × 10003.8589 × 10008.3462 × 10−13.4924 × 10003.0576 × 10−1
bank4Ave2.0250 × 1012.0247 × 1012.0253 × 1012.0234 × 1012.0254 × 1012.0245 × 1012.0253 × 1012.0236 × 1012.0252 × 1012.0253 × 101
Std1.2877 × 10−21.3920 × 10−22.3359 × 10−31.9698 × 10−21.4454 × 10−142.7991 × 10−23.4256 × 10−32.9514 × 10−25.0318 × 10−32.3359 × 10−3
6Ave2.3098 × 1012.3087 × 1012.3105 × 1012.3003 × 1012.3097 × 1012.3101 × 1012.3100 × 1012.3082 × 1012.3101 × 1012.3097 × 101
Std1.2198 × 10−24.7784 × 10−26.9615 × 10−37.7247 × 10−23.6134 × 10−155.6647 × 10−34.7340 × 10−36.0110 × 10−21.1827 × 10−23.6134 × 10−15
8Ave2.5276 × 1012.5212 × 1012.5284 × 1012.5094 × 1012.5293 × 1012.5258 × 1012.5274 × 1012.5107 × 1012.5282 × 1012.5296 × 101
Std4.6213 × 10−21.3222 × 10−11.7980 × 10−21.0749 × 10−11.3611 × 10−21.6128 × 10−13.6399 × 10−21.3672 × 10−14.1472 × 10−21.8264 × 10−2
10Ave2.6852 × 1012.6815 × 1012.6918 × 1012.6607 × 1012.6931 × 1012.6884 × 1012.6873 × 1012.6588 × 1012.6890 × 1012.6909 × 101
Std8.3915 × 10−21.5534 × 10−13.8050 × 10−21.3514 × 10−18.2387 × 10−31.5275 × 10−19.3005 × 10−21.4243 × 10−11.0596 × 10−17.9087 × 10−2
barbara4Ave1.8769 × 1011.8769 × 1011.8769 × 1011.8772 × 1011.8769 × 1011.8769 × 1011.8769 × 1011.8769 × 1011.8769 × 1011.8769 × 101
Std7.2269 × 10−152.3013 × 10−47.2269 × 10−151.9208 × 10−27.2269 × 10−157.2269 × 10−157.2269 × 10−151.9589 × 10−27.2269 × 10−157.2269 × 10−15
6Ave2.1076 × 1012.1117 × 1012.1067 × 1012.1064 × 1012.1054 × 1012.1056 × 1012.1072 × 1012.1061 × 1012.1063 × 1012.1054 × 101
Std3.7126 × 10−29.0396 × 10−22.7941 × 10−21.6756 × 10−10.0000 × 10001.1628 × 10−23.3870 × 10−21.3449 × 10−12.2699 × 10−20.0000 × 1000
8Ave2.3107 × 1012.3161 × 1012.3113 × 1012.2993 × 1012.3183 × 1012.3149 × 1012.3175 × 1012.2827 × 1012.3111 × 1012.3163 × 101
Std1.5207 × 10−12.5714 × 10−11.0024 × 10−13.5611 × 10−11.0840 × 10−146.1531 × 10−21.2344 × 10−13.1101 × 10−11.1358 × 10−15.8799 × 10−2
10Ave2.4595 × 1012.4585 × 1012.4634 × 1012.4525 × 1012.4636 × 1012.4631 × 1012.4600 × 1012.4207 × 1012.4550 × 1012.4641 × 101
Std2.0911 × 10−12.3445 × 10−11.7159 × 10−13.6423 × 10−15.2702 × 10−21.1395 × 10−12.0340 × 10−15.6873 × 10−12.8118 × 10−18.2002 × 10−2
boat4Ave1.9897 × 1011.9901 × 1011.9898 × 1011.9892 × 1011.9898 × 1011.9898 × 1011.9898 × 1011.9898 × 1011.9898 × 1011.9898 × 101
Std1.2417 × 10−31.2035 × 10−21.0840 × 10−144.7619 × 10−21.0840 × 10−141.0840 × 10−141.0840 × 10−141.9761 × 10−21.0840 × 10−141.0840 × 10−14
6Ave2.3032 × 1012.3036 × 1012.3045 × 1012.2965 × 1012.3062 × 1012.3039 × 1012.3042 × 1012.2971 × 1012.3032 × 1012.3058 × 101
Std5.2951 × 10−25.1484 × 10−22.5596 × 10−21.4360 × 10−11.0840 × 10−143.5706 × 10−24.0395 × 10−28.7513 × 10−23.2469 × 10−21.0742 × 10−2
8Ave2.5054 × 1012.5088 × 1012.5086 × 1012.5125 × 1012.5128 × 1012.5115 × 1012.5137 × 1012.4897 × 1012.5107 × 1012.5093 × 101
Std1.2334 × 10−11.7846 × 10−17.1810 × 10−22.9238 × 10−15.0066 × 10−25.9528 × 10−29.6351 × 10−23.1784 × 10−11.2537 × 10−16.6630 × 10−2
10Ave2.6904 × 1012.6848 × 1012.6872 × 1012.6734 × 1012.6992 × 1012.7013 × 1012.6895 × 1012.6471 × 1012.6783 × 1012.6883 × 101
Std2.7577 × 10−13.3114 × 10−12.1533 × 10−13.5248 × 10−12.8711 × 10−21.5284 × 10−12.1437 × 10−13.7559 × 10−12.9500 × 10−11.9512 × 10−1
brain4Ave2.5074 × 1012.5074 × 1012.5080 × 1012.5067 × 1012.5066 × 1012.5072 × 1012.5056 × 1012.5079 × 1012.5060 × 1012.5084 × 101
Std5.2921 × 10−25.4889 × 10−25.5675 × 10−27.4146 × 10−24.8494 × 10−25.8925 × 10−24.7507 × 10−24.8104 × 10−25.2566 × 10−24.7593 × 10−2
6Ave2.7315 × 1012.7510 × 1012.7572 × 1012.7195 × 1012.7556 × 1012.7474 × 1012.7324 × 1012.7329 × 1012.7489 × 1012.7410 × 101
Std9.9469 × 10−22.2300 × 10−11.2711 × 10−11.4883 × 10−19.7655 × 10−21.9204 × 10−11.1499 × 10−12.4033 × 10−11.6065 × 10−11.3366 × 10−1
8Ave2.9518 × 1012.9438 × 1012.9532 × 1012.9290 × 1012.9554 × 1012.9494 × 1012.9509 × 1012.9309 × 1012.9534 × 1012.9555 × 101
Std1.0328 × 10−11.7318 × 10−17.7984 × 10−21.8247 × 10−15.8882 × 10−22.0732 × 10−19.2775 × 10−21.8462 × 10−16.3379 × 10−26.2975 × 10−2
10Ave3.0948 × 1013.0910 × 1013.1031 × 1013.0692 × 1013.1096 × 1013.0978 × 1013.0940 × 1013.0669 × 1013.0980 × 1013.0980 × 101
Std1.3441 × 10−11.8819 × 10−11.3002 × 10−12.2361 × 10−18.2212 × 10−21.6043 × 10−11.7196 × 10−12.2679 × 10−11.9969 × 10−12.0238 × 10−1
bridge4Ave1.8547 × 1011.8563 × 1011.8546 × 1011.8562 × 1011.8546 × 1011.8546 × 1011.8546 × 1011.8551 × 1011.8546 × 1011.8546 × 101
Std1.4255 × 10−34.4020 × 10−23.6134 × 10−156.0258 × 10−23.6134 × 10−153.6134 × 10−153.6134 × 10−156.4280 × 10−23.6134 × 10−153.6134 × 10−15
6Ave2.1658 × 1012.1672 × 1012.1668 × 1012.1654 × 1012.1659 × 1012.1648 × 1012.1650 × 1012.1584 × 1012.1663 × 1012.1657 × 101
Std7.2423 × 10−21.2255 × 10−12.8597 × 10−21.9936 × 10−10.0000 × 10002.2355 × 10−24.6133 × 10−22.3117 × 10−12.6904 × 10−22.0880 × 10−2
8Ave2.3981 × 1012.3866 × 1012.4011 × 1012.3821 × 1012.4015 × 1012.4009 × 1012.3965 × 1012.3788 × 1012.3989 × 1012.4014 × 101
Std1.3956 × 10−12.1980 × 10−16.8789 × 10−23.5727 × 10−13.2111 × 10−25.6899 × 10−21.4357 × 10−13.3445 × 10−11.2304 × 10−16.5003 × 10−2
10Ave2.5767 × 1012.5634 × 1012.5807 × 1012.5643 × 1012.5909 × 1012.5869 × 1012.5805 × 1012.5462 × 1012.5799 × 1012.5890 × 101
Std2.1725 × 10−13.4655 × 10−11.5148 × 10−12.3667 × 10−18.8194 × 10−23.1488 × 10−12.2674 × 10−13.3442 × 10−12.4669 × 10−12.2270 × 10−1
camera4Ave1.9670 × 1011.9059 × 1011.8903 × 1011.9831 × 1011.9205 × 1011.8351 × 1011.9871 × 1011.9704 × 1011.9508 × 1011.9863 × 101
Std5.4887 × 10−19.4311 × 10−19.2168 × 10−11.0457 × 10−18.9029 × 10−18.8888 × 10−11.7329 × 10−33.4369 × 10−17.3899 × 10−13.4447 × 10−2
6Ave2.1879 × 1012.1887 × 1012.1895 × 1012.1801 × 1012.1935 × 1012.1922 × 1012.1913 × 1012.1823 × 1012.1905 × 1012.1914 × 101
Std6.4135 × 10−21.0619 × 10−15.1106 × 10−22.5455 × 10−13.6134 × 10−152.7301 × 10−23.4446 × 10−21.4054 × 10−14.2733 × 10−24.1597 × 10−2
8Ave2.3022 × 1012.3144 × 1012.3276 × 1012.2985 × 1012.3295 × 1012.3229 × 1012.3182 × 1012.2970 × 1012.3227 × 1012.3196 × 101
Std1.7916 × 10−11.6877 × 10−11.6904 × 10−13.0685 × 10−11.5584 × 10−11.7319 × 10−12.1028 × 10−13.5030 × 10−12.3951 × 10−12.0685 × 10−1
10Ave2.4374 × 1012.4273 × 1012.4301 × 1012.4349 × 1012.4395 × 1012.4296 × 1012.4285 × 1012.3961 × 1012.4330 × 1012.4300 × 101
Std2.8828 × 10−13.9483 × 10−12.8288 × 10−14.4959 × 10−12.1134 × 10−12.2902 × 10−12.8784 × 10−14.4186 × 10−13.2961 × 10−12.9287 × 10−1
cell4Ave1.8639 × 1011.8639 × 1011.8639 × 1011.8654 × 1011.8639 × 1011.8639 × 1011.8639 × 1011.8639 × 1011.8639 × 1011.8639 × 101
Std2.1159 × 10−41.0840 × 10−141.0840 × 10−144.4564 × 10−21.0840 × 10−141.0840 × 10−141.0840 × 10−141.5226 × 10−41.0840 × 10−141.0840 × 10−14
6Ave1.9899 × 1011.9898 × 1011.9869 × 1011.9956 × 1011.9940 × 1011.9834 × 1011.9827 × 1011.9806 × 1011.9838 × 1011.9879 × 101
Std2.0047 × 10−12.2446 × 10−12.1960 × 10−12.0985 × 10−11.9591 × 10−12.3455 × 10−12.4327 × 10−12.2655 × 10−12.5270 × 10−12.4851 × 10−1
8Ave2.0723 × 1012.0730 × 1012.0757 × 1012.0716 × 1012.0716 × 1012.0713 × 1012.0727 × 1012.0656 × 1012.0749 × 1012.0755 × 101
Std7.8055 × 10−21.1628 × 10−16.2506 × 10−22.3728 × 10−12.7727 × 10−25.9719 × 10−27.0103 × 10−21.5750 × 10−15.7536 × 10−23.6102 × 10−2
10Ave2.1243 × 1012.1380 × 1012.1320 × 1012.1322 × 1012.1377 × 1012.1304 × 1012.1265 × 1012.1153 × 1012.1311 × 1012.1303 × 101
Std1.2296 × 10−12.1800 × 10−11.1314 × 10−13.1032 × 10−11.2424 × 10−31.2084 × 10−11.2562 × 10−12.2105 × 10−11.2946 × 10−11.0266 × 10−1
columbia4Ave1.9999 × 1011.9999 × 1011.9999 × 1011.9993 × 1011.9999 × 1011.9999 × 1011.9999 × 1011.9988 × 1011.9999 × 1011.9999 × 101
Std1.4454 × 10−144.2826 × 10−21.4454 × 10−146.5606 × 10−21.4454 × 10−142.6687 × 10−41.7862 × 10−44.2424 × 10−21.4454 × 10−141.4454 × 10−14
6Ave2.2301 × 1012.2310 × 1012.2314 × 1012.2384 × 1012.2320 × 1012.2345 × 1012.2323 × 1012.2198 × 1012.2321 × 1012.2321 × 101
Std5.8477 × 10−21.5826 × 10−14.3031 × 10−22.8971 × 10−17.2269 × 10−155.9940 × 10−27.2414 × 10−21.7924 × 10−18.1013 × 10−22.6730 × 10−3
8Ave2.4073 × 1012.3964 × 1012.4067 × 1012.3952 × 1012.4074 × 1012.4036 × 1012.4036 × 1012.3935 × 1012.4044 × 1012.4080 × 101
Std1.2835 × 10−12.9780 × 10−17.7280 × 10−23.7273 × 10−13.6052 × 10−29.6682 × 10−21.2093 × 10−12.8412 × 10−11.1075 × 10−13.5891 × 10−2
10Ave2.5385 × 1012.5300 × 1012.5337 × 1012.5521 × 1012.5261 × 1012.5365 × 1012.5266 × 1012.4936 × 1012.5310 × 1012.5371 × 101
Std2.7417 × 10−13.2611 × 10−12.4305 × 10−16.2033 × 10−17.7994 × 10−22.6089 × 10−12.4412 × 10−13.6354 × 10−12.9047 × 10−11.8206 × 10−1
couple4Ave2.0264 × 1012.0246 × 1012.0269 × 1012.0247 × 1012.0269 × 1012.0255 × 1012.0265 × 1012.0242 × 1012.0255 × 1012.0269 × 101
Std2.1817 × 10−24.7972 × 10−27.2269 × 10−155.5179 × 10−27.2269 × 10−152.6489 × 10−21.5622 × 10−27.1147 × 10−22.6489 × 10−27.2269 × 10−15
6Ave2.3446 × 1012.3454 × 1012.3460 × 1012.3379 × 1012.3460 × 1012.3465 × 1012.3462 × 1012.3391 × 1012.3462 × 1012.3460 × 101
Std2.5052 × 10−22.1507 × 10−21.2529 × 10−28.0557 × 10−23.2024 × 10−31.0898 × 10−21.3520 × 10−28.0754 × 10−28.4720 × 10−33.2024 × 10−3
8Ave2.5361 × 1012.5366 × 1012.5391 × 1012.5195 × 1012.5426 × 1012.5421 × 1012.5406 × 1012.5271 × 1012.5412 × 1012.5420 × 101
Std4.5081 × 10−21.2493 × 10−12.1050 × 10−21.5715 × 10−13.6134 × 10−151.2129 × 10−22.6196 × 10−21.1442 × 10−11.6682 × 10−29.8911 × 10−3
10Ave2.6788 × 1012.6788 × 1012.6831 × 1012.6652 × 1012.6831 × 1012.6864 × 1012.6883 × 1012.6609 × 1012.6881 × 1012.6843 × 101
Std7.5709 × 10−21.8703 × 10−14.7342 × 10−21.4799 × 10−19.5275 × 10−35.6289 × 10−28.6158 × 10−22.0722 × 10−16.9185 × 10−23.6745 × 10−2
Table 13. Ave and Std of all test images for FSIM in Otsu.
Table 13. Ave and Std of all test images for FSIM in Otsu.
ImageThresholdMetricBHONDOGJASSLOLEESAORBMOESCSBOAMISBOA
baboon4Ave8.3368 × 10−18.3309 × 10−18.3367 × 10−18.3259 × 10−18.3367 × 10−18.3367 × 10−18.3367 × 10−18.3340 × 10−18.3356 × 10−18.3356 × 10−1
Std9.9178 × 10−51.6870 × 10−32.2584 × 10−163.0753 × 10−32.2584 × 10−162.2584 × 10−162.2584 × 10−167.9317 × 10−46.0223 × 10−46.0223 × 10−4
6Ave8.8549 × 10−1inf8.8557 × 10−18.8393 × 10−18.8462 × 10−18.8465 × 10−18.8474 × 10−18.8281 × 10−18.8538 × 10−18.8489 × 10−1
Std2.7147 × 10−3inf2.3959 × 10−36.3538 × 10−33.3876 × 10−161.2321 × 10−38.3541 × 10−46.3012 × 10−31.8339 × 10−39.6359 × 10−4
8Ave9.2119 × 10−1inf9.2117 × 10−1inf9.2286 × 10−19.2133 × 10−19.1655 × 10−19.1388 × 10−19.2214 × 10−19.2129 × 10−1
Std6.4167 × 10−3inf3.6074 × 10−3inf6.2423 × 10−43.7032 × 10−31.9484 × 10−29.8909 × 10−34.5064 × 10−34.8059 × 10−3
10Ave9.4242 × 10−1inf9.4213 × 10−1inf9.4324 × 10−19.3501 × 10−18.9844 × 10−19.3048 × 10−19.2100 × 10−19.4292 × 10−1
Std6.3689 × 10−3inf3.4091 × 10−3inf5.5858 × 10−44.1254 × 10−21.0871 × 10−19.2048 × 10−31.0052 × 10−13.5963 × 10−3
bank4Ave8.3499 × 10−18.3504 × 10−18.3493 × 10−18.3505 × 10−18.3490 × 10−18.3487 × 10−18.3491 × 10−18.3499 × 10−18.3498 × 10−18.3493 × 10−1
Std2.2030 × 10−42.6605 × 10−41.2955 × 10−46.2546 × 10−41.1292 × 10−163.0615 × 10−42.0398 × 10−55.9176 × 10−42.1620 × 10−41.2955 × 10−4
6Ave8.8128 × 10−18.8145 × 10−18.8145 × 10−18.8091 × 10−18.8128 × 10−18.8143 × 10−18.8139 × 10−18.8106 × 10−18.8119 × 10−18.8128 × 10−1
Std4.8838 × 10−47.1891 × 10−43.1737 × 10−41.5432 × 10−35.6460 × 10−162.7124 × 10−42.3995 × 10−41.0533 × 10−32.2669 × 10−45.6460 × 10−16
8Ave9.0952 × 10−19.0904 × 10−19.0990 × 10−19.0831 × 10−19.0982 × 10−19.0964 × 10−19.0976 × 10−19.0835 × 10−19.0975 × 10−19.0970 × 10−1
Std1.5825 × 10−32.7873 × 10−38.3354 × 10−43.7422 × 10−31.2788 × 10−42.3413 × 10−31.3162 × 10−32.8426 × 10−31.2912 × 10−34.6018 × 10−4
10Ave9.3119 × 10−19.3044 × 10−19.3116 × 10−19.2921 × 10−19.3127 × 10−19.3104 × 10−19.3129 × 10−19.2686 × 10−19.3114 × 10−19.3148 × 10−1
Std1.7641 × 10−32.6827 × 10−39.8791 × 10−43.4240 × 10−32.0227 × 10−42.0609 × 10−31.3813 × 10−32.6745 × 10−32.0855 × 10−31.0583 × 10−3
barbara4Ave8.1307 × 10−18.1305 × 10−18.1307 × 10−18.1309 × 10−18.1307 × 10−18.1307 × 10−18.1307 × 10−18.1305 × 10−18.1307 × 10−18.1307 × 10−1
Std5.6460 × 10−161.2093 × 10−45.6460 × 10−164.6029 × 10−45.6460 × 10−165.6460 × 10−165.6460 × 10−162.5892 × 10−45.6460 × 10−165.6460 × 10−16
6Ave8.6385 × 10−18.6414 × 10−18.6380 × 10−18.6318 × 10−18.6351 × 10−18.6360 × 10−18.6376 × 10−18.6354 × 10−18.6359 × 10−18.6351 × 10−1
Std3.9678 × 10−46.5980 × 10−42.6551 × 10−41.3910 × 10−35.6460 × 10−161.1160 × 10−43.9417 × 10−41.2120 × 10−31.5899 × 10−45.6460 × 10−16
8Ave8.9112 × 10−18.9162 × 10−18.9132 × 10−18.9010 × 10−18.9151 × 10−18.9144 × 10−18.9153 × 10−18.8963 × 10−18.9132 × 10−18.9154 × 10−1
Std9.7223 × 10−41.0178 × 10−35.6094 × 10−41.5840 × 10−30.0000 × 10001.9333 × 10−44.9461 × 10−41.3220 × 10−33.9638 × 10−41.5889 × 10−4
10Ave9.1120 × 10−19.1073 × 10−19.1185 × 10−19.0847 × 10−19.1231 × 10−19.1223 × 10−19.1152 × 10−19.0668 × 10−19.1186 × 10−19.1226 × 10−1
Std1.4046 × 10−31.8660 × 10−31.0481 × 10−32.1187 × 10−33.6625 × 10−45.5281 × 10−41.0763 × 10−32.6066 × 10−31.2123 × 10−36.4469 × 10−4
boat4Ave8.1304 × 10−18.1305 × 10−18.1304 × 10−18.1282 × 10−18.1304 × 10−18.1304 × 10−18.1304 × 10−18.1297 × 10−18.1304 × 10−18.1304 × 10−1
Std3.7162 × 10−67.8733 × 10−53.3876 × 10−167.4146 × 10−43.3876 × 10−163.3876 × 10−163.3876 × 10−162.0443 × 10−43.3876 × 10−163.3876 × 10−16
6Ave8.7865 × 10−18.7880 × 10−18.7874 × 10−18.7765 × 10−18.7886 × 10−18.7872 × 10−18.7877 × 10−18.7821 × 10−18.7881 × 10−18.7885 × 10−1
Std4.2906 × 10−43.5662 × 10−44.3243 × 10−41.4671 × 10−31.1292 × 10−162.1917 × 10−43.1326 × 10−49.3243 × 10−43.3064 × 10−42.0089 × 10−4
8Ave9.1173 × 10−19.1137 × 10−19.1181 × 10−19.0959 × 10−19.1192 × 10−19.1199 × 10−19.1183 × 10−19.0859 × 10−19.1211 × 10−19.1180 × 10−1
Std1.0177 × 10−31.5367 × 10−36.1039 × 10−41.9458 × 10−38.6306 × 10−61.5156 × 10−49.0352 × 10−42.1600 × 10−37.7144 × 10−43.7235 × 10−4
10Ave9.3275 × 10−19.3212 × 10−19.3230 × 10−19.2889 × 10−19.3348 × 10−19.3283 × 10−19.3257 × 10−19.2701 × 10−19.3286 × 10−19.3314 × 10−1
Std1.0256 × 10−31.7207 × 10−39.5327 × 10−42.1764 × 10−31.6442 × 10−48.8873 × 10−41.1292 × 10−33.2697 × 10−39.5286 × 10−46.5670 × 10−4
brain4Ave6.7513 × 10−16.7505 × 10−16.7511 × 10−16.7510 × 10−16.7510 × 10−16.7511 × 10−16.7508 × 10−16.7514 × 10−16.7511 × 10−16.7512 × 10−1
Std8.7986 × 10−52.4925 × 10−48.0070 × 10−51.6006 × 10−48.4112 × 10−58.4774 × 10−58.5347 × 10−51.7712 × 10−48.0714 × 10−57.5690 × 10−5
6Ave9.2039 × 10−17.6846 × 10−17.3908 × 10−19.1923 × 10−17.2396 × 10−17.9130 × 10−18.9728 × 10−18.6572 × 10−18.1456 × 10−18.6060 × 10−1
Std2.7556 × 10−31.0840 × 10−19.3017 × 10−23.0315 × 10−37.9135 × 10−21.1401 × 10−16.9108 × 10−29.7400 × 10−21.1568 × 10−11.0263 × 10−1
8Ave9.4994 × 10−19.4187 × 10−19.5034 × 10−19.4804 × 10−19.5030 × 10−19.4202 × 10−19.5016 × 10−19.4651 × 10−19.5091 × 10−19.5043 × 10−1
Std1.6432 × 10−34.1456 × 10−21.5399 × 10−31.9501 × 10−31.2931 × 10−34.4793 × 10−21.6697 × 10−33.5200 × 10−31.4171 × 10−31.5326 × 10−3
10Ave9.6396 × 10−19.6207 × 10−19.6353 × 10−19.6145 × 10−19.6367 × 10−19.6490 × 10−19.6397 × 10−19.6043 × 10−19.6430 × 10−19.6463 × 10−1
Std1.6824 × 10−33.0844 × 10−31.8047 × 10−32.2796 × 10−31.3262 × 10−31.4194 × 10−32.2229 × 10−32.8039 × 10−31.8369 × 10−31.9837 × 10−3
bridge4Ave7.9571 × 10−17.9607 × 10−17.9569 × 10−17.9619 × 10−17.9569 × 10−17.9569 × 10−17.9569 × 10−17.9568 × 10−17.9569 × 10−17.9569 × 10−1
Std7.7060 × 10−51.0378 × 10−35.6460 × 10−161.4516 × 10−35.6460 × 10−165.6460 × 10−165.6460 × 10−161.6023 × 10−35.6460 × 10−165.6460 × 10−16
6Ave8.7209 × 10−18.7230 × 10−18.7265 × 10−18.7283 × 10−18.7244 × 10−18.7236 × 10−18.7207 × 10−18.7016 × 10−18.7254 × 10−18.7242 × 10−1
Std1.3789 × 10−31.7030 × 10−37.8498 × 10−43.6708 × 10−34.5168 × 10−164.0512 × 10−46.5360 × 10−44.0374 × 10−35.9794 × 10−43.2904 × 10−4
8Ave9.1221 × 10−19.1053 × 10−19.1258 × 10−19.0932 × 10−19.1258 × 10−19.1273 × 10−19.1221 × 10−19.0820 × 10−19.1260 × 10−19.1274 × 10−1
Std2.6828 × 10−33.2676 × 10−31.3492 × 10−37.0761 × 10−35.3245 × 10−47.8558 × 10−41.8129 × 10−36.6615 × 10−31.8963 × 10−31.1146 × 10−3
10Ave9.3534 × 10−19.3413 × 10−19.3640 × 10−19.3453 × 10−19.3755 × 10−19.3666 × 10−19.3594 × 10−19.3006 × 10−19.3631 × 10−19.3722 × 10−1
Std2.7665 × 10−34.9611 × 10−31.3143 × 10−33.5396 × 10−31.0765 × 10−33.5689 × 10−31.9903 × 10−34.7943 × 10−32.7980 × 10−33.1010 × 10−3
camera4Ave8.3308 × 10−18.3513 × 10−18.3661 × 10−18.3243 × 10−18.3541 × 10−18.3414 × 10−18.3279 × 10−18.3110 × 10−18.3421 × 10−18.3260 × 10−1
Std2.4931 × 10−34.6444 × 10−33.6630 × 10−32.2114 × 10−33.5382 × 10−38.1730 × 10−31.1035 × 10−43.2811 × 10−32.9369 × 10−37.6966 × 10−4
6Ave8.7790 × 10−18.7797 × 10−18.7831 × 10−18.7547 × 10−18.7905 × 10−18.7879 × 10−18.7859 × 10−18.7712 × 10−18.7850 × 10−18.7868 × 10−1
Std1.0028 × 10−32.0275 × 10−38.4153 × 10−44.2740 × 10−33.3876 × 10−165.2412 × 10−46.2342 × 10−42.2453 × 10−37.5318 × 10−47.0857 × 10−4
8Ave9.0161 × 10−19.0215 × 10−19.0248 × 10−19.0016 × 10−19.0351 × 10−19.0317 × 10−19.0252 × 10−18.9909 × 10−19.0306 × 10−19.0289 × 10−1
Std1.8965 × 10−31.0651 × 10−31.1945 × 10−34.7787 × 10−38.3352 × 10−49.5864 × 10−49.7287 × 10−44.1231 × 10−31.2348 × 10−37.8222 × 10−4
10Ave9.1897 × 10−19.1751 × 10−19.1918 × 10−19.1737 × 10−19.1960 × 10−19.1943 × 10−19.1880 × 10−19.1442 × 10−19.1934 × 10−19.1907 × 10−1
Std1.3728 × 10−32.9766 × 10−31.1734 × 10−33.2815 × 10−36.9378 × 10−47.7839 × 10−41.3788 × 10−33.6976 × 10−38.6426 × 10−41.3506 × 10−3
cell4Ave8.7881 × 10−18.7881 × 10−18.7881 × 10−18.7921 × 10−18.7881 × 10−18.7881 × 10−18.7881 × 10−18.7881 × 10−18.7881 × 10−18.7881 × 10−1
Std2.1679 × 10−50.0000 × 10000.0000 × 10008.9181 × 10−40.0000 × 10000.0000 × 10000.0000 × 10001.5601 × 10−50.0000 × 10000.0000 × 1000
6Ave9.0001 × 10−19.0101 × 10−19.0162 × 10−19.0071 × 10−18.9979 × 10−19.0213 × 10−19.0137 × 10−19.0088 × 10−19.0020 × 10−18.9901 × 10−1
Std2.1633 × 10−33.2026 × 10−33.0904 × 10−33.6562 × 10−33.1560 × 10−32.7138 × 10−32.9883 × 10−32.5322 × 10−32.8643 × 10−32.0424 × 10−3
8Ave9.1747 × 10−19.1613 × 10−19.1709 × 10−19.1369 × 10−19.1808 × 10−19.1790 × 10−19.1758 × 10−19.1568 × 10−19.1763 × 10−19.1776 × 10−1
Std1.2966 × 10−33.2993 × 10−31.7528 × 10−34.3344 × 10−31.7585 × 10−44.4744 × 10−48.4041 × 10−43.0147 × 10−31.0134 × 10−35.2775 × 10−4
10Ave9.1943 × 10−19.1436 × 10−19.1785 × 10−19.1521 × 10−19.1806 × 10−19.1901 × 10−19.1959 × 10−19.1759 × 10−19.1853 × 10−19.1947 × 10−1
Std2.8304 × 10−38.9320 × 10−34.1635 × 10−37.8579 × 10−31.4524 × 10−42.2851 × 10−32.7134 × 10−34.4777 × 10−34.1297 × 10−33.2286 × 10−3
columbia4Ave8.1554 × 10−18.1541 × 10−18.1554 × 10−18.1542 × 10−18.1554 × 10−18.1544 × 10−18.1550 × 10−18.1531 × 10−18.1554 × 10−18.1554 × 10−1
Std2.2584 × 10−166.5508 × 10−42.2584 × 10−166.8100 × 10−42.2584 × 10−162.3172 × 10−41.5510 × 10−44.9364 × 10−42.2584 × 10−162.2584 × 10−16
6Ave8.6893 × 10−18.6875 × 10−18.6894 × 10−18.6893 × 10−18.6962 × 10−18.6883 × 10−18.6888 × 10−18.6732 × 10−18.6907 × 10−18.6956 × 10−1
Std8.0032 × 10−47.4952 × 10−46.9489 × 10−42.6061 × 10−34.5168 × 10−167.6014 × 10−47.7918 × 10−41.7120 × 10−36.5433 × 10−42.9061 × 10−4
8Ave8.9769 × 10−18.9718 × 10−18.9763 × 10−18.9551 × 10−18.9759 × 10−18.9746 × 10−18.9764 × 10−18.9582 × 10−18.9758 × 10−18.9741 × 10−1
Std8.5901 × 10−42.8874 × 10−37.3566 × 10−42.2873 × 10−35.5705 × 10−46.2579 × 10−46.8143 × 10−42.3523 × 10−35.5947 × 10−45.5263 × 10−4
10Ave9.1606 × 10−19.1617 × 10−19.1661 × 10−19.1494 × 10−19.1599 × 10−19.1625 × 10−19.1693 × 10−19.1112 × 10−19.1667 × 10−19.1597 × 10−1
Std1.5457 × 10−32.1005 × 10−31.4163 × 10−33.5849 × 10−34.5407 × 10−49.6993 × 10−49.8669 × 10−42.8319 × 10−39.5957 × 10−45.5185 × 10−4
couple4Ave8.0086 × 10−18.0061 × 10−18.0091 × 10−18.0072 × 10−18.0091 × 10−18.0072 × 10−18.0085 × 10−18.0041 × 10−18.0072 × 10−18.0091 × 10−1
Std3.5224 × 10−47.8442 × 10−40.0000 × 10001.1877 × 10−30.0000 × 10003.4992 × 10−42.0637 × 10−41.5658 × 10−33.4992 × 10−40.0000 × 1000
6Ave8.7275 × 10−18.7306 × 10−18.7320 × 10−18.7232 × 10−18.7307 × 10−18.7332 × 10−18.7319 × 10−18.7148 × 10−18.7310 × 10−18.7307 × 10−1
Std9.7153 × 10−45.9879 × 10−45.1333 × 10−41.8619 × 10−31.4990 × 10−44.3455 × 10−45.5403 × 10−42.2623 × 10−34.7986 × 10−41.4990 × 10−4
8Ave9.1112 × 10−19.1130 × 10−19.1157 × 10−19.0910 × 10−19.1166 × 10−19.1164 × 10−19.1176 × 10−19.0953 × 10−19.1195 × 10−19.1195 × 10−1
Std1.4631 × 10−31.6446 × 10−38.0795 × 10−43.2240 × 10−33.3876 × 10−163.8122 × 10−48.4913 × 10−42.9322 × 10−37.6148 × 10−44.2149 × 10−4
10Ave9.3244 × 10−19.3252 × 10−19.3369 × 10−19.3039 × 10−19.3357 × 10−19.3399 × 10−19.3384 × 10−19.2926 × 10−19.3423 × 10−19.3395 × 10−1
Std1.5894 × 10−33.2795 × 10−39.8854 × 10−42.5713 × 10−32.6843 × 10−44.3312 × 10−49.1003 × 10−43.1956 × 10−31.1932 × 10−37.3509 × 10−4
Table 14. Ave and Std of all test images for SSIM in Otsu.
Table 14. Ave and Std of all test images for SSIM in Otsu.
ImageThresholdMetricBHONDOGJASSLOLEESAORBMOESCSBOAMISBOA
baboon4Ave7.8185 × 10−17.8106 × 10−17.8186 × 10−17.8027 × 10−17.8186 × 10−17.8186 × 10−17.8186 × 10−17.8148 × 10−17.8174 × 10−17.8174 × 10−1
Std3.1523 × 10−52.6359 × 10−31.1292 × 10−163.9493 × 10−31.1292 × 10−161.1292 × 10−161.1292 × 10−161.1906 × 10−36.5272 × 10−46.5272 × 10−4
6Ave8.5968 × 10−18.3046 × 10−18.5985 × 10−18.5722 × 10−18.5910 × 10−18.5901 × 10−18.5902 × 10−18.5686 × 10−18.5963 × 10−18.5930 × 10−1
Std2.4962 × 10−31.5693 × 10−12.1350 × 10−37.3448 × 10−35.6460 × 10−161.2366 × 10−39.3989 × 10−47.0364 × 10−31.6212 × 10−38.1059 × 10−4
8Ave9.0503 × 10−16.6244 × 10−19.0515 × 10−17.2106 × 10−19.0706 × 10−19.0546 × 10−18.9841 × 10−18.9824 × 10−19.0612 × 10−19.0535 × 10−1
Std5.5109 × 10−34.0625 × 10−13.2042 × 10−33.6321 × 10−15.5322 × 10−43.7134 × 10−33.1993 × 10−28.2449 × 10−33.9570 × 10−34.2691 × 10−3
10Ave9.3122 × 10−13.7263 × 10−19.3093 × 10−15.3090 × 10−19.3177 × 10−19.2144 × 10−18.7057 × 10−19.2021 × 10−19.0099 × 10−19.3149 × 10−1
Std4.9990 × 10−34.6402 × 10−13.0462 × 10−34.6242 × 10−17.7762 × 10−45.4565 × 10−21.4609 × 10−18.3495 × 10−31.3361 × 10−12.6996 × 10−3
bank4Ave7.4549 × 10−17.4525 × 10−17.4554 × 10−17.4482 × 10−17.4554 × 10−17.4506 × 10−17.4551 × 10−17.4487 × 10−17.4550 × 10−17.4554 × 10−1
Std2.0501 × 10−46.1294 × 10−41.3683 × 10−59.4303 × 10−42.2584 × 10−161.4940 × 10−31.9667 × 10−41.5980 × 10−31.9658 × 10−41.3683 × 10−5
6Ave8.1464 × 10−18.1541 × 10−18.1490 × 10−18.1409 × 10−18.1456 × 10−18.1494 × 10−18.1468 × 10−18.1395 × 10−18.1429 × 10−18.1456 × 10−1
Std1.0313 × 10−32.8049 × 10−37.2130 × 10−43.8865 × 10−31.1292 × 10−165.9255 × 10−44.8826 × 10−43.1549 × 10−36.6096 × 10−41.1292 × 10−16
8Ave8.5602 × 10−18.5592 × 10−18.5631 × 10−18.5455 × 10−18.5621 × 10−18.5760 × 10−18.5708 × 10−18.5669 × 10−18.5699 × 10−18.5663 × 10−1
Std2.2378 × 10−34.9149 × 10−31.6701 × 10−36.1437 × 10−31.2856 × 10−33.4487 × 10−34.2876 × 10−35.3954 × 10−33.4577 × 10−31.8104 × 10−3
10Ave8.8543 × 10−18.8429 × 10−18.8525 × 10−18.8227 × 10−18.8579 × 10−18.8572 × 10−18.8568 × 10−18.7981 × 10−18.8474 × 10−18.8595 × 10−1
Std2.3913 × 10−34.3030 × 10−31.5559 × 10−34.7059 × 10−33.4508 × 10−43.1034 × 10−32.9192 × 10−35.1919 × 10−34.3061 × 10−31.3422 × 10−3
barbara4Ave6.5794 × 10−16.5793 × 10−16.5794 × 10−16.5800 × 10−16.5794 × 10−16.5794 × 10−16.5794 × 10−16.5797 × 10−16.5794 × 10−16.5794 × 10−1
Std0.0000 × 10005.9756 × 10−50.0000 × 10006.2162 × 10−40.0000 × 10000.0000 × 10000.0000 × 10005.4503 × 10−40.0000 × 10000.0000 × 1000
6Ave7.3958 × 10−17.4054 × 10−17.3965 × 10−17.3843 × 10−17.3936 × 10−17.3945 × 10−17.3986 × 10−17.3887 × 10−17.3963 × 10−17.3936 × 10−1
Std1.2771 × 10−32.4713 × 10−39.2488 × 10−46.0913 × 10−35.6460 × 10−164.2145 × 10−48.4074 × 10−44.8124 × 10−37.4454 × 10−45.6460 × 10−16
8Ave7.9937 × 10−18.0116 × 10−17.9966 × 10−17.9523 × 10−18.0132 × 10−18.0050 × 10−18.0136 × 10−17.9293 × 10−17.9969 × 10−18.0097 × 10−1
Std3.6565 × 10−37.0809 × 10−32.6070 × 10−39.6245 × 10−35.6460 × 10−161.7136 × 10−33.3587 × 10−38.5137 × 10−32.9981 × 10−31.2984 × 10−3
10Ave8.3800 × 10−18.3735 × 10−18.3810 × 10−18.3542 × 10−18.3855 × 10−18.3839 × 10−18.3757 × 10−18.2864 × 10−18.3660 × 10−18.3870 × 10−1
Std5.3098 × 10−36.4311 × 10−34.3157 × 10−39.0808 × 10−31.5144 × 10−33.2208 × 10−35.4654 × 10−31.2515 × 10−26.9074 × 10−31.9804 × 10−3
boat4Ave7.0743 × 10−17.0730 × 10−17.0743 × 10−17.0660 × 10−17.0743 × 10−17.0743 × 10−17.0743 × 10−17.0714 × 10−17.0743 × 10−17.0743 × 10−1
Std1.2738 × 10−55.2107 × 10−43.3876 × 10−161.8333 × 10−33.3876 × 10−163.3876 × 10−163.3876 × 10−166.6292 × 10−43.3876 × 10−163.3876 × 10−16
6Ave8.0498 × 10−18.0527 × 10−18.0552 × 10−18.0286 × 10−18.0628 × 10−18.0525 × 10−18.0535 × 10−18.0416 × 10−18.0506 × 10−18.0609 × 10−1
Std1.9007 × 10−32.1358 × 10−31.1789 × 10−36.7234 × 10−35.6460 × 10−161.5983 × 10−31.7772 × 10−33.0217 × 10−31.3594 × 10−34.0263 × 10−4
8Ave8.5846 × 10−18.5916 × 10−18.5930 × 10−18.5935 × 10−18.6035 × 10−18.5990 × 10−18.6039 × 10−18.5396 × 10−18.5976 × 10−18.5936 × 10−1
Std3.1528 × 10−34.7921 × 10−31.7430 × 10−38.3239 × 10−31.4461 × 10−31.6842 × 10−32.1554 × 10−38.4787 × 10−33.0585 × 10−31.6997 × 10−3
10Ave8.9548 × 10−18.9411 × 10−18.9473 × 10−18.9241 × 10−18.9764 × 10−18.9724 × 10−18.9519 × 10−18.8677 × 10−18.9337 × 10−18.9528 × 10−1
Std5.6167 × 10−36.5833 × 10−33.2530 × 10−38.0224 × 10−37.2536 × 10−42.0843 × 10−33.0822 × 10−37.8028 × 10−35.2980 × 10−33.2774 × 10−3
brain4Ave3.7684 × 10−13.7677 × 10−13.7674 × 10−13.7676 × 10−13.7673 × 10−13.7674 × 10−13.7669 × 10−13.7697 × 10−13.7668 × 10−13.7679 × 10−1
Std3.4561 × 10−43.3560 × 10−43.9361 × 10−45.0207 × 10−43.6593 × 10−43.5373 × 10−43.7657 × 10−44.5989 × 10−43.3902 × 10−42.9604 × 10−4
6Ave6.5865 × 10−14.9226 × 10−14.5444 × 10−16.9139 × 10−14.3883 × 10−15.0737 × 10−16.1940 × 10−15.8723 × 10−15.4933 × 10−15.8427 × 10−1
Std5.4732 × 10−21.3098 × 10−11.0197 × 10−15.7404 × 10−28.8712 × 10−21.2349 × 10−18.7389 × 10−21.1123 × 10−11.4390 × 10−11.1513 × 10−1
8Ave7.6612 × 10−17.2601 × 10−17.6325 × 10−17.4042 × 10−17.6843 × 10−17.4909 × 10−17.6147 × 10−16.9011 × 10−17.4929 × 10−17.6283 × 10−1
Std3.1178 × 10−27.8746 × 10−22.6351 × 10−25.4074 × 10−22.5880 × 10−26.7023 × 10−22.6416 × 10−26.5521 × 10−23.6423 × 10−23.1330 × 10−2
10Ave7.6754 × 10−17.7545 × 10−17.7465 × 10−17.7925 × 10−17.7124 × 10−17.7659 × 10−17.8460 × 10−17.4420 × 10−17.7966 × 10−17.9650 × 10−1
Std2.8464 × 10−25.0717 × 10−22.9104 × 10−25.6951 × 10−22.6333 × 10−23.0514 × 10−23.1401 × 10−26.2877 × 10−23.1633 × 10−23.6746 × 10−2
bridge4Ave6.9311 × 10−16.9389 × 10−16.9311 × 10−16.9384 × 10−16.9311 × 10−16.9311 × 10−16.9311 × 10−16.9333 × 10−16.9311 × 10−16.9311 × 10−1
Std6.8714 × 10−62.1949 × 10−31.1292 × 10−162.9091 × 10−31.1292 × 10−161.1292 × 10−161.1292 × 10−163.1094 × 10−31.1292 × 10−161.1292 × 10−16
6Ave8.1543 × 10−18.1598 × 10−18.1564 × 10−18.1535 × 10−18.1527 × 10−18.1480 × 10−18.1499 × 10−18.1325 × 10−18.1539 × 10−18.1521 × 10−1
Std2.7597 × 10−34.9376 × 10−31.1678 × 10−37.7628 × 10−33.3876 × 10−169.5752 × 10−41.8773 × 10−38.5453 × 10−31.1698 × 10−38.0551 × 10−4
8Ave8.7742 × 10−18.7462 × 10−18.7817 × 10−18.7393 × 10−18.7827 × 10−18.7813 × 10−18.7677 × 10−18.7333 × 10−18.7760 × 10−18.7826 × 10−1
Std3.8828 × 10−36.8789 × 10−32.2062 × 10−31.1602 × 10−21.2072 × 10−31.9286 × 10−34.5428 × 10−31.0762 × 10−23.7647 × 10−32.0696 × 10−3
10Ave9.1302 × 10−19.1079 × 10−19.1343 × 10−19.1276 × 10−19.1556 × 10−19.1558 × 10−19.1392 × 10−19.0773 × 10−19.1386 × 10−19.1584 × 10−1
Std5.8384 × 10−39.4939 × 10−34.2564 × 10−36.8804 × 10−32.4738 × 10−37.6182 × 10−36.4535 × 10−39.3464 × 10−37.2528 × 10−35.3954 × 10−3
camera4Ave7.5084 × 10−17.2713 × 10−17.2125 × 10−17.5844 × 10−17.3304 × 10−16.9808 × 10−17.5913 × 10−17.5152 × 10−17.4483 × 10−17.5847 × 10−1
Std2.1361 × 10−23.7741 × 10−23.5908 × 10−25.1520 × 10−33.4685 × 10−23.6565 × 10−25.3832 × 10−41.3903 × 10−22.8790 × 10−22.0595 × 10−3
6Ave8.0320 × 10−18.0354 × 10−18.0382 × 10−17.9953 × 10−18.0543 × 10−18.0490 × 10−18.0455 × 10−18.0132 × 10−18.0421 × 10−18.0456 × 10−1
Std2.6642 × 10−34.3932 × 10−32.0994 × 10−31.0309 × 10−21.1292 × 10−161.0898 × 10−31.3317 × 10−35.3853 × 10−31.7152 × 10−31.6905 × 10−3
8Ave8.3094 × 10−18.3263 × 10−18.3453 × 10−18.2704 × 10−18.3668 × 10−18.3532 × 10−18.3372 × 10−18.2422 × 10−18.3549 × 10−18.3463 × 10−1
Std5.0436 × 10−34.5118 × 10−33.8335 × 10−31.2769 × 10−23.1533 × 10−33.2502 × 10−33.8801 × 10−31.2113 × 10−24.6657 × 10−33.5981 × 10−3
10Ave8.6095 × 10−18.5745 × 10−18.6033 × 10−18.5849 × 10−18.6226 × 10−18.6026 × 10−18.5886 × 10−18.4937 × 10−18.6065 × 10−18.5987 × 10−1
Std6.0346 × 10−39.8191 × 10−35.7288 × 10−31.1529 × 10−23.4242 × 10−34.2943 × 10−36.3991 × 10−31.3199 × 10−26.1487 × 10−35.4403 × 10−3
cell4Ave7.2796 × 10−17.2795 × 10−17.2795 × 10−17.2856 × 10−17.2795 × 10−17.2795 × 10−17.2795 × 10−17.2795 × 10−17.2795 × 10−17.2795 × 10−1
Std3.1833 × 10−52.2584 × 10−162.2584 × 10−169.9055 × 10−42.2584 × 10−162.2584 × 10−162.2584 × 10−162.2908 × 10−52.2584 × 10−162.2584 × 10−16
6Ave7.3140 × 10−17.2937 × 10−17.2630 × 10−17.3443 × 10−17.3062 × 10−17.2351 × 10−17.2319 × 10−17.2436 × 10−17.2283 × 10−17.2592 × 10−1
Std2.0467 × 10−21.9922 × 10−22.1215 × 10−21.9707 × 10−21.6421 × 10−22.1134 × 10−22.2424 × 10−22.4677 × 10−22.1467 × 10−22.0974 × 10−2
8Ave7.7368 × 10−17.7089 × 10−17.7527 × 10−17.6453 × 10−17.7464 × 10−17.7258 × 10−17.7239 × 10−17.7089 × 10−17.7513 × 10−17.7495 × 10−1
Std9.7507 × 10−31.2523 × 10−25.4677 × 10−31.5869 × 10−27.6730 × 10−47.8557 × 10−39.2329 × 10−31.4845 × 10−24.7834 × 10−32.6755 × 10−3
10Ave8.0444 × 10−18.0296 × 10−18.0596 × 10−18.0411 × 10−18.1015 × 10−18.0610 × 10−18.0479 × 10−17.9724 × 10−18.0680 × 10−18.0915 × 10−1
Std6.8750 × 10−39.3244 × 10−37.9107 × 10−31.0840 × 10−28.0015 × 10−57.2430 × 10−36.7964 × 10−31.0737 × 10−26.5355 × 10−33.5475 × 10−3
columbia4Ave7.1971 × 10−17.1987 × 10−17.1971 × 10−17.1955 × 10−17.1971 × 10−17.1978 × 10−17.1974 × 10−17.1921 × 10−17.1971 × 10−17.1971 × 10−1
Std1.1292 × 10−162.4193 × 10−31.1292 × 10−163.6586 × 10−31.1292 × 10−161.6996 × 10−41.1376 × 10−42.2743 × 10−31.1292 × 10−161.1292 × 10−16
6Ave7.9306 × 10−17.9332 × 10−17.9348 × 10−17.9570 × 10−17.9375 × 10−17.9431 × 10−17.9372 × 10−17.9030 × 10−17.9359 × 10−17.9377 × 10−1
Std1.8474 × 10−34.4889 × 10−31.5345 × 10−38.1408 × 10−33.3876 × 10−161.4197 × 10−31.8446 × 10−36.3202 × 10−32.1375 × 10−38.2384 × 10−5
8Ave8.3752 × 10−18.3449 × 10−18.3709 × 10−18.3449 × 10−18.3738 × 10−18.3658 × 10−18.3666 × 10−18.3439 × 10−18.3669 × 10−18.3766 × 10−1
Std2.9757 × 10−37.5153 × 10−32.0112 × 10−38.6325 × 10−31.1565 × 10−32.4140 × 10−33.4237 × 10−37.3768 × 10−32.7579 × 10−31.1175 × 10−3
10Ave8.6142 × 10−18.6015 × 10−18.6045 × 10−18.6532 × 10−18.5949 × 10−18.6136 × 10−18.5906 × 10−18.5420 × 10−18.6038 × 10−18.6105 × 10−1
Std4.8179 × 10−36.0141 × 10−34.1734 × 10−31.2912 × 10−29.3868 × 10−44.9533 × 10−33.7042 × 10−36.3466 × 10−35.2010 × 10−32.7178 × 10−3
couple4Ave7.2971 × 10−17.2885 × 10−17.2991 × 10−17.2893 × 10−17.2991 × 10−17.2918 × 10−17.2970 × 10−17.2893 × 10−17.2918 × 10−17.2991 × 10−1
Std1.2007 × 10−32.5780 × 10−33.3876 × 10−162.8759 × 10−33.3876 × 10−161.3475 × 10−37.9470 × 10−43.3411 × 10−31.3475 × 10−33.3876 × 10−16
6Ave8.3226 × 10−18.3280 × 10−18.3314 × 10−18.3099 × 10−18.3313 × 10−18.3343 × 10−18.3323 × 10−18.3053 × 10−18.3319 × 10−18.3313 × 10−1
Std1.5334 × 10−31.2932 × 10−37.4539 × 10−44.3889 × 10−32.0419 × 10−47.3568 × 10−49.8343 × 10−44.5662 × 10−36.1716 × 10−42.0419 × 10−4
8Ave8.7659 × 10−18.7639 × 10−18.7699 × 10−18.7215 × 10−18.7783 × 10−18.7766 × 10−18.7734 × 10−18.7503 × 10−18.7760 × 10−18.7778 × 10−1
Std1.5501 × 10−33.5710 × 10−37.5826 × 10−44.7311 × 10−33.3876 × 10−165.6560 × 10−48.6225 × 10−43.8435 × 10−35.0269 × 10−43.0561 × 10−4
10Ave9.0309 × 10−19.0306 × 10−19.0372 × 10−19.0017 × 10−19.0398 × 10−19.0429 × 10−19.0488 × 10−19.0000 × 10−19.0460 × 10−19.0378 × 10−1
Std1.6416 × 10−33.7762 × 10−37.0856 × 10−43.5116 × 10−31.6428 × 10−49.0869 × 10−41.5499 × 10−34.1125 × 10−31.4444 × 10−34.4981 × 10−4
Table 15. Comparison of running times of various algorithms.
Table 15. Comparison of running times of various algorithms.
Image/AlgorithmGJASSLOESCSBOAMISBOA
baboon26.0922.0540.7422.7123.77
bank26.2024.4940.8022.1522.85
barbara26.5024.7841.3222.4623.05
boat26.8924.9941.9522.7223.51
brain26.1924.5440.8822.2122.90
bridge44.8141.1573.9436.2738.05
camera26.1224.4140.7222.0722.68
cell84.3776.88152.0465.6869.91
columbia26.2624.5240.9322.1422.82
couple26.8225.0441.4522.7323.47
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Yuan, X.; Qin, J.; Zhong, X. A Multi-Strategy Enhanced Bionic-Inspired Secretary Bird Optimization Algorithm for Numerical Optimization and Artistic Image Segmentation. Biomimetics 2026, 11, 385. https://doi.org/10.3390/biomimetics11060385

AMA Style

Yuan X, Qin J, Zhong X. A Multi-Strategy Enhanced Bionic-Inspired Secretary Bird Optimization Algorithm for Numerical Optimization and Artistic Image Segmentation. Biomimetics. 2026; 11(6):385. https://doi.org/10.3390/biomimetics11060385

Chicago/Turabian Style

Yuan, Xuanqi, Jinlu Qin, and Xiaohan Zhong. 2026. "A Multi-Strategy Enhanced Bionic-Inspired Secretary Bird Optimization Algorithm for Numerical Optimization and Artistic Image Segmentation" Biomimetics 11, no. 6: 385. https://doi.org/10.3390/biomimetics11060385

APA Style

Yuan, X., Qin, J., & Zhong, X. (2026). A Multi-Strategy Enhanced Bionic-Inspired Secretary Bird Optimization Algorithm for Numerical Optimization and Artistic Image Segmentation. Biomimetics, 11(6), 385. https://doi.org/10.3390/biomimetics11060385

Article Metrics

Back to TopTop