Next Article in Journal
The Impact of Adding Digital Breast Tomosynthesis to BI-RADS Categorization of Mammographically Equivocal Breast Lesions
Previous Article in Journal
Managing Viral Emerging Infectious Diseases via Current and Future Molecular Diagnostics
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

An Improved Search and Rescue Algorithm for Global Optimization and Blood Cell Image Segmentation

1
Faculty of Computers and Information, Minia University, Minia 61519, Egypt
2
Department of Information Technology, College of Computer and Information Sciences, Princess Nourah bint Abdulrahman University, P.O. Box 84428, Riyadh 11671, Saudi Arabia
*
Authors to whom correspondence should be addressed.
Diagnostics 2023, 13(8), 1422; https://doi.org/10.3390/diagnostics13081422
Submission received: 9 March 2023 / Revised: 8 April 2023 / Accepted: 12 April 2023 / Published: 15 April 2023
(This article belongs to the Section Machine Learning and Artificial Intelligence in Diagnostics)

Abstract

:
Image segmentation has been one of the most active research areas in the last decade. The traditional multi-level thresholding techniques are effective for bi-level thresholding because of their resilience, simplicity, accuracy, and low convergence time, but these traditional techniques are not effective in determining the optimal multi-level thresholding for image segmentation. Therefore, an efficient version of the search and rescue optimization algorithm (SAR) based on opposition-based learning (OBL) is proposed in this paper to segment blood-cell images and solve problems of multi-level thresholding. The SAR algorithm is one of the most popular meta-heuristic algorithms (MHs) that mimics humans’ exploration behavior during search and rescue operations. The SAR algorithm, which utilizes the OBL technique to enhance the algorithm’s ability to jump out of the local optimum and enhance its search efficiency, is termed mSAR. A set of experiments is applied to evaluate the performance of mSAR, solve the problem of multi-level thresholding for image segmentation, and demonstrate the impact of combining the OBL technique with the original SAR for improving solution quality and accelerating convergence speed. The effectiveness of the proposed mSAR is evaluated against other competing algorithms, including the L’evy flight distribution (LFD), Harris hawks optimization (HHO), sine cosine algorithm (SCA), equilibrium optimizer (EO), gravitational search algorithm (GSA), arithmetic optimization algorithm (AOA), and the original SAR. Furthermore, a set of experiments for multi-level thresholding image segmentation is performed to prove the superiority of the proposed mSAR using fuzzy entropy and the Otsu method as two objective functions over a set of benchmark images with different numbers of thresholds based on a set of evaluation matrices. Finally, analysis of the experiments’ outcomes indicates that the mSAR algorithm is highly efficient in terms of the quality of the segmented image and feature conservation, compared with the other competing algorithms.

1. Introduction

Image thresholding is a popular operation used in computer vision to process and analyze images in fields such as medicine, engineering, agriculture, and manufacturing. It is most commonly used in image segmentation to provide accurate feature extraction in biological image processing, pattern recognition, and robotic vision [1]. Thresholding is one of the most important main segmentation steps that has proven effective in different applications [2,3]. The main goal of image thresholding is to obtain optimal threshold values from the image, for which the image histogram is used. The histogram is a vital step in the segmentation methods for defining the probability distribution value of pixels in the image [4]. The thresholding technique can be classified into two different groups: multi-level and bi-level thresholding. Multi-level thresholding usins two or more thresholding values to split an image into many different groups, while bi-level thresholding uses one threshold value to split an image into two groups [5,6].
Recently, many researchers have illustrated the capability of MHs to solve a diversity of complex optimization problems in different fields, such as biomedical [7], engineering [8,9], medical [10,11], communications [12], image segmentation [13], and feature selection [14]. MHs are considered flexible, non-derived, and highly clever in obtaining an optimal solution. Furthermore, these algorithms are considered the best method for providing the best solutions for complex optimization problems with the latest developments in computer techniques. Due to their advantages, MHs have become widely utilized to realize the optimal thresholds of color and gray-level images. MHs applied the search procedure to a problem landscape with a set of search agents that act as candidate solutions created repeatedly in an iterative procedure using heuristic operators. These operators, when utilized in various orders, generate different search strategies. In the same context, MHs are classified into four main groups: swarm-based algorithms, natural evolution-based algorithms, human-based algorithms, and physics-based algorithms [15,16].
As per published researches on swarm-based algorithms (SA), SA mimics the behavior of an organism within groups. Organisms usually interact with one another to achieve the best collective behavior [17]. Some works published in these offshoots, such as particle swarm optimization (PSO) [18], mimic the hunting behavior of birds and fish swarms. The natural evolution-based algorithms imitate biological evolution processes such as recombination, crossover, mutation, and feature inheritance in offspring [19]. The fitness function determines the quality of candidate solutions to the optimization problems, which work as individuals in a population. The genetic algorithm (GA) [20] and differential evolution (DE) [21] are two evolutionary algorithms inspired by biological evolution. The third category of MHs is human-based algorithms that mimic gregarious human attitudes. Many algorithms belong to these branches, such as the heap-based optimizer (HBO) [22], election campaign algorithm (ECA) [23], and teaching–learning-based optimization (TLBO) [24]. The fourth category of MHs is called physics-based algorithms, and these are inspired by physics to create factors that allow for the search of the best solution within the search scope. Many algorithms have been published in this branch, such as the electromagnetism-based algorithms (EMO) [25] and the GSA algorithm [26].
In the literature, several theories have been proposed to explain the efficacy of MHs on image thresholding [27,28]. There are several examples of MHs in this field; nevertheless, the following are a few notable state-of-the-art research efforts. In [29], the moth-swarm algorithm (MSA) was used to determine the optimal threshold values with the Kapur method. Additionally, ant colony optimization (ACO) in [30] is utilized in image segmentation based on a non-local 2D histogram and Kapur’s entropy as object functions with the multi-threshold image segmentation (MTH) method. In [31], researchers used the Otsu and Kapur methods with a modified firefly algorithm to process images. In the same context, three new versions of the manta ray foraging optimization algorithm and the chimp optimization algorithm (ChOA) have been proposed to tackle the image segmentation problem using multi-level thresholding [32,33,34]. The researchers in [35] used (MTH) image segmentation with a novel concept of MHs called hyper-heuristics, in which each iteration defined the best execution sequence of MHs to determine the best thresholds. In [27], the black widow optimization (BWO) algorithm used Otsu or Kapur techniques as an objective function with multi-level thresholding to determine the optimal thresholding value in the gray level. An efficient krill herd (EKH) algorithm in [36] was utilized to determine the best thresholding values at different levels for color images, with Kapur’s entropy, Tsallis entropy, and the Otsu methods. The HHO algorithm is the novel algorithm in [37], and the hybridization of HHO is accomplished by adding another efficient algorithm, the DE algorithm, which together is termed HHO-DE. In particular, the entire population is divided into two equal subpopulations that will be assigned to the DE and HHO algorithms, respectively, and this hybridization used Otsu and Kapur’s methods as the objective functions.
Regardless of the previous optimization methods, SAR [38] is also used to determine the optimal multi-level thresholding for image segmentation. In terms of efficiency and simplicity, the SAR outperforms several other biologically inspired procedures as a competitive and modern population-based optimization technique. It mimics the exploration behavior of humans during search and rescue operations. The researchers [38] have proven that SAR performs better in terms of stability and accuracy when compared with other optimization techniques when tested on standard benchmark functions.
Many of the MHs used to solve various optimization problems in the literature, such as a lack of global search capability, early conversion, or trapping in local regions. This gives researchers a yardstick to propose hybrid and modified versions. Many researchers use OBL to improve the search efficiency of MHs [39]. Tizhoosh released the first version of OBL in 2005 [40], and MHs have used it in a variety of ways to improve exploratory searchability. The researchers improved the elephant herding optimization (EHO) using dynamic Cauchy mutation (DCM) and OBL learning for solving multi-thresholding problems [41]. DCM healed premature convergence, and OBL resolved slow convergence in EHO, according to the authors. This study utilized Otsu and Kapur’s methods as two fitness functions to determine threshold values for image segmentation. In [42], the marine predator algorithm (MPA) is improved using OBL (MPA-OBL) for enhancing convergence and search efficiency and solving the IEEE CEC’2020 benchmark problems. MPA-OBL used Kapur’s and the Otsu methods as two fitness functions with a diversity of benchmark images at different thresholds.
In spite of some studies related to MHs and OBL to solving image thresholding problems, it is difficult to find more research related to relevant literature. Nevertheless, OBL-based MHs are often applied to different optimization problems. As a result, the purpose of this study is to deepen the research in the image segmentation field by employing the most recent SAR; in reality, this is the first instance of SAR implemented on the image segmentation and CEC’2020 benchmark functions. SAR was introduced in July 2020 to mimic the exploration behavior of humans during search and rescue operations, which outperformed a huge number of well-known counterparts on a variety of engineering and mathematics benchmark problems. Despite the efficacy of SAR’s search mechanisms, there are some fields where it may be enhanced further to prove its efficiency on various optimization problems, such as image thresholding problems, because the algorithm may miss some critical search regions. To solve this problem, we combined the SAR algorithm with OBL (SAR-OBL) to generate solutions from potential regions for exploring search space more rigorously. More crucially, we enhance its local search capability by utilizing solutions generated from the surrounding promising regions to avoid the trap of local optima. As a result, the proposed SAR diversity comes with a trade-off balance between exploration and exploitation. We evaluate the proposed SAR-OBL on CEC’2020 benchmark functions before it is used to solve multi-level image thresholding problems.
The main goal of this paper is to enable researchers to use a novel metaheuristic algorithm with opposition-based learning (OBL) to increase the performance of image segmentation in the medical field. Furthermore, this paper aims to discuss the benefits and downsides of the mSAR algorithm in image segmentation. Finally, the main contributions of this paper can be summarized as follows:
  • An improved opposition-based search and rescue optimization algorithm (mSAR) is presented.
  • The search efficiency and convergence of mSAR have been improved.
  • Fuzzy entropy and the Otsu method are applied.
The paper is structured as follows: in Section 2, the SAR algorithm and OBL search strategy will be discussed. Section 2.3 is devoted to a mathematical model of fuzzy entropy and Otsu methods. Section 3 presents the proposed algorithm. The evaluation of SAR-OBL is presented in Section 4. The experimental results are discussed and analyzed in Section 5. The conclusion is reported in Section 6.

2. Preliminaries

This section studies the inspiration of the SAR algorithm and its mathematical model and discusses the OBL strategy.

2.1. Search and Rescue Optimization Algorithm

The mathematical model of the SAR algorithm is discussed in this section. Search and rescue operations are one type of group exploration. A search is a methodical operation that employs resources and available personnel to identify the individuals involved in the ordeal. A rescue operation seeks to recover people who are in danger and transport them to a safe location. Humans search in groups, and each searching group regulates its practice to be ready for its respective operations. Based on their training, humans can find clues and traces of missing people. The found clues are of varying value and contain varying amounts of information regarding the missing individuals. For example, some clues refer to the probability of the presence of lost individuals in that area. The clues are evaluated by each group member depending on his or her training. This evaluation delivers information about the found clues to other members via communication equipment. Last but not least, they search based on the information gleaned from them and the significance of these hints. Social and individual stages are the main stages in search and rescue operations. In the social stage, searching is based on the location of found clues and their importance, while in the individual stage, the search is executed regardless of the importance of clues. Clues can be divided into two types: hold clues and abandoned clues.

2.1.1. The Clues

The positions of the left clues are saved in a memory matrix X in the model we proposed, while the positions of the humans are saved in a position matrix Y. The dimensions of matrix X are the same as those of matrix Y. They are M × N matrices, where M is the number of the members of the group and N refers to the problems’ dimension. The clues matrix Z contains the locations of the discovered clues, and it is composed of matrices Y and X. Most new solutions in individual and social stages are introduced dependent on the clue matrix, and this is a primary part of SAR. Equation (1) presents the clue matrix Z and matrices X, Y, and Z are upgraded in each of the human search stages.
Z = Y X = Y 11 Y 1 N Y M 1 Y M N X 11 X 1 N X M 1 X M N ,
where Y and X are human locations and memory matrices, respectively, and  Y M 1 is the first dimension location for human Mth. Furthermore, the first memory’s Nth dimension is located at X 1 N . The two stages of human search are modeled in the following section.

2.1.2. Social and Individual Stages

According to the preceding explications, Equation (2) is utilized to determine the search direction.
S D k = Y k Z j , j k
where the location of the jth clue, the location of the kth human, and the search direction for the kth human are Z j , Y k , and  S D k , respectively. j is a random parameter inside (1, 2M). For  k = j , Z k will be equal to Y k . Thus, j is elected in such a way that j k . The social phase can be implemented by Equation (3).
Y j , i = Z k , i + r 1 × X j , i Z k , i if f Z k > f X j X j , i + r 1 × X j , i Z k , i otherwise X j , i if r 2 < S E or i = i rand i = 1 , , N ,
where the location of the ith dimension for the jth human is Y j , i . The new location of the ith dimension for the kth clue is Z k , i . The fitness function values for the solution X j and Z k are f X j and f Z k , respectively. r 1 is a random parameter inside [ 1 , 1 ] , r 2 and S E are a distributed random parameters inside range [ 0 , 1 ] . i rand is a random parameter inside range 1 and N which used to ensure that at least one dimension of Y j , i is different from X j , i . Equation (3) shows the new location of the jth human in all dimensions.
The individual stage used Equation (4) to determine the new location of the jth human.
Y j = X j + r 3 × C k C m , j k m .
where k, m are random values ranging between 1 and 2 N . This way, j k m was employed for choosing k and m to prevent moving along other clues. r 3 is a random value with a uniform distribution inside the range [ 0 , 1 ] . Equation (5) is used to modify the new location of the jth human.
Y j , i = X j , i + X i max / 2 if X j , i > X i max X j , i + X i min / 2 if X j , i < X i min , i = 1 , , N ,
where X i min , X i max are the values of the minimum and maximum threshold for ith dimension, respectively.

2.1.3. Update Locations and Information

Members of the group will search according to these two stages in each iteration, and if the value of the fitness function after each stage in the first location is f X j less than the second location Y j f Y j . The first location X j will be saved in a random location of the memory matrix (M).
M n = X j if f Y j > f X j M n otherwise ,
X j = Y j if f Y j > f X j X j otherwise ,
where M n indicates the location of the nth saved clue in the memory matrix and the random value ranged between 1 and N is n.

2.1.4. Constraint-Handling Strategies

The penalty functions strategy, the ε -constrained method, and stochastic ordering are all methods for dealing with constraints. The ε -constrained method is one of the prevalent constraint-handling methods used in this study. According to this strategy, for a maximizing problem, this technique considers one solution to be better than another solution if the following requirements are satisfied:
X 2 is better than X 1 : f X 2 > f X 1 if G X 2 ε and G X 1 ε f X 2 > f X 1 if G X 2 = G X 1 G X 2 < G X 1 otherwise .
The parameter ε is used to control the size of feasible space and this parameter can be calculated by Equation (8).
The SAR algorithm is compared using the ε -constrained technique for constraint optimization problems. Thus, Equations (3), (6) and (7) are updated as follows:
Y j , i = Z k , i + r 1 × X j , i Z k , i if f Z k is better than f X j X j , i + r 1 × X j , i Z k , i otherwise X j , i if r 2 < S E or i = i rand i = 1 , , N ,
M n = Y j if Y j is better than X j M n otherwise ,
X j = Y j if Y j is better than X j X j otherwise ,
where Z k or Y j are better than X j if and only if Equation (8) is satisfied.

2.2. Opposition-Based Learning

OBL is a new mechanism in computational intelligence, and the main principle of OBL is to enhance the efficiency of the optimization OBL of MHs [42]. HR. Tizhoosh [40] introduced the OBL. Many researchers use OBL to enhance the quality of their population-initiated solutions by diversifying these solutions. In general, in MHs, when the initial solutions are near the optimal location, convergence occurs quickly; moreover, late convergence is expected. In this case, the OBL technique provides additional solutions by taking into account opposite search regions that may be near the global optimum. For understanding the definition of OBL, the opposite point of P is computed by:
z j = u b j + l b j z j ,
where u b and l b are upper and lower bounds for the jth component of a vector z.
Previous studies indicate that researchers in the MH community have predominantly used various MHs. For instance, in [43], the HHO algorithm used the OBL strategy to enhance the search efficiency of the algorithm. While the researchers in [44] presented a new version of SCA based on OBL, this version is designed to jump out of local optima during the search processes. An improved whale optimization algorithm (WOA) is developed in [45] by combining the OBL and DE algorithms for improving exploration and exploitation by generating opposite values. In [46], researchers used OBL to improve the grasshopper optimization algorithm to solve engineering problems and benchmark functions. The EO algorithm used OBL and a set of novel update rules in [47] for modifying the EO, and this modification is called m-EO. The shuffled frog-leaping algorithm (SFLA) used the OBL to improve SFLA in [48], where OBL is combined into the memeplexes before the frog initiates foraging. In [49], researchers combine OBL with an enhanced scatter search (eSS) for large-scale parameter estimation in kinetic models of medical fields. According to this research work, OBL is employed only during the initiation phase for improving the rate of convergence and avoiding tumbling into the local optima of SAR. After that, mSAR is utilized for solving the problem of multi-thresholding for image segmentation using fuzzy entropy and the Otsu variance as objective functions.

2.3. Image Thresholding Methods

In this subsection, the mathematical model of two object functions used in image thresholding is explained, and these object functions are fuzzy entropy [50] and Otsu variance [51].

2.3.1. Fuzzy Entropy

In fuzzy entropy [52], the size of an image is termed as N M , and the original image I will be D = { ( j , i ) j = 0 , , N 1 ; i = 0 , , M 1 } . T 1 and T 2 are two thresholds for dividing the image into three regions E u , E m , E l , in which these regions define the pixels of high gray levels, pixels of low gray levels, and pixels of middle gray levels repetitively. Usually, Equation (13) is utilized to calculate the histogram of the image as follows:
H k = n k N M , k = 0 N M H k = 1 ,
where k is an intensity level inside ranged ( 0 k L 1 ) . n k is the number of occurrences of the k in the image represented by the histogram. The probability distribution of gray level k is H k . The probability distribution of E u , E m , and  E l can be computed as:
p u = P E u ; p m = P E m ; p l = P E l ,
We choose μ d , μ m , μ b as the membership functions of E u , E m , E l as shown in Figure 1. There are six fuzzy parameters, and these are q 1 , u 1 , v 1 , q 2 , u 2 , v 2 . Therefore, these parameters are used to determine T 1 and T 2 . According to the previous statements, the probability distribution of three regions can be calculated by the following formula:
p u = k = 0 255 p k p u k = k = 0 255 p k μ d ( k ) , p m = k = 0 255 p k p m k = k = 0 255 p k μ m ( k ) , p l = k = 0 255 p k p l k = k = 0 255 p k μ b ( k ) ,
where the conditional probability of a pixel that is classified into three partitions are p u / k , p m / k , p l / k and satisfy the constraint of p u / k + p m / k + p l / k = 1 .
The mathematical model of the three membership functions is defined as follows:
μ d ( k ) = 1 k q 1 1 k q 1 2 v 1 q 1 u 1 q 1 q 1 k u 1 k v 1 2 v 1 q 1 v 1 u 1 u 1 k v 1 0 k v 1 ,
μ m ( k ) = 0 k q 1 k q 1 2 v 1 q 1 u 1 q 1 q 1 k u 1 1 k v 1 2 v 1 q 1 v 1 u 1 u 1 k v 1 1 v 1 k q 2 ,
μ b ( k ) = 0 k q 2 k q 2 2 v 2 q 2 u 2 q 2 q 2 k u 2 1 k v 2 2 v 2 q 2 v 21 u 2 u 2 k v 2 1 k v 2 ,
the six parameters q 1 , u 1 , v 1 , q 2 , u 2 , v 2 must fulfill the condition 0 q 1 < u 1 < v 1 < q 2 < u 2 < v 2 255 . In order to reach the maximum value of entropy, a combination of the membership function’s variables must be found. As a result, the most applicable threshold can be computed as follows:
μ d T 1 = μ m T 1 = 0.5 , μ m T 2 = μ b T 2 = 0.5
According to the previous equations, the thresholds T 1 and T 2 can be computed by Equations (16)–(18) and the result is as following:
T 1 = q 1 + v 1 q 1 u 1 q 1 / 2 q 1 + v 1 / 2 u 1 v 1 v 1 v 1 q 1 v 1 u 1 / 2 q 1 u 1 q 1 + v 1 / 2 , T 2 = q 2 + v 2 q 2 u 2 q 2 / 2 q 2 + v 2 / 2 u 2 v 2 v 2 v 1 q 2 v 2 u 2 / 2 q 2 u 2 q 2 + v 2 / 2 .

2.3.2. Otsu Method

The Otsu technique [51] is one of the most commonly utilized segmentation methods for finding optimal threshold values by maximizing the class variance. The intensity levels L for each color image are within the range 0 , 1 , 2 , L 1 . The probability distribution of the intensity value is computed as follows:
P h j = N j n k , P h j 0 , j = 1 L P h j = 1 ,
where n k denotes the number of pixels in the image and j is an intensity level in the range ( 0 j L 1 ) . The number of gray level i in the image represented by the histogram is N i , and the probability distribution of the intensity levels is P h j . For bi-level segmentation, the classes are computed as follows:
C a = P h 1 ω 1 ( t h ) , , P h t h ω 1 ( t h )   and   C b = P h t h + 1 c ω 2 ( t h ) , , P h L ω 2 ( t h ) .
where ω 1 ( t h ) and ω 2 ( t h ) are the cumulative probability distributions for C a and C b , respectively. ω 1 ( t h ) and ω 2 ( t h ) can be computed by the following:
ω 1 ( t h ) = j = 1 t h P h j   and   ω 2 ( t h ) = t h + 1 L P h j .
The mean levels μ 1 and μ 2 must be computed that define the classes using Equation (24). Equation (25) is used for computing the Otsu-based between-class σ A 2 .
μ 1 = j = 1 t h j P h j ω 1 ( t h )   and   μ 2 = j = t h + 1 L j P h j ω 2 ( t h ) ,
σ A 2 = σ a + σ b .
Additionally, σ a and σ b are the variance of C a and C b and are calculated as follows:
σ a = ω 1 ( μ 1 + μ T ) 2   and   σ b = ω 2 ( μ 2 + μ T ) 2 ,
where μ T = ω 1 μ 1 + ω 2 μ 2 and ω 1 + ω 2 = 1 based on the values σ a and σ b , the objective function is defined by Equation (27). As a result, the optimization problem is decreased to determine the intensity level that maximizes Equation (27):
F o t s u ( t h ) = max ( σ A 2 ( t h ) )   where   0 t h L 1 ,
where the Otsu method variance for a given t h value is σ A 2 ( t h ) . EBO methods are utilized for determining the intensity level t h to maximize the objective function according to Equation (27). The objective or fitness function F o t s u ( t h ) can be modulated for multiple thresholds as:
F o t s u ( T H ) = Max ( σ A 2 ( t h ) )   where   0 t h L 1   and   j = [ 1 , 2 , 3 , , n ] ,
where T H = [ t h 1 , t h 2 , , t h n 1 ] illustrates a vector including MTH, and the variance is calculated by Equation (29).
N σ A 2 = j = 1 n σ j = j = 1 n ω 2 ( μ 2 μ T ) 2 .
μ j is the mean of a class,  ω j is the occurrence probability, and j represents a specific class.

3. The Proposed mSAR

In this section, a new technique that improves SAR is explained in detail and called mSAR. The SAR algorithm is improved based on OBL as a local research strategy to reinforce the convergence of the algorithm by enhancing the variety of its solutions and avoiding the drawbacks of the random population. As a result, mSAR utilizes OBL in the initialization phase to improve the search process as follows:
O j = L B i + U B i X j , j 1 , 2 , , n ,
where O j is a vector-maintaining solution obtained by using OBL. L B i and U B i are the lower and upper bounds of the i t h component of a vector X. Finally, the phases below are given further detail on the phases of the proposed image thresholding model.

3.1. Initialization Phase in mSAR

In the first phase, the proposed model begins by reading the image from the benchmark dataset, calculating the histogram of the selected image, and calculating the probability distribution of the selected images by Equation (13). In the next step, the algorithm initializes the mSAR parameters, such as problem dimensions D, population size N, boundaries of the search space ( L B i , U B i ), and the maximum iteration number T. The SAR, like many other optimization algorithms, begins by randomly initializing the first population x 0 and then storing the results. Following that, the OBL concept is used to compute the O j vector maintaining solution using Equation (30).

3.2. Optimization Phase

During this phase, we estimate the fitness values of the X j and O j populations to determine the optimal algorithmic threshold values. For updating the search agents’ locations, use the fitness value of the best threshold of the fuzzy entropy [52] or the Otsu [51] methods as the fitness function, and then compare the fitness values of O j and X j and store the optimal solution with the highest fitness. The optimization algorithm processes are split into two stages: the social and individual stages, as studied in the subsection on SAR. Following the implementation of the two phases of the optimization algorithm, each search agent updates its location repeatedly based on the best fitness values of O j and X j , using the fuzzy entropy Equation (19) or the Otsu Equation (28), as described in Algorithm 1. The flowchart of the proposed mSAR algorithm is represented in Figure 2.

3.3. Final Phase of mSAR

After executing the optimization phase, fitness upgrade, memory storing, and search agents’ location upgrade using Equation (30), the proposed algorithm selects the optimal threshold values to generate the segmented image. The pseudo-code of the proposed algorithm is displayed in Algorithm 1.
Algorithm 1 The proposed mSAR algorithm
Input: Set parameters values ( N = 50 , P = 0.5 , T max = 350 , t = 30 , S E = 0.05 );
Output: Return the optimal solution with the optimal threshold values onto the image.
 Generate the first population X j 0 randomly with dimensions D.
 Utilize Equation (30) to apply OBL on the first population X j 0 and save outcomes in O j .
while  ( t I t e r max )  do
  for  j N  do
   Estimate X j utilizing fuzzy entropy Equation (19) or Otsu Equation (28) and save outcomes in f i t j .
   Estimate O j utilizing fuzzy entropy Equation (19) or Otsu Equation (28) and save outcomes in F i t O j .
   if  F i t j < F i t O j  then
     X j = O j ;
   end if
  end for
  Complete the memory saving.
  if  t < I t e r max 3  then
   Upgrade nominee solutions by Equation (9).
  else if  I t e r max 3 < t < 2 × I t e r max 3  then
   Upgrade search agents’ location by Equation (11).
  else if  t > 2 × I t e r max 3  then
   Upgrade nominee solutions by Equation (30).
  end if
  The optimal solution found so far will update.
  for each candidate solution do
   Estimate X j after upgrade by fuzzy entropy Equation (19) or Otsu Equation (28) and save outcomes in f i t j .
   Estimate O j after upgrade by fuzzy entropy Equation (19) or Otsu Equation (28) and save outcomes in F i t O j .
   if  F i t j < F i t O j  then
    Set X j = O j ;
   end if
  end for
  Execute memory storing and fitness updates.
  Define the optimal value of search agents’ location.
  Save the outcomes.
end while
 Return the optimal solution with the optimal threshold values onto the image.

3.4. Computational Complexity of mSAR

This subsection illustrates the computational complexity of the proposed mSAR. Firstly, the complexity of the initialization process can be described as O ( 2 × N × D ) , where N and D indicate the number of search agents and the dimension of the problem, respectively. During the initialization phase of the mSAR algorithm, sorting the search agent takes O ( 2 N log ( 2 N ) ) times. In the worst cases, the complexity of the social and individual phases is O ( N × D ) . However, the complexity of the abandoning clue and restart processes in the worst cases are O ( N × D ) . Furthermore, O ( T ) time complexity is required for mSAR to execute T of its main operations (initialization phase, social phase, abandoning clue, individual phase, restart strategy, and OBL). As a result, the mSAR computes the fitness of each agent with complexity as follows:
O ( m S A R ) = O ( 2 × N × D ) + O ( 2 N log ( 2 N ) ) + t max × ( O ( N × D ) + O ( N × D ) + O ( N × D ) + O ( N × D ) )
Overall, the total computational complexity of the proposed mSAR can be represented by O ( T × t max × N × D ) .

4. Performance Evaluation of mSAR on CEC’20 Test Suit

4.1. Parameter Settings of CEC’2020

In this subsection, the evaluation of the proposed mSAR algorithm is introduced. Therefore, the proposed mSAR algorithm used the IEEE Congress on Evolutionary Computation (CEC) [53] as a test problem for estimating the algorithms’ performance. The performance of mSAR is estimated over the CEC’2020 benchmark functions. Firstly, this benchmark function includes 10 test problems and can be classified into four types. This benchmark function includes unimodal, multimodal, hybrid, and composition functions. The mathematical formulation and parameter-setting of the CEC’2020 benchmark test are shown in Table 1; ’Fi*’ indicates the optimal global value. A two-dimensional visualization of the CEC’2020 functions is shown in Figure 3 to explain the differences and the nature of each problem.

4.2. Statistical Results Analysis

The performance of the proposed mSAR is estimated by utilizing the CEC’2020 benchmark test, which contains qualitative and quantitative metrics. The mean and standard deviation (STD) of optimal solutions obtained by the proposed algorithm and all other algorithms compared are quantitative metrics. Furthermore, the average fitness history, search history, and convergence curve are qualitative metrics. We utilized these qualitative metrics for estimating the performance of the proposed mSAR on the CEC’2020 benchmark test against seven well-known metaheuristic algorithms, namely LFD, HHO, SCA, EO, GSA, AOA, and the original SAR. The STD and mean of the optimum value produced from the proposed mSAR algorithm against other competing algorithms are illustrated in Table 2, and the optimum value of the mean and STD are minimum values in outcomes. According to the STD and mean results in Table 2, the proposed mSAR algorithm outperforms other competing algorithms on the CEC’2020 benchmark functions.

4.3. Boxplot Analysis of mSAR Algorithm

Boxplot analysis is utilized to represent the data distribution characteristics. The boxplot analysis indicates the quality of the optimizers’ solutions and is used for reporting data with a homogeneous variance and a normal distribution. Figure 4 illustrates the outcomes of the boxplot of the proposed mSAR algorithm compared with other competitive algorithms. The boxplot is an excellent plot for showing data distributions in quartiles. The maximum and minimum are the highest and lowest data points acquired by the algorithm, which are the whiskers’ edges. These quartiles are the lower and upper quartiles, which are determined by the ends of the rectangles, and a narrow boxplot indicates the highest agreement among data. The outcomes of the boxplot of the proposed mSAR algorithm with other competitive algorithms and the outcomes of the ten functions boxplot for D = 20 are illustrated in Figure 4. Indeed, the proposed mSAR algorithm outperforms other competing algorithms on the majority of the benchmark functions, but its performance on F 3 and F 7 is limited.

4.4. Curves of Convergence of mSAR Algorithm

This subsection describes the convergence curves of the proposed SAR algorithm and other competing algorithms. The convergence curves of SCA, HHO, AOA, EO, LFD, GSA, SAR, and mSAR for the CEC’2020 functions are shown in Figure 5. Moreover, the mSAR algorithm reached a stable point for most functions and acquired optimal solutions for an algorithm. Therefore, most problems that need fast computation, such as online optimization problems, can be solved by the mSAR algorithm. The mSAR algorithm displayed stable behavior, and due to space limitations, its solutions converged quickly in most of the problems in which it was evaluated.

4.5. Qualitative Metrics

Even though previous outcome studies assured the proposed mSAR algorithms’ superior performance, more experiments and analyses would help us draw more definitive conclusions regarding the algorithms’ performance in solving real problems. The qualitative analysis of the mSAR algorithm is illustrated in Figure 6. The first and second columns in the figure describe the CEC’2020 benchmark functions in two-dimensional space and show the search history of the agent. The average fitness history over 350 iterations is shown in the third column, which explains the agents’ overall behavior and their contribution to locating the optimum solution. Most of the history curves gradually decrease according to average fitness history, indicating that the population improves with each iteration. The optimization history and convergence curve are shown in the fourth column. The optimization history is reduced according to Figure 6. This means that the solution is optimized during iterations until the best solution is found.

5. Application of mSAR: Blood Cells Images Segmentation

The experimental environment of the proposed mSAR algorithm is illustrated in this section. The test images used for the experiments are presented first, followed by the empirical setup. Then, we analyzed the outcomes acquired by mSAR in terms of PSNR, SSIM, FSIM, and fitness.

5.1. Benchmark Images

To examine the performance of the proposed mSAR algorithm and determine the best threshold values, eight images of the benchmark were used. These images were taken in the core laboratory at the Hospital Clinic of Barcelona during the diagnosis of malaria infection [54]. The images in the dataset are in the format JPG (RGB, 2400 × 1800 pixels). These images have different features based on their histograms, as observed in Figure 7. The purpose of selecting these images is to test the performance and quality of the segmented images.

5.2. Experimental Setup

This subsection compares the proposed mSAR algorithm to seven metaheuristic algorithms: LFD [8], HHO [37], SCA [55], EO [56], GSA [26], AOA [57], and the original SAR [38]. All experiments were implemented in Matlab 2015 and executed on an Intel Core I5 with 6 GB of RAM running in a Windows 8.1 64-bit environment. To achieve a fair comparison, all competitor algorithms executed 30 runs per test image, the maximum number of iterations was set to 350, and the population was 50. Each algorithm’s parameter settings were defined using standard criteria and information from previous literature (default values). All experiments were executed on images using various thresholds: are t h 2 , t h 5 , t h 7 , and t h 10 according to related literature [58]. Table 3 presents the parameter settings of the mSAR algorithm and its value.

5.3. Performance Metrics

Five metrics were used for evaluating the quality of the image and comparing the edges of the segmented images: Wilcoxon rank test, standard deviation (STD), peak signal-to-noise ratio (PSNR) [59], feature similarity (FSIM) [60], and structural similarity (SSIM) [61]. The algorithm becomes more stable when the value of STD is decreased by [62]. The STD can be defined as follows:
S T D = j = 1 n σ j μ n ,
where n is the total number of pixels in the image, μ is the mean of pixels, and σ j is the value of jth in the image.

5.3.1. Peak Signal-To-Noise Ratio (PSNR)

PSNR [59,60] is a metric utilized for estimating the performance of the segmented image and computing the difference between the original image and its segmented image, and defined as follows:
P S N R = 20 log 10 ( 255 R M S E ) , R M S E = ( j = 1 n r i = 1 n c ( ( I ( j , i ) S e g ( j , i ) ) 2 ) n r × n c ) .
In Equation (33), I is the original image, and S e g is the segmented image of size n r × n c . The root-mean-squared error is R M S E .

5.3.2. Feature Similarity Index (FSIM)

FSIM [61] is another measure used to map the features and measure the similarities based on the internal features of the image. FSIM is computed by the following:
F S I M = u ϵ Ω S L ( u ) P C n ( u ) u ϵ Ω P C n ( u ) ,
where the entire domain of the image is Ω , and the value of P C n ( u ) is described as follows:
P C = E ( ω ) ϵ + n A n ( ω ) ,
where the magnitude of the vector in ω on n is E ( ω ) , and the amplitude’s local on scale n is A n ( ω ) . ϵ is the small positive value and P C n ( u ) = max P C 1 ( u ) , P C 2 ( u ) .

5.3.3. Structural Similarity Index (SSIM)

The value of SSIM is higher when the original image will be better segmented because the structures in the two images match. SSIM is defined in Equation (36).
S S I M ( I , S e g ) = ( 2 μ 1 μ S e g + c a ) ( 2 σ 1 , S e g + c b ) ( μ I 2 + μ S e g 2 + c a ) ( σ I 1 + σ S e g 2 + c b ) ,
where the mean value of segmented image ( S e g ) and the original image I are μ S e g and μ I , respectively. The standard deviation values of segmented image ( S e g ) and the original image I are σ S e g and σ I , respectively. c a and c b are two constant numbers, and the covariance of I and S e g is σ I , S e g .

5.3.4. Wilcoxon Rank-Sum Test

The Wilcoxon rank-sum test is a non-parametric test that determines if two independent samples come from the same population distribution [63]; it is also utilized to compare the results obtained by algorithms. The test is constructed with two hypotheses in mind: the null hypothesis and the alternative hypothesis. According to the values of ( P ) and ( H ) , the value of the null hypothesis is true when (p > 0.05) or ( H = 0 ) , but the value of the alternative hypothesis is true when (p < 0.05) or ( H = 1 ) .

5.3.5. Friedman Mean Rank Test

The Friedman test is also a non-parametric statistical test utilized to find differences in treatments across three or more matched groups and evaluate the performance of the competitive algorithms. This statistical test is utilized for one-way repeated measures analysis of variance by the value of ranks and was generated by Milton Friedman [64]. The values of the mean ranked are computed by Friedman’s statistics [64]. Friedman’s statistics compare the critical values obtained from competitors’ algorithms to see whether the null hypothesis is rejected or not.

5.4. Results Analysis of the Proposed Algorithm Based on Fuzzy Entropy

This subsection discusses and analyzes the outcomes of the proposed algorithm mSAR using different numbers of thresholds [ n T h = 2 , 5 , 7 , 10 ]. The fuzzy entropy method is used in this section as an objective function to obtain optimal thresholds.
Figure A1 in Appendix A illustrates the resulting images of the mSAR algorithm with various numbers of thresholds for all the test images utilized in the experiments. Figure 8 illustrates the resulting images of the mSAR with a different number of thresholds over test image 2 and presents a graphical analysis of the thresholds of the segmented images. The optimal thresholding values obtained by the mSAR algorithm and the original SAR algorithm using the fuzzy entropy method are shown in Table A1 in Appendix A. The mean and STD outcomes of the fitness, PSNR, SSIM, and FSIM are illustrated in Table 4, Table 5, Table 6 and Table 7, respectively. When the mean value of an algorithm is high, the algorithm is efficient and accurate. Hwoever, when the value of the STD of an algorithm is low, the algorithm is more stable.
Table 4 displays the mean and STD of the fitness outcomes for the test images using fuzzy entropy as an objective function. According to these outcomes, the proposed mSAR algorithm is in the first position with 22 higher fitness values in 32 experiments, followed by the original SAR in the second position with six experiments, while the SCA and EO obtained the optimal fitness values in four experiments, and HHO comes in the fourth position with two experiments. GSA is in the fifth position with only one experiment, and the remaining algorithms, LFD and AOA, obtained zero higher fitness values. The values of STD computed for the 32 independent outcomes for all benchmark images with a different number of thresholds are shown in Table 4, and the algorithm is more stable when the value of STD is lower.
The mean and STD of the PSNR outcomes for all test images are illustrated in Table 5. The mSAR algorithm comes in the first position in terms of the mean values of PSNR with 20 experiments, while SCA is in the second position with six experiments. The original SAR and AOA come in the third position in only four experiments, followed by HHO in the fourth position in three experiments. Finally, the worst result was obtained by EO, which obtained only one experiment, while GSA and LFD could not obtain the optimal PSNR value in any of the experiments. According to STD, the proposed mSAR comes in the first position, followed by the GSA in the second position, while SCA and HHO come in the third position, the LFD is in the fourth position, and the original SAR comes in the fifth position. Finally, AOA and EO are ranked sixth.
Table 6 displays the mean and STD outcomes of SSIM for all test images, the optimal outcomes obtained are displayed in bold. It can be noticed that the mSAR displayed superiority in MTH after obtaining optimal SSIM values for 20 cases from 32 experiments. The original SAR comes in the second position with seven experiments, while SCA comes in the third position with five experiments, followed by HHO and EO in the fourth position with three experiments, and AOA in the fifth position with two experiments. Finally, without any experiments, GSA and LFD are in the last position. In terms of the value of STD, the original SAR is the best algorithm because its value is lower in the majority of experiments. The SCA is in the second position, followed by HHO and mSAR, while the AOA comes in the fourth position with the lower value of the STD. The LFD is in the fifth position, followed by the GSA. Finally, the EO comes in last with the least stable algorithm. Where n is the total number of pixels in image, μ is the mean of pixels, and σ j is the value of jth in the image.
In Table 7, the outcomes of the mean and STD values of FSIM obtained by the proposed mSAR and other competing algorithms are presented, and the optimal results are highlighted in bold. mSAR obtains the highest FSIM values and comes in the first position with 21 experiments, while SCA comes in second with six experiments, followed by the original SAR in the third position with five experiments. However, the HHO comes in the fourth position with four experiments, followed by the EO, which comes in the fifth position with only two experiments. Finally, LFD, GSA, and AOA cannot obtain the optimal FSIM value in any experiments. The mSAR algorithm is the best stable algorithm because its STD value is lower in most experiments, while the SAR comes in second, followed by the SCA algorithm. Then, GSA and HHO come in the fourth position, and LFD comes in the fifth position. Finally, the two most unstable algorithms are EO and AOA due to their high STD values in most experiments.
Finally, Table A2 in Appendix A illustrates the Wilcoxon rank-sum test for fitness using the fuzzy entropy method as an objective function. It is observed that there is a difference between the proposed mSAR algorithm and other competing algorithms during the execution of the Wilcoxon rank-sum test between mSAR and the following algorithms: LFD, HHO, SCA, EO, GSA, AOA, and SAR. This difference indicates that the proposed mSAR algorithm has undergone significant development. However, when compared to the EO, AOA, and SAR, it is clear that they have comparable behavior, as seen in the tables when ( p > 0.05 ) or NaN values occur.

5.5. Results Analysis of the Proposed Algorithm Based on the Otsu Method

This section discusses and analyzes the outcomes of the proposed mSAR algorithm using different numbers of thresholds [nT h = 2, 5, 7, 10]. The Otsu method is utilized in this subsection as an objective function for obtaining the best thresholds. The resulting images of the mSAR algorithm and other completed algorithms with various numbers of thresholds for all the test images used in the experiments are shown in Figure A2 in Appendix A. Figure 9 illustrates the resulting images of the mSAR with a different number of thresholds over test image 2, and shows a graphical analysis of the thresholds of the segmented images. Table A3 of Appendix A illustrates the optimal thresholding values obtained by the mSAR algorithm and the original SAR algorithm using the Otsu method. Table 8, Table 9, Table 10 and Table 11 illustrate the mean and STD outcomes of the fitness, PSNR, SSIM, and FSIM, respectively.
The mean and STD of fitness outcomes obtained by the mSAR algorithm and other completed algorithms for all test images are shown in Table 8. The proposed mSAR algorithm comes in the first position with 22 higher fitness values in 32 experiments, followed by the original SAR in the second position with seven experiments, and HHO in the third position with four experiments. However, GSA comes in at the fourth position with three experiments, and SCA obtains the fifth position with only two experiments. The remaining algorithms, LFD, EO, and AOA, finish last with no experiments. The values of STD computed for each of the benchmark images with a different number of thresholds are shown in Table 8, and the algorithm is less stable when the value of STD is higher. According to the values of the STD, HHO comes in the first position, while the mSAR and SAR come in the second position, followed by LFD. AOA comes in the fourth position, and the GSA takes the fifth position. The final algorithms, SCA and EO, come in the last position.
Table 9 illustrates the Mean and STD of the PSNR outcomes for all test images, the optimal outcomes obtained are highlighted in bold. It is noticed that the mSAR displayed superiority in MTH after obtaining optimal PSNR values for 17 cases from 32 experiments. The original SAR obtains the second position with nine experiments, while HHO comes in the third position with seven experiments, followed by SCA in the fourth position with six experiments. However, the AOA and EO rank fifth with only one experiment, while the GSA and LFD come in last with no experiments. According to the values of STD, LFD is in the first position, followed by GSA. However, the original SAR comes in third place, while mSAR comes in fourth position. AOA comes in the fifth position, while the SCA and HHO come in the sixth position. In the end, the EO comes in the last position with the highest value of STD and a less stable algorithm.
In Table 10, the outcomes of the mean and STD values of SSIM obtained by the proposed mSAR and other completed algorithms are presented, and the optimal results are noted in bold. The outcomes indicate that mSAR is in the first position for twenty-one cases from thirty-two experiments in terms of the SSIM. The HHO is in the second position with eleven experiments, while the original SAR comes in the third position with four experiments. However, the EO obtains the fourth position with three experiments, followed by the LFD in the fifth position with only two experiments. Finally, the remaining algorithms, SCA, GSA, and AOA, come in the last position, without any experiments. The original SAR and mSAR algorithms are the best stable algorithms because their STD values are lower in most experiments, while GSA comes in the second position followed by AOA. However, SCA and HHO obtain the fourth position, and LFD comes in the fifth position. Finally, due to its high STD values in the majority of experiments, EO is the most unstable algorithm.
The mean and STD of the FSIM outcomes for all test images are displayed in Table 11, and the optimal outcomes are highlighted in bold. According to the outcomes of the FSIM, the EO comes in the first position with fifteen cases from thirty-two experiments, followed by mSAR in the second position with thirteen higher cases. HHO comes in the third position with six experiments, while the LFD is in the fourth position with five experiments. However, the original SAR obtained the fifth position with four experiments, and the SCA came in the sixth position with only three experiments. Finally, GSA and AOA come in last, without any experiments. According to the STD values, GSA comes in the first position, followed by the original SAR and mSAR in the second position. However, LFD obtains the third position, and AOA comes in the fourth position. EO comes in the fifth position, while the remaining algorithms, SCA and HHO, come in last, with less stable algorithms.
The outcomes of the Wilcoxon rank-sum test for fitness using the Otsu method as an objective function are shown in Table A4 of Appendix A. During execution of the Wilcoxon rank-sum test between mSAR and the following algorithms (LFD, HHO, SCA, EO, GSA, AOA, and SAR), it was noticed that there was a difference between the proposed mSAR algorithm and the other competing algorithms. This difference indicates that the proposed mSAR algorithm has undergone significant development. However, when compared to the EO and SAR, it is clear that they have comparable behavior, as noticed in tables with ( p > 0.05 ) or NaN values. According to previous results, the results of the mSAR algorithm in the Fuzzy Entropy method are better than the results of the Otsu method, especially in n T h = 7 . Additionally, the quality of segmented color images using the fuzzy entropy method is high, as shown in Figure 8.

5.6. The Pros and Cons of the mSAR Algorithm

This subsection discusses the benefits and downsides of the proposed mSAR algorithm. The main benefits of the proposed mSAR can be summarized as its ease of implementation and understanding. The proposed mSAR algorithm has proven superior in solving color image-segmentation problems when compared to competing algorithms and gives good outcomes in terms of the quality of the segmented images.Furthermore, the mSAR produces a high convergence speed, indicating that the mSAR avoids entrapping in local optima and successfully balances the interchange between exploration and exploitation phases, owing to the fast finding of the threshold values and the high accuracy of the outcomes. The main defect of the mSAR is that the proposed algorithm is simple but computationally expensive. Additionally, the outcomes of STD values are not good enough to compete with the other algorithms.

6. Conclusions and Future Work

This paper presents an improved version of the SAR algorithm utilizing the concept of the OBL technique called mSAR. OBL improves the searchability of the original SAR, enables it to avoid entrapping in local optima, and successfully balances between the exploration and exploitation phases. mSAR is utilized to segment blood cell images and solve the problems of multi-level thresholding for image segmentation. IEEE CEC’2020 benchmark functions are utilized to prove the sturdiness of mSAR, and the proposed mSAR is implemented on a real application and executed as a multi-level image segmentation tool for estimating its performance on a set of color blood images. The proposed algorithm utilized fuzzy entropy and Otsu methods as objective functions to determine the optimal thresholds during the segmentation processes. The outcomes of the experiment proved the superiority of the proposed mSAR algorithm in producing good segmentation performance to segment the blood images and solve the CEC’2020 benchmark functions compared with other optimization algorithms. In future work, the proposed mSAR can be utilized to track the size of blood cells and tackle different problems such as feature selection, parameter identification, and task scheduling.

Author Contributions

Supervision, E.H.H.; Conceptualization, E.H.H., N.A.S. and R.A.; methodology, E.H.H. and G.M.M.; software, E.H.H. and G.M.M.; validation, I.A.I., N.A.S., R.A. and Y.M.W.; formal analysis, E.H.H. and G.M.M.; investigation, E.H.H. and G.M.M.; resources, I.A.I., N.A.S., R.A. and Y.M.W.; data curation, E.H.H., G.M.M., I.A.I. and Y.M.W.; visualization, E.H.H., G.M.M., I.A.I., N.A.S., R.A. and Y.M.W.; writing—original draft preparation, E.H.H., G.M.M., I.A.I., N.A.S., R.A. and Y.M.W.; writing—review and editing, E.H.H., G.M.M., I.A.I., N.A.S., R.A. and Y.M.W.; funding acquisition, N.A.S. All authors discussed the results and approved the final paper. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by Princess Nourah bint Abdulrahman University Researchers Supporting Project number (PNURSP2023R323), Princess Nourah bint Abdulrahman University, Riyadh, Saudi Arabia.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

All data generated or analysed during this study are included in this published article [54].

Acknowledgments

The authors express their gratitude to Princess Nourah bint Abdulrahman University Researchers Supporting Project number (PNURSP2023R323), Princess Nourah bint Abdulrahman University, Riyadh, Saudi Arabia.

Conflicts of Interest

The authors declare that there is no conflict of interest. This article does not contain any studies with human participants or animals performed by any authors.

Appendix A. The Results of Optimal Threshold Values and the Wilcoxon Signed-Rank Test

The results of optimal threshold values and the Wilcoxon signed-rank over the set of test images test obtained by the mSAR algorithm and other competitive algorithms using Fuzzy Entropy and the Otsu method are as follows:
Figure A1. Outcomes after executing mSAR on Fuzzy Entropy’s method over the set of test images.
Figure A1. Outcomes after executing mSAR on Fuzzy Entropy’s method over the set of test images.
Diagnostics 13 01422 g0a1
Table A1. The optimal threshold values are obtained by the Fuzzy Entropy method.
Table A1. The optimal threshold values are obtained by the Fuzzy Entropy method.
mSARSAR
Test Image nTh Red Green Blue Red Green Blue
Test 1268 11599 17570 10070 11498 17673 95
515 43 86 89 13763 69 113 172 19846 84 98 138 15016 39 86 92 14360 66 110 176 20048 81 100 143 149
753 97 113 149 189 196 21076 103 118 134 165 195 21360 107 109 112 139 209 24650 85 120 150 189 200 21070 109 112 130 156 199 23056 110 114 116 125 201 238
1023 68 87 160 171 185 189 200 216 21838 47 56 72 96 122 156 219 222 23049 82 100 183 198 203 221 233 235 24768 77 123 134 135 160 177 184 200 24680 89 96 129 160 159 179 190 197 22087 102 103 110 136 151 216 236 246 253
Test 2293 10740 44100 20592 10841 4299 205
591 136 151 170 19850 51 129 178 23999 154 168 191 21585 130 150 166 20245 63 125 178 23792 140 162 186 211
723 47 74 108 134 168 19634 54 62 70 128 161 17775 85 119 141 157 210 23520 44 68 112 139 155 20132 51 54 64 117 160 16972 78 114 137 164 199 221
1029 63 82 94 95 123 132 201 203 21628 41 70 81 91 98 98 105 194 23050 66 104 107 125 127 149 149 183 24130 63 75 98 99 123 142 200 210 22025 34 66 88 91 100 120 132 178 22646 67 104 107 132 146 166 172 185 232
Test 3218 16677 130100 21020 16576 132102 208
546 55 167 178 19119 42 48 116 16961 69 82 98 20044 56 170 177 19520 38 41 112 17273 79 89 106 209
716 35 74 109 165 178 18983 113 127 160 181 185 19096 130 139 159 215 236 23918 35 76 112 150 177 19082 113 125 156 182 184 19298 136 146 160 211 213 240
1021 39 56 56 68 79 86 95 119 20143 60 63 70 72 99 122 125 234 25364 119 149 170 185 186 188 219 221 25420 35 55 57 65 80 84 102 120 21136 56 61 72 76 100 123 134 221 25062 112 140 166 176 177 190 213 226 239
Test 4223 9869 11235 10523 9670 11131 107
532 36 97 119 18173 163 170 227 243138 174 193 196 20633 36 100 121 17569 162 168 221 244135 180 193 201 209
735 43 81 149 171 217 24140 49 82 125 129 131 17839 53 59 155 159 183 24432 46 78 149 168 214 23635 52 87 123 138 142 16028 46 63 142 155 178 235
1017 23 24 27 28 71 93 122 156 20156 107 107 142 163 203 208 217 219 24161 68 93 115 155 188 196 197 223 24414 20 24 27 30 76 92 122 155 21656 103 116 142 166 209 208 218 220 24165 73 93 111 145 188 193 200 223 240
Test 52149 222130 18644 208149 220133 18746 207
529 33 59 186 24126 26 75 116 18654 128 165 226 24130 36 62 186 23426 36 77 111 16652 122 163 224 239
711 15 63 202 204 232 24036 93 97 98 106 115 16031 31 68 76 89 106 16216 23 63 222 204 221 23138 93 106 111 123 115 16931 38 77 87 90 110 156
1048 49 55 55 79 96 103 122 176 23230 63 110 141 148 152 178 208 232 239100 121 147 149 154 161 209 213 224 24130 39 55 63 79 96 109 136 196 24336 66 111 136 152 165 188 208 230 23489 123 147 145 162 169 211 216 232 246
Test 62156 17276 13642 127156 17375 13642 128
529 48 78 92 18038 73 138 145 22160 78 153 202 23623 38 81 106 17636 71 132 139 21454 74 146 211 232
736 115 128 130 176 203 21137 71 89 151 155 163 18953 85 170 209 225 232 25431 120 136 140 181 201 22139 64 84 146 152 169 19146 76 168 203 219 229 242
1016 35 53 61 64 73 75 196 211 22664 95 125 133 145 192 198 215 218 23832 35 53 81 149 170 171 224 228 24013 38 55 69 74 79 89 203 216 23658 88 118 146 150 192 203 219 222 24031 38 55 78 151 168 176 226 239 245
Test 72123 16092 109108 199122 16192 110107 199
525 96 177 193 23082 97 133 149 22021 82 116 153 20931 102 179 200 23480 103 128 145 21819 78 111 146 203
723 34 34 46 113 142 23168 137 139 146 149 164 25019 28 79 113 118 156 15919 33 35 42 111 138 23066 132 133 144 148 162 24323 35 77 111 121 155 162
1061 63 79 110 115 132 150 162 181 18959 83 91 106 109 113 116 163 189 22512 45 51 83 136 177 189 186 217 22057 62 80 111 116 134 152 160 179 19260 84 90 111 116 119 121 152 184 22111 41 48 78 126 163 179 192 213 224
Test 8289 14253 21186 17788 14151 14287 177
554 142 178 228 24576 108 200 248 25168 86 91 106 13252 138 176 223 23971 99 189 239 24867 83 89 111 128
743 43 64 92 108 141 15342 108 134 172 173 184 24516 29 129 138 143 192 21538 45 66 92 111 141 15542 111 128 172 181 192 23419 36 129 146 155 191 211
1014 34 63 106 137 171 187 203 212 24126 43 111 158 173 196 213 223 233 23939 48 66 94 142 158 161 190 206 20911 33 62 102 133 164 181 212 216 23731 43 105 146 177 196 219 223 240 24928 44 66 100 144 162 169 201 211 235
Table A2. Comparison of the p-value and H-value obtained by the Wilcoxon signed-rank test between the pairs of mSAR vs LFD, mSAR vs HHO, mSAR vs SCA, mSAR vs EO, mSAR vs GSA, and mSAR vs AOA for fitness outcomes using Fuzzy Entropy’s method.
Table A2. Comparison of the p-value and H-value obtained by the Wilcoxon signed-rank test between the pairs of mSAR vs LFD, mSAR vs HHO, mSAR vs SCA, mSAR vs EO, mSAR vs GSA, and mSAR vs AOA for fitness outcomes using Fuzzy Entropy’s method.
LFDHHOSCAEOGSAAOASAR
Test Image nTh P H P H P H P H P H P H P H
Test 126.0277E-1316.1441E-0711.3234E-061NaN03.5515E-0511.8168E-0413.2683E-071
52.8784E-1412.9055E-0101.0896E-101NaN06.6496E-051NaN0NaN0
77.6340E-0107.7059E-1111.1971E-0101.5134E-1416.3305E-010NaN03.6698E-010
106.0867E-1613.4468E-0811.3333E-1611.3664E-1411.5773E-0712.8047E-101NaN0
Test 222.8843E-1413.4468E-0103.4228E-111NaN08.7150E-1011.5045E-031NaN0
53.7658E-071NaN06.0880E-0611.3284E-0108.9271E-1311.7487E-1111.6951E-010
77.1903E-0101.8322E-0616.3259E-0911.6634E-1412.8648E-0108.7888E-0512.1346E-010
102.8784E-1419.6534E-081NaN01.4164E-1416.2125E-1512.0439E-0511.5679E-071
Test 32NaN0NaN01.9354E-111NaN03.7768E-0712.2483E-0711.5843E-041
52.7230E-0102.1070E-1211.9354E-0611.3808E-0102.1030E-0105.5186E-1211.4070E-081
78.3963E-1512.3017E-1015.3941E-0101.1664E-1418.6481E-0719.8562E-1513.3336E-010
103.0718E-1319.7777E-0811.4390E-0911.4315E-1411.1266E-0108.3233E-1413.3336E-010
Test 423.8096E-0819.3557E-0105.9317E-0101.5765E-1416.2876E-010NaN0NaN0
53.7658E-0613.8424E-1211.0573E-0611.3664E-0103.9056E-0814.0878E-071NaN0
74.0161E-1011.7406E-1011.3620E-0101.3646E-1518.1116E-0513.3498E-031NaN0
106.5873E-1619.4370E-0911.3333E-1611.6634E-1511.8348E-1011.6465E-1511.4069E-010
Test 52NaN0NaN0NaN0NaN02.3713E-061NaN0NaN0
58.8756E-0612.5657E-1013.9604E-101NaN02.2425E-1014.4022E-0611.9822E-010
74.5622E-0101.9040E-1012.6701E-1013.1557E-0516.3412E-0101.1344E-0811.8464E-010
102.8784E-0103.8776E-0103.7095E-1311.3019E-1518.7232E-1211.7373E-1511.8024E-061
Test 622.8603E-0101.1192E-0108.8169E-0102.1092E-1411.0730E-1012.3619E-1012.3411E-010
52.7077E-0911.1192E-1418.8169E-1012.1092E-0101.0730E-0712.4459E-0103.2202E-010
76.1778E-1518.0918E-1612.1505E-141NaN04.5494E-0102.3408E-1212.5595E-010
101.7293E-1618.6143E-0812.7239E-181NaN01.1159E-0106.4539E-0102.5546E-010
Test 722.8653E-0813.9472E-0102.8673E-0101.5765E-1416.2876E-0711.7835E-0512.5459E-010
52.7077E-0913.8428E-0611.3512E-0611.0111E-0512.3713E-0319.6307E-0312.8447E-051
71.2173E-1211.5557E-1314.7489E-1511.4366E-1411.1052E-0819.3744E-0813.2304E-061
102.9808E-1312.0897E-0101.5107E-1511.6634E-0109.0344E-0102.7644E-121NaN0
Test 823.9119E-1013.8428E-081NaN0NaN05.7833E-031NaN0NaN0
53.9484E-0513.8428E-051NaN01.4624E-1418.0258E-061NaN0NaN0
72.6925E-0711.8575E-0101.2903E-010NaN06.3841E-0101.0330E-0103.3336E-010
101.7407E-0101.0298E-1314.5518E-1611.4318E-1511.5987E-151NaN0NaN0
Figure A2. Outcomes after executing mSAR on the Otsu method over the set of test images.
Figure A2. Outcomes after executing mSAR on the Otsu method over the set of test images.
Diagnostics 13 01422 g0a2
Table A3. The optimal threshold values are obtained by the Otsu method.
Table A3. The optimal threshold values are obtained by the Otsu method.
mSARSAR
Test Image nTh Red Green Blue Red Green Blue
Test 1270 16779 194101 21572 17088 19271 170
5215 136 153 182 18282 116 137 182 23247 112 128 150 209215 133 150 182 12082 120 141 182 23050 110 131 150 210
771 93 127 174 180 190 21274 85 85 152 180 245 25478 95 117 141 201 217 23273 92 165 174 183 190 21273 85 78 150 180 240 25478 98 110 117 201 217 230
1065 77 132 134 135 162 177 184 198 25575 84 97 129 158 159 179 188 197 21887 102 103 107 135 151 231 238 246 25068 77 123 134 135 160 177 184 200 24680 89 96 129 160 159 179 190 197 22087 102 103 110 136 151 216 236 246 253
Test 2263 15575 115154 16565 14573 118150 162
5127 135 136 143 22675 112 145 172 20720 98 141 197 210130 135 142 151 23076 139 148 182 21046 105 160 200 213
790 126 135 176 180 183 21388 90 120 127 145 162 18370 91 120 127 145 161 18292 121 142 180 186 187 21886 94 117 122 147 167 18673 94 127 130 144 167 188
1031 60 73 82 96 105 136 151 224 23013 28 71 79 89 108 148 185 224 25119 23 23 85 97 129 135 178 190 20733 63 76 83 98 104 133 151 226 23414 28 73 79 88 108 164 185 228 25423 27 23 87 97 129 137 178 196 210
Test 3240 17415 10615 12338 17018 10913 128
528 112 117 145 18973 87 94 126 19143 60 79 80 15329 112 117 140 19572 90 95 130 19443 58 96 103 169
723 48 96 133 213 217 21717 82 86 93 143 175 21313 29 48 68 83 113 11924 49 101 145 177 200 21635 37 46 186 188 196 21619 36 56 123 163 192 230
1033 44 59 60 65 143 147 192 239 24564 67 68 70 86 142 145 162 180 22360 73 98 112 119 132 155 158 176 23935 60 60 78 102 146 196 200 210 24564 69 70 90 99 104 168 189 200 22963 71 76 98 165 173 190 209 230 243
Test 4239 17639 14249 15543 17740 14453 156
528 116 120 145 189101 114 121 156 22344 61 77 82 15425 120 149 163 203100 123 136 160 24138 56 68 93 159
762 73 104 117 119 135 19840 49 130 142 145 186 25060 85 88 100 173 179 23463 109 132 140 189 206 23343 53 120 156 190 206 23068 77 89 106 163 176 204
1010 16 48 73 78 138 147 150 239 24546 60 67 73 119 176 179 219 169 21558 73 98 112 119 132 155 158 223 25813 19 49 76 79 145 149 180 201 24642 56 86 146 159 169 180 210 233 24360 73 90 101 120 136 163 180 206 239
Test 5240 10936 8680 14846 11037 8478 148
524 68 73 160 17933 39 159 161 18363 111 128 149 22026 71 83 86 18330 40 160 168 19468 100 130 145 218
729 41 68 89 98 108 14346 58 103 106 169 209 24689 99 100 113 126 240 25432 41 76 85 93 110 14440 55 102 100 163 210 24190 103 110 123 180 235 239
1053 66 69 76 87 126 196 210 214 22329 55 63 79 106 173 179 196 199 22693 106 116 117 120 148 153 163 242 24255 66 70 80 91 112 196 215 220 22334 58 63 75 110 173 177 196 200 22992 110 116 120 123 156 163 166 249 250
Test 6239 17641 14248 15541 17943 15649 159
532 112 120 148 187103 115 123 158 22343 59 79 82 15334 113 123 186 193108 132 142 169 23045 63 82 86 160
783 105 129 143 170 181 238103 115 129 198 203 230 23323 80 110 116 136 190 23086 100 124 140 163 178 235102 113 132 200 206 241 24525 79 112 119 143 201 248
1015 66 69 76 87 126 196 210 214 22335 73 83 96 129 148 160 200 241 24215 46 64 69 158 167 189 189 211 23218 62 71 80 91 130 200 214 216 22037 70 79 87 123 152 172 206 230 25418 53 57 79 146 163 182 184 210 229
Test 7270 94109 12688 14073 96112 13287 143
549 76 165 205 20581 86 128 162 21024 69 133 139 22042 80 168 201 20684 93 134 160 21525 70 130 142 217
765 92 129 138 149 163 21630 86 104 130 131 132 20516 86 104 120 139 145 19862 89 124 135 152 164 21029 84 102 129 138 136 20918 89 100 118 141 149 201
1056 58 76 126 135 162 183 186 221 23834 46 76 79 130 149 172 189 236 25254 62 64 64 141 142 158 198 228 25358 60 81 130 137 164 189 189 222 24030 41 71 80 129 151 170 184 232 24855 64 69 88 146 152 162 203 230 249
Test 8263 20332 13143 14968 20534 13046 142
531 116 121 143 18973 86 93 134 19645 62 81 83 15528 113 136 145 19376 92 99 124 20152 65 95 90 193
783 95 125 143 139 152 215107 120 136 198 204 234 24049 57 83 109 136 198 23081 94 119 148 169 170 229104 116 120 190 208 228 24353 63 89 117 140 212 229
1029 68 95 99 117 128 148 176 221 23849 68 104 112 119 129 158 163 236 25238 47 49 56 94 99 112 149 228 25331 65 93 106 120 139 143 172 220 24956 87 100 111 139 142 179 184 210 23832 54 55 68 103 123 130 168 180 241
Table A4. Comparison of the p-value and H-value obtained by the Wilcoxon signed-rank test between the pairs of mSAR vs LFD, mSAR vs HHO, mSAR vs SCA, mSAR vs EO, mSAR vs GSA, and mSAR vs AOA for fitness outcomes using the Otsu method.
Table A4. Comparison of the p-value and H-value obtained by the Wilcoxon signed-rank test between the pairs of mSAR vs LFD, mSAR vs HHO, mSAR vs SCA, mSAR vs EO, mSAR vs GSA, and mSAR vs AOA for fitness outcomes using the Otsu method.
LFDHHOSCAEOGSAAOASAR
Test Image nTh P H P H P H P H P H P H P H
Test 125.4624E-1015.5908E-0101.2044E-010NaN03.4391E-0311.6672E-0102.9745E-010
52.6084E-1112.6439E-0109.9165E-0611.5636E-1316.4391E-0102.2570E-0613.0340E-071
76.9180E-1017.0120E-0611.0895E-0811.5306E-1316.1301E-0207.6170E-0313.3399E-010
105.5159E-1313.1364E-0101.2135E-1111.5346E-1311.5273E-0512.5737E-091NaN0
Test 222.6137E-1113.1364E-0103.1152E-0611.5300E-0108.4391E-0101.3807E-0101.5125E-010
53.4126E-0101.5526E-0315.5409E-010NaN08.6445E-1111.6047E-1011.5427E-010
76.5159E-061NaN05.7574E-041NaN02.7741E-1018.0651E-041NaN0
102.6084E-1118.7841E-0313.0826E-1211.5346E-1316.0158E-1311.8756E-0411.4270E-010
Test 328.2306E-0105.4887E-0101.7615E-0611.4586E-0103.6573E-0512.0632E-0511.4419E-010
5NaN01.9173E-0711.7615E-010NaN02.0364E-0615.0641E-101NaN0
77.6088E-1212.0944E-0514.9093E-010NaN08.3743E-0209.0446E-131NaN0
102.7837E-1018.8971E-0101.3097E-0411.5606E-1311.0910E-0617.6379E-121NaN0
Test 423.4523E-0108.5131E-0105.3986E-0101.4790E-1316.0885E-0103.8450E-0711.5925E-010
53.4126E-0103.4964E-0519.6229E-0201.8626E-1313.7820E-0613.7512E-0511.6804E-010
73.6394E-0711.5838E-0511.2396E-0411.5631E-1317.8548E-0313.0739E-0101.8804E-010
105.9695E-1318.5872E-0411.2135E-1111.5606E-1311.7767E-0811.5109E-1311.2804E-010
Test 527.0424E-0108.7424E-0103.6045E-0101.5300E+0002.2962E-0107.0856E-0101.6475E-010
58.0431E-0102.3346E-0513.6045E-051NaN02.1715E-0813.7825E-010NaN0
74.1343E-0711.7325E-0512.4302E-051NaN06.1405E-0201.0410E-0611.6804E-010
102.6084E-1113.5284E-0613.3762E-0811.5316E-1318.4471E-1011.5943E-1311.6404E-010
Test 622.5921E-0101.0184E-0918.0245E-0511.9788E-1211.0390E-0512.1674E-0812.1307E-010
52.4538E-0611.0184E-0918.0245E-0511.9788E-1211.0390E-0512.1674E-0812.9307E-010
75.5983E-1217.3631E-1111.9572E-0911.5306E-1314.4054E-0102.1882E-1112.3294E-010
101.5671E-1317.8385E-0102.4791E-1311.3645E-1311.0806E-061NaN02.3249E-010
Test 72NaN0NaN02.6096E-010NaN0NaN01.6672E-010NaN0
52.4538E-0613.4967E-0101.2298E-0109.4860E-0202.2962E-0109.0029E-0202.4494E-010
71.1032E-0911.4156E-0814.3222E-1011.5366E-1311.0702E-0618.7632E-071NaN0
102.7012E-1011.9015E-0511.3749E-1011.5066E-1318.7484E-1112.5842E-111NaN0
Test 823.5450E-0103.4967E-0109.4924E-020NaN05.6002E-0107.7421E-010NaN0
53.5781E-0103.4967E-0105.7411E-0511.5346E-1317.7717E-0205.6581E-0414.6219E-051
7NaN01.6902E-0101.1743E-010NaN06.1821E-061NaN03.0340E-061
10NaN09.3703E-0914.1427E-111NaN01.5481E-1317.6170E-1213.9900E-010

References

  1. Merzban, M.H.; Elbayoumi, M. Efficient solution of Otsu multilevel image thresholding: A comparative study. Expert Syst. Appl. 2019, 116, 299–309. [Google Scholar] [CrossRef]
  2. Bhandari, A.K.; Singh, V.K.; Kumar, A.; Singh, G.K. Cuckoo search algorithm and wind driven optimization based study of satellite image segmentation for multilevel thresholding using Kapur’s entropy. Expert Syst. Appl. 2014, 41, 3538–3560. [Google Scholar] [CrossRef]
  3. Sanei, S.H.R.; Fertig III, R.S. Uncorrelated volume element for stochastic modeling of microstructures based on local fiber volume fraction variation. Compos. Sci. Technol. 2015, 117, 191–198. [Google Scholar] [CrossRef]
  4. Sarkar, S.; Sen, N.; Kundu, A.; Das, S.; Chaudhuri, S.S. A differential evolutionary multilevel segmentation of near infra-red images using Renyi’s entropy. In Proceedings of the International Conference on Frontiers of Intelligent Computing: Theory and Applications (FICTA), Odisha, India, 22–23 December 2013; Springer: Berlin/Heidelberg, Germany, 2013; pp. 699–706. [Google Scholar]
  5. Houssein, E.H.; Helmy, B.E.d.; Oliva, D.; Jangir, P.; Premkumar, M.; Elngar, A.A.; Shaban, H. An efficient multi-thresholding based COVID-19 CT images segmentation approach using an improved equilibrium optimizer. Biomed. Signal Process. Control 2022, 73, 103401. [Google Scholar] [CrossRef]
  6. Abd El Aziz, M.; Ewees, A.A.; Hassanien, A.E. Whale optimization algorithm and moth-flame optimization for multilevel thresholding image segmentation. Expert Syst. Appl. 2017, 83, 242–256. [Google Scholar] [CrossRef]
  7. Houssein, E.H.; Sayed, A. Dynamic Candidate Solution Boosted Beluga Whale Optimization Algorithm for Biomedical Classification. Mathematics 2023, 11, 707. [Google Scholar] [CrossRef]
  8. Houssein, E.H.; Saad, M.R.; Hashim, F.A.; Shaban, H.; Hassaballah, M. Lévy flight distribution: A new metaheuristic algorithm for solving engineering optimization problems. Eng. Appl. Artif. Intell. 2020, 94, 103731. [Google Scholar] [CrossRef]
  9. Houssein, E.H.; Mahdy, M.A.; Eldin, M.G.; Shebl, D.; Mohamed, W.M.; Abdel-Aty, M. Optimizing quantum cloning circuit parameters based on adaptive guided differential evolution algorithm. J. Adv. Res. 2021, 29, 147–157. [Google Scholar] [CrossRef]
  10. Houssein, E.H.; Emam, M.M.; Ali, A.A.; Suganthan, P.N. Deep and machine learning techniques for medical imaging-based breast cancer: A comprehensive review. Expert Syst. Appl. 2021, 167, 114161. [Google Scholar] [CrossRef]
  11. Houssein, E.H.; Hosney, M.E.; Oliva, D.; Mohamed, W.M.; Hassaballah, M. A novel hybrid Harris hawks optimization and support vector machines for drug design and discovery. Comput. Chem. Eng. 2020, 133, 106656. [Google Scholar] [CrossRef]
  12. Houssein, E.H.; Saad, M.R.; Hussain, K.; Zhu, W.; Shaban, H.; Hassaballah, M. Optimal sink node placement in large scale wireless sensor networks based on Harris’ hawk optimization algorithm. IEEE Access 2020, 8, 19381–19397. [Google Scholar] [CrossRef]
  13. Abualigah, L.; Al-Okbi, N.K.; Elaziz, M.A.; Houssein, E.H. Boosting Marine Predators Algorithm by Salp Swarm Algorithm for Multilevel Thresholding Image Segmentation. Multimed. Tools Appl. 2022, 81, 16707–16742. [Google Scholar] [CrossRef] [PubMed]
  14. Neggaz, N.; Houssein, E.H.; Hussain, K. An efficient henry gas solubility optimization for feature selection. Expert Syst. Appl. 2020, 152, 113364. [Google Scholar] [CrossRef]
  15. Hashim, F.A.; Houssein, E.H.; Mabrouk, M.S.; Al-Atabany, W.; Mirjalili, S. Henry gas solubility optimization: A novel physics-based algorithm. Future Gener. Comput. Syst. 2019, 101, 646–667. [Google Scholar] [CrossRef]
  16. Hashim, F.A.; Hussain, K.; Houssein, E.H.; Mabrouk, M.S.; Al-Atabany, W. Archimedes optimization algorithm: A new metaheuristic algorithm for solving optimization problems. Appl. Intell. 2020, 51, 1531–1551. [Google Scholar] [CrossRef]
  17. Eberhart, R.C.; Shi, Y. Comparison between genetic algorithms and particle swarm optimization. In Proceedings of the International Conference on Evolutionary Programming, San Diego, CA, USA, 25–27 March 1998; Springer: Berlin/Heidelberg, Germany, 1998; pp. 611–616. [Google Scholar]
  18. Eberhart, R.; Kennedy, J. A new optimizer using particle swarm theory. In Proceedings of the MHS’95 Sixth International Symposium on Micro Machine and Human Science, Nagoya, Japan, 4–6 October 1995; IEEE: Piscataway, NJ, USA, 1995; pp. 39–43. [Google Scholar]
  19. Deb, K. Multi-objective optimisation using evolutionary algorithms: An introduction. In Multi-Objective Evolutionary Optimisation for Product Design and Manufacturing; Springer: Berlin/Heidelberg, Germany, 2011; pp. 3–34. [Google Scholar]
  20. Holland, J.H. Genetic algorithms. Sci. Am. 1992, 267, 66–73. [Google Scholar] [CrossRef]
  21. Storn, R.; Price, K. Differential evolution–a simple and efficient heuristic for global optimization over continuous spaces. J. Glob. Optim. 1997, 11, 341–359. [Google Scholar] [CrossRef]
  22. Heidari, A.A.; Mirjalili, S.; Faris, H.; Aljarah, I.; Mafarja, M.; Chen, H. Harris hawks optimization: Algorithm and applications. Future Gener. Comput. Syst. 2019, 97, 849–872. [Google Scholar] [CrossRef]
  23. Lv, W.; He, C.; Li, D.; Cheng, S.; Luo, S.; Zhang, X. Election campaign optimization algorithm. Procedia Comput. Sci. 2010, 1, 1377–1386. [Google Scholar] [CrossRef] [Green Version]
  24. Rao, R.V.; Savsani, V.J.; Vakharia, D. Teaching–learning-based optimization: A novel method for constrained mechanical design optimization problems. Comput. Aided Des. 2011, 43, 303–315. [Google Scholar] [CrossRef]
  25. Birbil, Ş.İ.; Fang, S.C. An electromagnetism-like mechanism for global optimization. J. Glob. Optim. 2003, 25, 263–282. [Google Scholar] [CrossRef]
  26. Rashedi, E.; Nezamabadi-Pour, H.; Saryazdi, S. GSA: A gravitational search algorithm. Inf. Sci. 2009, 179, 2232–2248. [Google Scholar] [CrossRef]
  27. Houssein, E.H.; El-dinHelmy, B.; Oliva, D.; Elngar, A.A.; Shabana, H. A novel Black Widow Optimization algorithm for multilevel thresholding image segmentation. Expert Syst. Appl. 2021, 167, 114159. [Google Scholar] [CrossRef]
  28. Dhal, K.G.; Das, A.; Ray, S.; Gálvez, J.; Das, S. Nature-inspired optimization algorithms and their application in multi-thresholding image segmentation. Arch. Comput. Methods Eng. 2020, 27, 855–888. [Google Scholar]
  29. Zhou, Y.; Yang, X.; Ling, Y.; Zhang, J. Meta-heuristic moth swarm algorithm for multilevel thresholding image segmentation. Multimed. Tools Appl. 2018, 77, 23699–23727. [Google Scholar] [CrossRef]
  30. Zhao, D.; Liu, L.; Yu, F.; Heidari, A.A.; Wang, M.; Oliva, D.; Muhammad, K.; Chen, H. Ant colony optimization with horizontal and vertical crossover search: Fundamental visions for multi-threshold image segmentation. Expert Syst. Appl. 2021, 167, 114122. [Google Scholar]
  31. He, L.; Huang, S. Modified firefly algorithm based multilevel thresholding for color image segmentation. Neurocomputing 2017, 240, 152–174. [Google Scholar] [CrossRef]
  32. Houssein, E.H.; Emam, M.M.; Ali, A.A. Improved manta ray foraging optimization for multi-level thresholding using COVID-19 CT images. Neural Comput. Appl. 2021, 33, 16899–16919. [Google Scholar] [CrossRef]
  33. Houssein, E.H.; Emam, M.M.; Ali, A.A. An optimized deep learning architecture for breast cancer diagnosis based on improved marine predators algorithm. Neural Comput. Appl. 2022, 34, 18015–18033. [Google Scholar] [CrossRef]
  34. Houssein, E.H.; Emam, M.M.; Ali, A.A. An efficient multilevel thresholding segmentation method for thermography breast cancer imaging based on improved chimp optimization algorithm. Expert Syst. Appl. 2021, 185, 115651. [Google Scholar] [CrossRef]
  35. Abd Elaziz, M.; Ewees, A.A.; Oliva, D. Hyper-heuristic method for multilevel thresholding image segmentation. Expert Syst. Appl. 2020, 146, 113201. [Google Scholar] [CrossRef]
  36. He, L.; Huang, S. An efficient krill herd algorithm for color image multilevel thresholding segmentation problem. Appl. Soft Comput. 2020, 89, 106063. [Google Scholar] [CrossRef]
  37. Bao, X.; Jia, H.; Lang, C. A novel hybrid harris hawks optimization for color image multilevel thresholding segmentation. IEEE Access 2019, 7, 76529–76546. [Google Scholar] [CrossRef]
  38. Shabani, A.; Asgarian, B.; Salido, M.; Gharebaghi, S.A. Search and rescue optimization algorithm: A new optimization method for solving constrained engineering optimization problems. Expert Syst. Appl. 2020, 161, 113698. [Google Scholar] [CrossRef]
  39. Rojas-Morales, N.; Rojas, M.C.R.; Ureta, E.M. A survey and classification of opposition-based metaheuristics. Comput. Ind. Eng. 2017, 110, 424–435. [Google Scholar] [CrossRef]
  40. Tizhoosh, H.R. Opposition-based learning: A new scheme for machine intelligence. In Proceedings of the International Conference on Computational Intelligence for Modelling, Control and Automation and International Conference on Intelligent Agents, Web Technologies and Internet Commerce (CIMCA-IAWTIC’06), Vienna, Austria, 28–30 November 2005; IEEE: Piscataway, NJ, USA, 2005; Volume 1, pp. 695–701. [Google Scholar]
  41. Chakraborty, F.; Roy, P.K.; Nandi, D. Oppositional elephant herding optimization with dynamic Cauchy mutation for multilevel image thresholding. Evol. Intell. 2019, 12, 445–467. [Google Scholar] [CrossRef]
  42. Houssein, E.H.; Hussain, K.; Abualigah, L.; Abd Elaziz, M.; Alomoush, W.; Dhiman, G.; Djenouri, Y.; Cuevas, E. An improved opposition-based marine predators algorithm for global optimization and multilevel thresholding image segmentation. Knowl. Based Syst. 2021, 229, 107348. [Google Scholar] [CrossRef]
  43. Gupta, S.; Deep, K.; Heidari, A.A.; Moayedi, H.; Wang, M. Opposition-based Learning Harris Hawks Optimization with Advanced Transition Rules: Principles and Analysis. Expert Syst. Appl. 2020, 158, 113510. [Google Scholar] [CrossRef]
  44. Gupta, S.; Deep, K. A hybrid self-adaptive sine cosine algorithm with opposition based learning. Expert Syst. Appl. 2019, 119, 210–230. [Google Scholar] [CrossRef]
  45. Ewees, A.A.; Abd Elaziz, M.; Oliva, D. A new multi-objective optimization algorithm combined with opposition-based learning. Expert Syst. Appl. 2021, 165, 113844. [Google Scholar] [CrossRef]
  46. Ewees, A.A.; Elaziz, M.A.; Houssein, E.H. Improved grasshopper optimization algorithm using opposition-based learning. Expert Syst. Appl. 2018, 112, 156–172. [Google Scholar] [CrossRef]
  47. Fan, Q.; Huang, H.; Yang, K.; Zhang, S.; Yao, L.; Xiong, Q. A modified equilibrium optimizer using opposition-based learning and novel update rules. Expert Syst. Appl. 2021, 170, 114575. [Google Scholar] [CrossRef]
  48. Sharma, T.K.; Pant, M. Opposition based learning ingrained shuffled frog-leaping algorithm. J. Comput. Sci. 2017, 21, 307–315. [Google Scholar] [CrossRef]
  49. Remli, M.A.; Deris, S.; Mohamad, M.S.; Omatu, S.; Corchado, J.M. An enhanced scatter search with combined opposition-based learning for parameter estimation in large-scale kinetic models of biochemical systems. Eng. Appl. Artif. Intell. 2017, 62, 164–180. [Google Scholar] [CrossRef] [Green Version]
  50. Naidu, M.; Kumar, P.R.; Chiranjeevi, K. Shannon and fuzzy entropy based evolutionary image thresholding for image segmentation. Alex. Eng. J. 2018, 57, 1643–1655. [Google Scholar] [CrossRef]
  51. Otsu, N. A threshold selection method from gray-level histograms. IEEE Trans. Syst. Man Cybern. 1979, 9, 62–66. [Google Scholar] [CrossRef] [Green Version]
  52. De Luca, A.; Termini, S. A definition of a nonprobabilistic entropy in the setting of fuzzy sets theory. Inf. Control 1972, 20, 301–312. [Google Scholar] [CrossRef] [Green Version]
  53. 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 Proceedings of the 2020 IEEE Congress on Evolutionary Computation (CEC), Glasgow, UK, 19–24 July 2020; IEEE: Piscataway, NJ, USA, 2020; pp. 1–8. [Google Scholar]
  54. Delgado-Ortet, M.; Molina, A.; Alférez, S.; Rodellar, J.; Merino, A. A deep learning approach for segmentation of red blood cell images and malaria detection. Entropy 2020, 22, 657. [Google Scholar] [CrossRef]
  55. Mirjalili, S. SCA: A sine cosine algorithm for solving optimization problems. Knowl. Based Syst. 2016, 96, 120–133. [Google Scholar] [CrossRef]
  56. Faramarzi, A.; Heidarinejad, M.; Stephens, B.; Mirjalili, S. Equilibrium optimizer: A novel optimization algorithm. Knowl. Based Syst. 2020, 191, 105190. [Google Scholar] [CrossRef]
  57. Abualigah, L.; Diabat, A.; Mirjalili, S.; Abd Elaziz, M.; Gandomi, A.H. The arithmetic optimization algorithm. Comput. Methods Appl. Mech. Eng. 2021, 376, 113609. [Google Scholar] [CrossRef]
  58. Oliva, D.; Cuevas, E.; Pajares, G.; Zaldivar, D.; Osuna, V. A multilevel thresholding algorithm using electromagnetism optimization. Neurocomputing 2014, 139, 357–381. [Google Scholar] [CrossRef] [Green Version]
  59. Huynh-Thu, Q.; Ghanbari, M. Scope of validity of PSNR in image/video quality assessment. Electron. Lett. 2008, 44, 800–801. [Google Scholar] [CrossRef]
  60. Yin, P.Y. Multilevel minimum cross entropy threshold selection based on particle swarm optimization. Appl. Math. Comput. 2007, 184, 503–513. [Google Scholar] [CrossRef]
  61. Wang, Z.; Bovik, A.C.; Sheikh, H.R.; Simoncelli, E.P. Image quality assessment: From error visibility to structural similarity. IEEE Trans. Image Process. 2004, 13, 600–612. [Google Scholar] [CrossRef] [Green Version]
  62. Arbelaez, P.; Maire, M.; Fowlkes, C.; Malik, J. Contour detection and hierarchical image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 2010, 33, 898–916. [Google Scholar] [CrossRef] [Green Version]
  63. Wilcoxon, F. Individual comparisons by ranking methods. In Breakthroughs in Statistics; Springer: Berlin/Heidelberg, Germany, 1992; pp. 196–202. [Google Scholar]
  64. Friedman, M. A comparison of alternative tests of significance for the problem of m rankings. Ann. Math. Stat. 1940, 11, 86–92. [Google Scholar] [CrossRef]
Figure 1. Membership function graph.
Figure 1. Membership function graph.
Diagnostics 13 01422 g001
Figure 2. The flowchart of mSAR algorithm.
Figure 2. The flowchart of mSAR algorithm.
Diagnostics 13 01422 g002
Figure 3. CEC’2020 benchmark functions in two-dimensional view.
Figure 3. CEC’2020 benchmark functions in two-dimensional view.
Diagnostics 13 01422 g003
Figure 4. The outcomes of the boxplot of the proposed mSAR algorithm with other competitive algorithms over CEC’2020 functions with D = 20 .
Figure 4. The outcomes of the boxplot of the proposed mSAR algorithm with other competitive algorithms over CEC’2020 functions with D = 20 .
Diagnostics 13 01422 g004
Figure 5. The convergence curves of the proposed mSAR algorithm with other competitive algorithms over CEC’2020 functions with D = 20 .
Figure 5. The convergence curves of the proposed mSAR algorithm with other competitive algorithms over CEC’2020 functions with D = 20 .
Diagnostics 13 01422 g005
Figure 6. Qualitative metrics on F2, F5, F6, and F8: functions in 2D view, search history, average fitness history, and convergence curve.
Figure 6. Qualitative metrics on F2, F5, F6, and F8: functions in 2D view, search history, average fitness history, and convergence curve.
Diagnostics 13 01422 g006
Figure 7. Set of test images and relative histograms.
Figure 7. Set of test images and relative histograms.
Diagnostics 13 01422 g007
Figure 8. Threshold outcomes of each layer of a color image using the mSAR algorithm with the fuzzy entropy method.
Figure 8. Threshold outcomes of each layer of a color image using the mSAR algorithm with the fuzzy entropy method.
Diagnostics 13 01422 g008
Figure 9. Threshold outcomes after executing mSAR on the Otsu method over the set of test images.
Figure 9. Threshold outcomes after executing mSAR on the Otsu method over the set of test images.
Diagnostics 13 01422 g009
Table 1. CEC’2020 benchmark functions.
Table 1. CEC’2020 benchmark functions.
No.Function DescriptionFi*
Unimodal function
F1Shifted and Rotated Bent Cigar Function100
Multimodal shifted and rotated functions
F2Shifted and Rotated Schwefel’s Function1100
F3Shifted and Rotated Lunacek bi-Rastrigin Function700
F4Expanded Rosenbrock’s plus Griewangk’s Function1900
Hybrid functions
F5Hybrid Function 1 (N = 3)1700
F6Hybrid Function 2 (N = 4)1600
F7Hybrid Function 3 (N = 5)2100
Composition functions
F8Composition Function 1 (N = 3)2200
F9Composition Function 2 (N = 4)2400
F10Composition Function 3 (N = 5)2500
Table 2. STD and mean of the optimum value obtained from the proposed mSAR algorithm against other competing algorithms on the CEC’2020 benchmark functions with D = 20 .
Table 2. STD and mean of the optimum value obtained from the proposed mSAR algorithm against other competing algorithms on the CEC’2020 benchmark functions with D = 20 .
FunctionsLFDHHOSCAEOGSAAOASARmSAR
MeanStdMeanStdMeanStdMeanStdMeanStdMeanStdMeanStdMeanStd
F12.583E+103.262E+064.733E+061.350E+058.256E+093.102E+042.307E+031.304E+094.593E+094.652E+033.398E+093.130E+031.427E+063.560E+013.942E+081.418E+07
F24.647E+033.201E+023.032E+032.970E+044.892E+034.028E+034.220E+036.356E+034.685E+046.301E+014.084E+034.264E+023.236E+032.003E+022.496E+032.537E+03
F31.056E+032.040E+019.340E+026.623E+019.376E+023.601E+017.478E+022.630E+018.686E+022.655E+038.779E+026.120E+037.721E+023.784E+051.077E+026.835E+02
F41.636E+058.611E+001.919E+031.301E+033.277E+035.103E+001.903E+039.319E+036.343E+042.368E+062.472E+031.442E+001.906E+032.230E+016.471E+035.651E+05
F54.908E+063.120E+046.073E+046.310E+041.152E+067.214E+041.454E+056.531E+018.328E+073.791E+021.525E+061.681E+025.776E+056.552E+031.447E+047.658E+03
F61.667E+032.119E+051.857E+032.014E+022.049E+031.620E+011.624E+039.300E+011.624E+036.240E+022.371E+030.000E+002.049E+033.567E+031.883E+024.681E+01
F71.891E+069.101E+073.251E+057.302E+012.718E+052.531E+059.194E+043.613E+042.144E+060.000E+001.745E+056.067E+033.955E+030.000E+001.056E+033.597E+02
F85.111E+034.715E+032.305E+035.200E+003.165E+031.435E+032.597E+037.020E+034.968E+046.234E+015.021E+032.641E+052.311E+036.302E+066.491E+030.000E+00
F93.022E+032.605E+063.258E+034.106E+042.975E+036.165E+022.827E+035.460E+023.533E+031.563E+062.985E+036.340E+042.910E+033.409E+021.004E+033.564E+03
F104.505E+033.106E+033.005E+035.780E+033.220E+033.031E+032.931E+043.631E+003.310E+052.061E+023.162E+035.987E+022.913E+031.613E+052.139E+035.651E+04
Friedman mean rank6.603.805.552.956.755.002.952.40
Rank74628531
Table 3. The parameter settings of the mSAR algorithm and its value.
Table 3. The parameter settings of the mSAR algorithm and its value.
ParameterValue
Maximum iterations ( T max ) 350
Number of independent runs ( t ) 30
Population size ( N ) 50
Dimension of problem ( D i m ) 20
Mutation ratio ( P ) 0.5
Social effect parameter ( S E ) 0.05
Table 4. mSAR fuzzy entropy in terms of fitness values over all competed algorithms.
Table 4. mSAR fuzzy entropy in terms of fitness values over all competed algorithms.
LFDHHOSCAEOGSAAOASARmSAR
Test Image nTh Mean Std Mean Std Mean Std Mean Std Mean Std Mean Std Mean Std Mean Std
Test 1218.10462.8080E-1618.07592.8440E-1618.10622.7720E-1618.08762.9991E-0418.02612.7360E-1618.00821.9760E-0218.21102.5560E-1618.12552.4120E-16
522.64312.8080E-1622.62642.8440E-1622.61533.9963E-0322.57222.1917E-0322.51991.3756E-0322.61692.7360E-1622.78932.5560E-1622.68082.4120E-16
727.31541.9500E-0427.32598.5320E-1627.35601.1935E-0327.09814.7140E-0327.10081.1400E-0427.31991.7480E-0427.31847.6680E-1627.39037.2360E-16
1031.36381.9500E-0431.40521.5642E-0331.43012.1637E-0331.02097.9976E-0331.11375.0236E-0331.38013.5796E-0331.42052.5560E-1631.53912.4120E-16
Test 2218.34142.8080E-1618.31392.8440E-1618.34252.7720E-1618.33441.3073E-0418.27932.6752E-1518.30722.7360E-1618.34912.5560E-1618.39642.4120E-16
522.95912.7066E-1523.76309.4010E-0322.85479.2400E-0323.76302.8684E-0322.82496.3916E-0322.76007.3188E-0323.12172.5560E-1623.05662.4120E-16
727.35991.2246E-0527.35361.2087E-0527.36528.5470E-0327.44355.2061E-0327.17784.6436E-0527.11152.3940E-0227.45061.0224E-1527.47359.6480E-16
1031.30654.0560E-0431.33728.6900E-0431.36778.1620E-0431.46641.0151E-0231.11281.0412E-0331.13852.5916E-0231.35601.2780E-1531.46641.2060E-15
Test 3218.16952.8080E-1618.14602.8440E-1618.17012.7720E-1618.16626.4135E-0518.11428.1320E-1518.13512.7360E-1618.17002.5560E-1618.24092.4120E-16
522.74283.3306E-0322.70421.8170E-0322.81491.0318E-0522.69684.4602E-0422.65843.1616E-0322.68431.3680E-1522.77942.9465E-0322.87162.7805E-03
727.29302.8860E-0427.14171.5642E-0227.35923.6190E-0426.95267.0979E-0326.99721.4668E-0226.99021.1172E-0227.33305.1191E-1627.44204.8307E-16
1031.46308.2680E-0431.49701.5326E-0231.56967.0070E-0430.84511.3996E-0231.15452.0900E-0231.16302.5536E-0231.56047.6680E-1631.68667.2360E-16
Test 4218.42941.1232E-1518.40571.1376E-1518.43002.4178E-0718.42081.9994E-0418.36491.0944E-1518.39441.0944E-1518.42951.0224E-1518.40201.0656E-15
523.24532.6208E-0623.25188.5320E-1623.25119.2400E-0523.19999.3818E-0423.14418.2080E-1623.20888.2080E-1623.25187.6680E-1623.24277.9920E-16
727.57002.7300E-0527.56073.8789E-0527.59483.3572E-0527.44112.6223E-0327.44361.1400E-0427.54431.4136E-0527.59072.5560E-1627.56192.6640E-16
1031.63292.9718E-0331.68104.8980E-0331.74271.1319E-0331.74275.2907E-0331.45836.2548E-0331.58985.7608E-0331.73142.5560E-1631.04522.6640E-16
Test 5218.15872.8080E-1618.13302.8440E-1618.15942.7720E-1618.15466.8133E-0518.09902.1584E-1518.12422.7360E-1618.17662.5560E-1618.33582.6640E-16
523.03765.7408E-1523.01658.5320E-1623.04262.1637E-0322.98201.2919E-0322.92749.8800E-1523.00658.2080E-1623.06987.6680E-1623.27357.9920E-16
727.60851.6380E-0427.47552.1251E-0227.67831.2782E-0227.06641.2996E-0227.34791.5580E-0227.39092.0520E-0227.72901.2780E-1527.98061.3140E-15
1031.62382.2074E-0331.72922.0935E-0231.81161.0626E-0230.78541.7918E-0231.35142.1660E-0231.48112.3712E-0231.87317.6680E-0631.85072.6280E-16
Test 6218.71035.6238E-1618.68495.6959E-1618.71085.5517E-1618.70531.1535E-0418.65055.4796E-1618.67455.4796E-1618.70885.1191E-1618.71115.2633E-16
523.27931.3260E-0423.25491.0428E-0523.28642.2330E-0423.24769.2280E-0423.19151.9760E-0423.24113.6176E-0623.29092.3430E-0423.28862.6280E-04
727.77714.9218E-0527.79515.6485E-0327.85016.8838E-0527.55745.4215E-0327.60005.4872E-0327.69209.5760E-0327.83421.2780E-1527.85011.3140E-15
1031.87574.6020E-0431.93504.1870E-0431.96701.1858E-0331.99538.4590E-0331.65251.1096E-0331.88102.4472E-0331.98530.0000E+0031.97010.0000E+00
Test 7218.43192.8080E-1618.40871.8802E-0518.43341.1242E-0518.42372.6915E-0418.36751.6188E-0518.39818.5880E-0618.45092.5560E-1618.54102.7360E-16
523.09038.4240E-1623.07596.1462E-0523.10401.6940E-0423.04211.1381E-0322.98561.2160E-0423.06338.2080E-1623.12667.6680E-1623.24028.2080E-16
727.39277.8000E-0527.39456.0040E-0427.42776.0830E-0427.27543.2375E-0327.26794.8640E-0427.38203.9520E-0427.45761.7892E-1527.59381.9152E-15
1031.33244.3680E-0431.36425.6880E-0431.39891.2551E-0331.04976.7903E-0331.18699.1960E-0431.34041.1020E-0331.42692.0448E-1531.58431.9872E-15
Test 8218.30201.1232E-1518.27441.1376E-1518.30697.9310E-0618.18679.9970E-0418.19011.0944E-1518.03823.2604E-0218.32111.0224E-1518.32119.9360E-16
523.03765.7408E-0523.05788.5320E-1622.97031.3552E-0222.75045.9444E-0323.10412.3560E-0423.05218.2080E-1623.10417.6680E-1623.04487.4520E-16
727.12521.4820E-0427.18162.6781E-0527.19513.8808E-0326.72319.2280E-0326.82572.2040E-0427.18381.3680E-0427.22667.6680E-1627.39737.4520E-16
1030.83592.0436E-0330.97071.5484E-0331.00862.7258E-0329.91565.1062E-0230.54481.8316E-0330.87481.5732E-0231.01875.1191E-1631.21144.9749E-16
Table 5. mSAR fuzzy entropy in terms of PSNR values over all competed algorithms.
Table 5. mSAR fuzzy entropy in terms of PSNR values over all competed algorithms.
LFDHHOSCAEOGSAAOASARmSAR
Test Image nTh Mean Std Mean Std Mean Std Mean Std Mean Std Mean Std Mean Std Mean Std
Test 1214.03485.5380E-1414.04844.6150E-1414.17106.4610E-1314.027575.3520E-0213.95164.6150E-1314.01005.5380E-1314.08209.7308E-1214.17104.4304E-13
514.89382.2700E-0414.90838.3000E-0416.70243.9900E-0315.046243.3600E-0112.44782.3050E-1314.83600.0000E+0014.92275.8428E-1215.03842.2128E-13
720.75451.6860E-0320.77772.0200E-0320.96952.4430E-0220.223021.1340E+0112.94491.1550E-1220.67395.5800E-0320.79790.0000E+0020.95911.1088E-12
1021.27264.2840E-0321.34992.3050E-0321.62586.8600E-0320.897678.6400E+0013.78426.7500E-0121.26187.3800E-0321.69221.5552E-1121.48741.1088E-12
Test 2215.07714.1520E-1415.09183.4600E-1415.02354.8440E-1315.070964.9500E-0214.09413.4600E-1315.01864.1520E-1315.10645.8428E-1215.27713.3216E-13
516.70565.5380E-1417.22391.2500E-0317.50636.4610E-1316.702484.9200E-0112.16184.6150E-1317.57332.7660E-1316.73807.7868E-1216.70564.4304E-13
719.86561.1940E-0319.88492.0700E-0320.04601.0500E+0119.429921.7580E+0115.71232.3050E-1319.71468.2800E-0319.90423.8880E-1220.06562.2128E-13
1021.53013.6360E-0121.50983.4100E-0221.69655.1450E+0020.877071.2300E+0117.50842.8900E-0121.18594.6140E-0121.55951.9440E-1121.74310.0000E+00
Test 3216.49750.0000E+0016.51350.0000E+0016.65770.0000E+0016.75777.2000E-0214.17620.0000E+0016.43340.0000E+0016.52953.8880E-1216.75770.0000E+00
518.12592.4000E-0419.18382.6550E-0316.65774.8440E-1319.18891.7340E+0115.94423.4600E-1319.25191.7400E-0317.14441.2639E+0317.24423.3216E-13
719.14679.6000E-0420.15913.1100E-0319.47501.2040E-0218.855181.4340E+0115.30151.4450E-0420.63705.4600E-0319.32690.0000E+0019.43950.0000E+00
1021.00073.2400E-0321.25612.6650E-0221.29303.0310E+0019.61121.2120E+0115.46061.1500E-0321.86003.6000E-0221.06667.7868E-1221.86243.3216E-13
Test 4215.65818.2800E-1415.67336.9000E-1415.81019.6600E-1315.633342.5200E-0215.62916.9000E-1315.59735.5380E-1315.65819.7308E-1215.84936.6240E-13
519.05297.8000E-0519.07141.1850E-0319.23481.6170E-1218.966423.4560E-0115.88501.1550E-1218.97898.2800E-1319.05293.8880E-1219.33481.1088E-12
721.66502.5140E-0321.68403.4150E-0321.86811.0570E-0221.386929.4200E-0117.44914.5500E-0321.57684.4520E-0221.87887.7868E-1221.78502.2128E-13
1021.69085.0340E-0322.04695.8000E-0321.88269.3100E-0321.999771.1460E+0118.66703.0450E-0422.73002.1060E-0221.72060.0000E+0021.84722.2128E-13
Test 5216.23075.5380E-1416.44654.0000E-0416.38836.4610E-1316.271942.2140E-0212.61624.6150E-1316.16772.7660E-1316.07329.7308E-1216.44654.4304E-13
519.37434.8000E-0519.39312.1000E-0319.47400.0000E+0019.189933.3840E-0113.17260.0000E+0019.29915.0940E-0419.18623.8880E-1219.31790.0000E+00
719.36717.5000E-0420.07153.7300E-0319.58533.5000E-0319.193021.1040E+0112.80972.3050E-1320.01014.4400E-0319.18623.8880E-1219.31792.2128E-13
1020.29512.6400E-0121.03144.0000E-0320.84584.2910E+0019.532928.8200E+0012.65891.8500E-0320.84321.0140E-0220.72741.3364E-0121.07072.2128E-13
Test 6216.75300.0000E+0016.76920.0000E+0016.91562.5480E-0216.756045.6400E-0214.58700.0000E+0016.68790.0000E+0016.59033.8880E-1216.96420.0000E+00
518.60900.0000E+0018.93022.0150E-0518.47661.1900E-0318.685231.4640E+0115.18820.0000E+0018.84350.0000E+0017.08709.6324E+0219.00610.0000E+00
718.90876.0000E-0419.01372.3000E-0419.11003.1920E-0218.640941.7400E+0113.71244.9900E-0419.05188.2800E-1319.89050.0000E+0019.89050.0000E+00
1021.15114.6560E-0321.26648.7500E-0320.97993.1220E-0220.10561.4520E+0115.74144.1500E-0320.86061.9740E-0221.40487.7868E-1221.30124.4304E-13
Test 7215.03399.6600E-1415.06298.0500E-1415.17461.1270E-1214.979295.3460E-0214.26988.0500E-1314.97759.6600E-1315.07775.8428E-1215.00477.7280E-13
517.66045.5380E-1417.68681.8950E-0517.88591.3300E-0317.792221.2960E+0114.52784.6150E-1317.59188.2800E-1319.89053.8880E-1217.62614.4304E-13
719.69889.4800E-0419.77252.6650E-0319.71533.9620E-0219.914021.6560E+0114.61935.7500E-1319.64175.5380E-1319.69923.8880E-1219.92895.5200E-13
1021.73712.8980E-0321.78092.1150E-0221.82023.7380E-0221.106761.4220E+0115.94112.2500E-0321.47321.7220E-0221.82301.1664E-1122.87754.4304E-13
Test 8212.61244.1520E-1412.62463.4600E-1412.70464.8440E-1312.510383.6600E-0212.62253.4600E-1313.32774.1520E-1312.60011.9440E-1213.74703.3216E-13
517.38238.2800E-1417.40126.9000E-1417.17259.8700E-0216.980585.7600E+0014.97606.9000E-1317.31684.1520E-1317.36750.0000E+0017.57006.6240E-13
720.68032.6040E-0120.93141.0100E-0320.78754.4240E-0219.792489.9600E+0015.81946.3500E-0320.60936.9000E-1320.69017.7868E-1220.93144.4304E-13
1021.49202.2620E-0121.87649.8000E-0321.67462.6460E+0021.157236.8400E+0016.03681.2500E-0321.70915.6400E-0320.69017.7868E-1221.93143.3216E-13
Table 6. mSAR fuzzy entropy in terms of SSIM values over all competed algorithms.
Table 6. mSAR fuzzy entropy in terms of SSIM values over all competed algorithms.
LFDHHOSCAEOGSAAOASARmSAR
Test Image nTh Mean Std Mean Std Mean Std Mean Std Mean Std Mean Std Mean Std Mean Std
Test 120.69043.4727E-150.69113.1570E-150.67513.4276E-150.69731.1529E-020.69213.2923E-140.69913.1119E-140.69903.1254E-150.69914.5100E-15
50.72554.4044E-040.72625.8240E-030.70946.5512E-040.73185.9749E-020.72735.7597E-140.73455.4441E-140.73455.4678E-150.73555.6019E-15
70.74713.5343E-030.74783.8570E-030.73042.9792E-030.75094.5494E-020.74893.2923E-140.75631.5387E-020.75643.1254E-150.75643.2021E-15
100.77137.2534E-030.77216.0900E-030.75424.0280E-030.76826.9565E-020.77321.4892E-010.78092.4909E-020.77102.3423E-150.78232.3998E-15
Test 220.58088.7010E-160.58137.9100E-160.56788.5880E-160.58751.6281E-020.58228.2490E-150.58797.7970E-150.58807.8309E-160.58158.0230E-16
50.64913.4727E-150.64978.5400E-030.65723.4276E-150.65475.1959E-020.65073.2923E-140.65713.1119E-140.65723.1254E-150.64993.2021E-15
70.68771.0934E-030.68841.2250E-030.67074.8260E-020.68281.6515E-010.68943.2923E-140.69687.0380E-030.69633.1254E-150.69683.2021E-14
100.70937.2534E-020.72727.6300E-020.69186.9768E-020.70011.5113E-010.71196.4751E-010.71368.4180E-010.71541.5593E-150.72721.5975E-15
Test 320.70938.7010E-160.71007.9100E-160.69358.5880E-160.71641.8462E-020.71108.2490E-150.71817.7970E-150.71827.8309E-160.71818.0230E-16
50.76773.2340E-040.76941.0990E-020.75075.9964E-150.77001.6904E-010.76965.7597E-140.77722.0769E-030.77735.4678E-150.77785.6019E-14
70.82176.2986E-030.82168.0500E-030.84257.1136E-030.81182.0799E-010.82192.4017E-020.83095.0508E-020.83012.3423E-150.83002.3998E-15
100.83979.1630E-030.84141.7710E-020.85012.6448E-020.83171.9241E-010.84084.9932E-030.85001.0902E-010.84923.9016E-150.85013.9973E-15
Test 420.68141.7325E-150.68211.5750E-150.66631.7100E-150.68836.8630E-030.68311.6425E-140.68991.5525E-140.68991.5593E-150.69091.5975E-15
50.76152.9876E-030.76227.4200E-030.74454.2788E-150.76912.2981E-020.76334.1099E-140.77093.8847E-140.77093.9016E-150.78093.9973E-15
70.79831.4784E-020.80002.2540E-020.77885.0008E-030.80905.6010E-020.79852.7083E-020.80911.9389E-010.80642.3423E-150.83632.3998E-15
100.82892.9722E-030.84982.9610E-030.81041.7404E-030.82171.2542E-010.83094.9129E-030.83918.9700E-030.83923.9016E-150.84983.9973E-16
Test 520.75431.7325E-150.75502.9540E-030.73751.7100E-150.76271.2230E-020.75611.6425E-140.76361.5525E-140.76371.5593E-140.76361.5975E-16
50.80011.2782E-020.80272.5970E-020.78141.7100E-150.82729.1922E-020.80121.6425E-140.80001.2144E-010.80921.5593E-140.80011.5975E-16
70.81906.4141E-030.81988.7500E-030.79994.1420E-030.84369.3480E-020.82013.2923E-140.82821.9389E-020.82833.1254E-140.82823.2021E-16
100.84873.9193E-020.85045.0120E-030.86986.1484E-020.83721.2075E-010.85253.5916E-020.86103.8226E-020.86117.8309E-150.86108.0230E-17
Test 620.68232.6026E-150.68302.3660E-150.66722.1356E-030.68921.0828E-020.68402.4674E-140.69082.3322E-140.69092.3423E-140.68312.3998E-16
50.71830.0000E+000.71901.7920E-040.70234.3700E-030.72465.5075E-020.72010.0000E+000.72720.0000E+000.72730.0000E+000.73720.0000E+00
70.77409.7020E-040.77485.1170E-040.75683.0476E-030.76092.1968E-010.77591.3213E-030.78360.0000E+000.78370.0000E+000.79360.0000E+00
100.79472.9953E-030.80553.8360E-030.77701.2008E-030.78451.4879E-010.79676.1539E-030.80451.6008E-020.80463.9016E-150.80553.9973E-15
Test 720.65720.0000E+000.65780.0000E+000.64250.0000E+000.66579.1922E-030.65880.0000E+000.66530.0000E+000.66540.0000E+000.66530.0000E+00
50.72641.7325E-150.72711.3860E-030.70943.2528E-030.72911.0283E-010.72821.6425E-140.73541.5525E-140.73551.5593E-150.73841.5975E-15
70.79657.1841E-030.79736.6010E-030.77881.2160E-020.78632.5473E-010.79854.1099E-140.80633.8847E-140.80643.9016E-150.80633.9973E-16
100.82801.1165E-020.82701.0360E-020.83781.1096E-020.81541.8151E-010.82734.0223E-030.83556.6378E-020.83560.0000E+000.83780.0000E+00
Test 820.63023.4727E-150.63083.1570E-150.61623.4276E-150.63569.5038E-030.63173.2923E-140.63803.1119E-140.63813.1254E-150.63883.2021E-16
50.79381.7325E-150.79461.5750E-150.77622.1052E-020.78913.7003E-010.79581.6425E-140.80361.5525E-140.80371.5593E-150.80551.5975E-15
70.82531.6401E-010.82974.8440E-030.81041.5352E-020.76545.7101E-010.83183.1025E-020.84007.7970E-150.84017.8309E-160.84008.0230E-16
100.84512.0251E-020.84772.6320E-030.82633.6404E-020.82903.1238E-010.84891.7885E-020.85732.6565E-020.85743.9016E-150.88783.9973E-15
Table 7. mSAR fuzzy entropy in terms of FSIM values over all competed algorithms.
Table 7. mSAR fuzzy entropy in terms of FSIM values over all competed algorithms.
LFDHHOSCAEOGSAAOASARmSAR
Test Image nTh Mean Std Mean Std Mean Std Mean Std Mean Std Mean Std Mean Std Mean Std
Test 120.78662.6702E-150.78892.6702E-150.79282.6364E-150.78341.5300E-020.78752.5688E-150.73262.1970E-140.79892.7040E-150.78892.6702E-16
50.83101.2482E-040.83352.3321E-030.83761.8564E-040.82753.3240E-020.83201.7100E-150.77401.4625E-140.83351.8000E-150.84411.7775E-16
70.86367.1600E-030.86675.2029E-030.87115.9670E-030.85449.7016E-020.86564.2788E-150.80522.1065E-020.87824.5040E-150.86724.4477E-16
100.90404.4249E-030.90682.3487E-030.91143.6386E-030.87671.3644E-010.90481.9029E-020.84201.8084E-020.91826.3120E-150.92186.2331E-15
Test 220.71242.6702E-150.71452.6702E-150.71802.6364E-150.71101.1594E-020.71322.5688E-150.66352.1970E-140.72362.7040E-150.72632.6702E-15
50.76871.7775E-150.77126.0727E-030.77481.7550E-150.76604.0945E-020.76961.7100E-150.71601.4625E-140.78081.8000E-150.78381.7775E-15
70.81962.3324E-030.82183.6293E-030.82328.5020E-020.79601.8010E-010.82072.5688E-150.76341.3322E-020.83262.7040E-150.83582.6702E-16
100.84865.4287E-020.85226.0860E-030.85485.3772E-020.81551.3899E-010.85093.3859E-030.79144.3354E-020.86342.7040E-150.86682.6702E-16
Test 320.86228.9270E-160.86478.9270E-160.86908.8140E-160.85981.3359E-020.86328.5880E-160.80307.3450E-150.87069.0400E-160.87918.9270E-17
50.90563.4380E-030.90797.1640E-030.91286.1542E-150.89721.0638E-010.90685.9964E-150.84352.0303E-020.91466.3120E-150.92356.2331E-16
70.94304.1078E-030.94516.1499E-030.96054.7985E-030.92711.3876E-010.78751.6046E-030.87763.0148E-020.95122.7040E-150.96052.6702E-16
100.95957.5158E-030.96167.9980E-030.96582.1347E-020.94071.4107E-010.95982.7161E-030.89356.6963E-020.96804.5040E-160.97744.4477E-16
Test 420.81123.5629E-150.81363.5629E-150.81753.5178E-150.80852.3115E-030.81213.4276E-150.75552.9315E-140.81913.6080E-160.82713.5629E-16
50.89118.9270E-040.89352.2911E-030.89864.3914E-150.88734.8050E-030.89214.2788E-150.82993.6595E-140.88984.5040E-160.89814.4477E-16
70.93003.1060E-030.93273.8932E-030.93842.1294E-030.92491.4124E-020.93076.8400E-040.93462.5424E-020.92424.5040E-160.93694.4477E-16
100.95652.2116E-030.96891.2033E-030.96354.0404E-040.93631.0487E-010.95724.9704E-040.96081.2541E-020.94103.6080E-160.96353.5629E-16
Test 520.82721.7775E-150.84372.8788E-030.83371.7550E-150.82497.5590E-030.82821.7100E-150.83131.4625E-140.82021.8000E-160.84371.7775E-16
50.86757.6877E-030.87111.7350E-020.87388.8140E-160.88464.9903E-020.85958.5880E-160.87186.7132E-020.87069.0400E-170.88408.9270E-18
70.90288.6853E-030.92621.1923E-020.90944.2354E-030.92621.1791E-010.89432.5688E-150.90662.9324E-020.91622.7040E-160.91982.6702E-17
100.93434.1061E-020.93817.3272E-030.94156.0495E-020.90641.3081E-010.92795.0914E-030.94054.3272E-020.95093.6080E-160.95453.5629E-17
Test 620.73902.6702E-150.74112.6702E-150.74474.0716E-040.73623.2997E-030.73262.5688E-150.74262.1970E-140.75062.7040E-160.75342.6702E-16
50.79672.6702E-150.79906.3990E-040.80291.6302E-030.79277.8202E-020.78982.5688E-150.80062.1970E-140.80122.7040E-160.80292.6702E-16
70.84001.8328E-030.84679.3718E-040.84672.2698E-030.82091.5379E-010.83254.7272E-040.84395.1285E-140.84296.3120E-160.84226.2331E-16
100.87502.8145E-030.87774.5327E-030.88161.1310E-030.84241.5632E-010.86712.0444E-040.87911.5582E-020.88841.8000E-140.87721.7775E-16
Test 720.77243.5629E-150.77473.5629E-150.77853.5178E-150.76974.1979E-030.76573.4276E-150.77622.9315E-140.78453.6080E-140.77473.5629E-16
50.84541.7775E-150.84791.1139E-040.85201.0608E-030.83869.5342E-020.83811.7100E-150.84961.4625E-140.85871.8000E-140.86201.7775E-16
70.90101.0349E-030.90343.6429E-030.90794.9374E-030.88181.7289E-010.89312.5688E-150.82142.1970E-140.91502.7040E-140.91862.6702E-17
100.93117.9695E-030.93287.4290E-030.93718.1838E-030.90671.4445E-010.92121.4715E-030.84744.5527E-020.93834.5040E-150.94744.4477E-17
Test 820.77251.7775E-150.77481.7775E-150.77861.7550E-150.77023.9268E-030.76591.7100E-150.70441.4625E-140.78011.8000E-150.78771.7775E-17
50.85183.5629E-150.85433.5629E-150.85851.0140E-020.84301.6146E-010.84443.4276E-150.77662.9315E-140.86853.6080E-150.86013.5629E-17
70.90927.6237E-020.91436.6739E-030.92937.3976E-030.87042.5744E-010.90374.4982E-030.83100.0000E+000.92030.0000E+000.92930.0000E+00
100.94514.2539E-020.94932.4764E-030.95263.9179E-020.90511.4088E-010.93859.1512E-040.86301.2590E-020.95609.0400E-160.96538.9270E-18
Table 8. mSAR Otsu in terms of fitness values competing overall for algorithms.
Table 8. mSAR Otsu in terms of fitness values competing overall for algorithms.
LFDHHOSCAEOGSAAOASARmSAR
Test Image nTh Mean Std Mean Std Mean Std Mean Std Mean Std Mean Std Mean Std Mean Std
Test 121228.33801.3192E-152154.52651.3304E-152161.16331.2965E-151766.67591.4033E-032163.25651.2794E-152162.23809.2416E-022183.23341.1987E-152347.17121.1288E-15
52267.75341.3192E-152336.14691.3304E-152344.71121.8691E-021766.67591.0255E-022345.54626.4323E-032325.59311.2796E-152368.78551.1987E-152417.21291.1288E-15
72345.81769.1611E-042403.35103.9913E-152414.79955.5820E-031764.14852.2057E-022684.25015.3306E-042399.92738.1752E-042439.44213.5961E-152445.30253.3864E-15
102433.44979.1611E-042429.44277.3173E-032443.25051.0120E-021762.32273.7421E-022848.94002.3490E-022439.96491.6741E-022466.60901.1987E-152468.11931.1288E-15
Test 222231.94671.3192E-152673.62621.3304E-152681.62001.2965E-152240.52296.1169E-042684.25011.2509E-142684.74201.2796E-152709.01761.1987E-152375.91601.1288E-15
52256.11421.2716E-142838.43274.3978E-022847.55124.3215E-022245.71751.3421E-022849.52142.9887E-022844.47393.4229E-022876.64411.1987E-152413.10531.1288E-15
72282.98205.7532E-052911.09195.6543E-052923.61893.9974E-022251.53542.4359E-022922.07482.1713E-042905.92561.1196E-012953.48784.7949E-152969.94794.5151E-15
102389.88431.9055E-032955.34944.0652E-032966.88893.8174E-032266.96064.7496E-022921.94714.8687E-032969.52911.2121E-012997.29555.9936E-152998.44005.6439E-15
Test 321349.93211.3192E-151700.68161.3304E-151707.93561.2965E-151346.59973.0009E-041709.61073.8025E-141700.14061.2796E-151725.38521.1987E-151809.87351.1288E-15
51436.62071.5647E-021800.78108.4999E-031808.06574.8257E-051368.63022.0869E-031869.17031.4784E-021793.04776.3980E-151826.53831.3818E-021869.17031.3012E-02
71855.06631.3558E-031819.58717.3173E-021866.97331.6926E-031816.79273.3211E-021865.14616.8588E-021849.20565.2250E-021886.38112.4008E-151865.58692.2607E-15
101883.83773.8843E-031883.78497.1695E-021895.87533.2772E-031855.95316.5486E-021864.17709.7728E-021885.10251.1943E-011915.14613.5961E-151917.13533.3864E-15
Test 423342.35225.2768E-154005.51505.3217E-154017.60151.1308E-063378.43029.3552E-044021.26215.1174E-154019.51705.1184E-154058.64854.7949E-154104.81474.9869E-15
53357.68851.2313E-054087.95903.9913E-154100.71454.3215E-043532.90584.3897E-034104.53603.8381E-154104.57103.8388E-154142.56293.5961E-154165.36473.7402E-15
73531.26581.2826E-044146.26501.8145E-044161.20521.5702E-043588.56851.2270E-024160.55885.3306E-044157.24346.6113E-054203.71931.1987E-154197.69411.2467E-15
103566.74801.3962E-024180.40442.2913E-024195.68835.2939E-033628.74432.4755E-024192.13432.9247E-024221.91632.6943E-024229.64361.1987E-154221.85881.2467E-15
Test 522022.18831.3192E-152137.32861.3304E-152144.51581.2965E-152174.50073.1880E-042146.55301.0093E-142144.67281.2796E-152166.42471.1987E-152230.48671.2467E-15
52105.34762.6970E-142220.87043.9913E-152228.28011.0120E-022205.33136.0449E-032229.11994.6199E-142216.70773.8388E-152251.04603.5961E-152280.57883.7402E-15
72116.42907.6953E-042310.59969.9412E-022277.89035.9781E-022268.28216.0809E-022230.23987.2852E-022277.31479.5970E-022301.60645.9936E-152309.22436.1459E-15
102205.33231.0370E-022295.56029.7934E-022306.97824.9698E-022311.42908.3837E-022275.95621.0128E-012257.88291.1090E-012338.51263.5961E-052325.00291.2292E-15
Test 622362.76312.6421E-152779.86932.6645E-152788.26532.5965E-152462.66705.3972E-042790.99992.5623E-152791.14732.5628E-152816.75242.4008E-152899.24362.4618E-15
52543.92576.2295E-042986.40104.8782E-053026.36721.0444E-032696.25764.3178E-032999.74239.2398E-042969.95971.6919E-053026.36721.0988E-033010.82571.2292E-03
72657.25102.3123E-043092.67492.6424E-023107.75103.2196E-042891.49272.5367E-023109.25732.5658E-023110.35564.4786E-023138.79655.9936E-153167.60236.1494E-15
102673.94202.1620E-033150.47931.9587E-033164.37025.5460E-032919.28603.9580E-023115.00135.1885E-033166.88791.1445E-023196.69990.0000E+003201.83550.0000E+00
Test 721824.56251.3192E-151938.29588.7956E-051790.94415.2579E-051769.39051.2594E-031792.42977.5695E-051792.08194.0165E-051809.24181.1987E-151938.29581.2804E-15
51835.98773.9576E-151928.56382.8752E-041936.37737.9228E-041917.08025.3253E-031935.55205.6860E-041939.30673.8388E-151956.16093.5961E-152014.01823.8412E-15
71994.18373.6644E-041994.54362.8087E-032061.94552.8450E-031983.58581.5148E-022009.59652.2744E-032012.54641.8483E-032031.96218.3910E-152061.94558.9629E-15
102002.45472.0521E-032045.02622.6608E-032089.08425.8701E-032033.17073.1772E-022008.90274.3000E-032053.96055.1539E-032080.48989.5897E-152091.39729.2998E-15
Test 823404.38805.2768E-153424.38805.3217E-153370.33813.7093E-052754.57314.6776E-033373.58755.1174E-153373.55241.5249E-013404.71554.7949E-153424.38804.6499E-15
53447.81432.6970E-043520.67573.9913E-153534.25066.3383E-022918.61092.7814E-023536.33151.1017E-033537.89863.8388E-153570.35933.5961E-153599.45143.4874E-15
73640.47376.9624E-043579.37551.2528E-043596.10541.8151E-022945.79644.3178E-023597.83961.0306E-033599.75786.3980E-043632.57493.5961E-153661.26433.4874E-15
103557.69699.6008E-033692.44677.2434E-033638.56021.2749E-022963.26112.3892E-013626.77228.5646E-033618.36367.3577E-023675.73462.4008E-153692.44672.3282E-15
Table 9. mSAR Otsu in terms of PSNR values competed overall for algorithms.
Table 9. mSAR Otsu in terms of PSNR values competed overall for algorithms.
LFDHHOSCAEOGSAAOASARmSAR
Test Image nTh Mean Std Mean Std Mean Std Mean Std Mean Std Mean Std Mean Std Mean Std
Test 1218.07745.2812E-1418.07895.2380E-1418.07895.2488E-1418.02662.8130E-0118.06005.2272E-1418.06175.2380E-1421.23025.2596E-1419.07745.2488E-14
521.23044.1076E-1421.23227.0810E-0221.23226.1722E-0220.94427.5175E-0121.21000.0000E+0021.21200.0000E+0022.19650.0000E+0022.23040.0000E+00
722.59671.9022E-1422.59871.9061E-0122.59872.0169E-0122.09042.6675E+0022.57503.4896E-1422.57727.4205E-0224.48833.5113E-1424.59673.5041E-14
1024.48851.8778E-1424.49069.9910E-0224.49061.4677E-0123.13243.5987E+0024.46507.4052E-1624.46731.0428E-0124.18547.0128E-1424.98856.9984E-14
Test 2216.18563.5257E-1416.18693.4969E-1416.18693.5041E-1416.04681.2028E-0116.17003.4896E-1416.17153.4969E-1418.28743.5113E-1416.18563.5041E-14
518.28765.2812E-1418.28918.0025E-0218.28915.2488E-1418.13084.9955E-0118.27005.2272E-1418.27175.2380E-1419.75885.2596E-1418.28765.2488E-14
719.75901.9560E-1619.76072.8615E-0219.65561.1518E+0019.06863.1186E+0019.74000.0000E+0019.74191.2125E-0220.38940.0000E+0019.75900.0000E+00
1020.49471.3839E-1620.60161.5617E+0020.39131.0012E+0019.69382.8712E+0020.47501.2826E+0020.79201.7703E+0020.18547.0128E-1420.38966.9984E-14
Test 3216.18566.1614E-1418.60276.1110E-1416.18696.1236E-1416.04682.2456E-1616.17006.0984E-1416.17156.1110E-1418.60276.1362E-1416.18566.1236E-14
518.60291.8093E-0218.60453.0798E-0118.60453.5041E-1419.93503.8121E+0018.58503.4896E-1418.58681.3095E-0219.23023.5113E-1418.60293.5041E-14
721.33551.7702E-0121.23222.4347E-0122.76162.0169E-0120.21485.5775E+0021.21007.1632E-1621.21201.5569E-1622.70165.2596E-1421.23045.2488E-11
1022.80693.6920E-0122.91409.6030E-0122.70381.1713E+0021.36106.1110E+0022.68002.4200E-1622.78724.8985E-0122.81293.5113E-1422.89183.5041E-14
Test 4218.81310.0000E+0021.33530.0000E+0018.81470.0000E+0018.65185.7715E-0218.79500.0000E+0018.79680.0000E+0021.33530.0000E+0018.81310.0000E+00
521.33551.7702E-1621.33734.4135E-0221.33735.2488E-1421.15263.5696E-0121.31505.2272E-1421.31705.2380E-1422.33225.2596E-1422.63555.2488E-13
723.33246.3081E-0223.33441.0573E-0123.33443.8880E-0223.02825.4805E-0123.31002.4200E-1623.31226.4020E-0223.90873.5113E-1423.43243.5041E-14
1024.90891.2959E-0124.91118.4875E-0224.96897.9218E-0223.75763.4920E+0024.88501.7424E-0224.88746.4020E-1624.76500.0000E+0024.96890.0000E+00
Test 5215.76526.1614E-1415.76656.0140E-0215.76656.1236E-1415.63001.9982E-0115.75006.0984E-1415.75156.1110E-1415.75886.1362E-1416.76526.1236E-13
519.75901.2616E-1619.76072.9973E-0119.76076.9984E-1419.58961.4647E+0019.74006.9696E-1419.74191.3289E-0119.75577.0128E-1419.75906.9984E-14
721.86101.6871E-1621.86292.7063E-0121.75789.3798E-0221.15264.2923E+0021.73505.2272E-1421.73714.8500E-0221.38325.2596E-1422.75595.2488E-13
1024.27831.7653E+0024.28041.8527E-0124.17532.7070E+0022.29884.8064E+0024.36001.1132E-0124.25731.4841E-0124.13135.2596E-1424.58345.2488E-14
Test 6217.13155.2812E-1417.13295.2380E-1417.13296.9498E-0416.98468.1480E-0217.11505.2272E-1417.11665.2380E-1417.33845.2596E-1417.13155.2488E-14
519.33867.0416E-1419.34022.2795E-0219.34022.6341E-0219.06861.6733E+0019.32006.9696E-1419.32186.9840E-1419.75577.0128E-1419.33866.9984E-14
721.75594.8802E-1621.75784.4620E-0221.75781.2101E-0120.73584.9955E+0021.73501.3068E-0221.73715.2380E-1421.43735.2596E-1421.75595.2488E-12
1023.43751.0269E-0123.43958.2935E-0223.43956.2694E-0221.77784.3893E-1623.41507.7440E-0323.41725.4320E-0223.81608.7660E-1423.43758.7480E-14
Test 7216.81622.6455E-1416.81762.6239E-1416.81762.6293E-1416.67201.0234E-0116.80002.6184E-1416.80162.6239E-1416.12822.6347E-1417.81622.6293E-14
519.12843.5257E-1419.13004.6075E-0219.13001.0595E-0118.86021.8236E+0019.11003.4896E-1419.11183.4969E-1419.75573.5113E-1420.12843.5041E-14
721.75599.3399E-1621.75785.4320E-0221.75781.4337E-0120.84004.9470E+0021.73508.7120E-1421.73718.7300E-1421.33228.7660E-1421.98598.7480E-14
1023.33241.6528E-0123.33441.2804E-0123.33441.5260E-0122.09044.2195E+0023.31003.7268E-1623.31222.5705E-0223.40247.0128E-1423.40246.9984E-14
Test 8215.34470.0000E+0015.34610.0000E+0015.34610.0000E+0015.21321.2125E-0115.33000.0000E+0015.33150.0000E+0016.17920.0000E+0015.34470.0000E+00
520.17941.7604E-1420.18111.7460E-1420.18116.3180E-0119.58966.0625E+0020.16001.7424E-1420.16191.7460E-1420.28121.7532E-1420.47941.7496E-14
722.07123.7164E+0022.17823.5114E-0122.17826.8526E-0119.17281.1786E+0122.26002.4636E-0122.26213.4969E-1423.54243.5113E-1423.68143.5041E-14
1023.33248.8020E-0123.58261.2174E-0123.43951.8760E+0021.88207.5175E+0023.52001.1084E-0123.52221.6830E-0123.34015.2596E-1423.58265.2488E-14
Table 10. mSAR Otsu in terms of SSIM values overall competed for algorithms.
Table 10. mSAR Otsu in terms of SSIM values overall competed for algorithms.
LFDHHOSCAEOGSAAOASARmSAR
Test Image nTh Mean Std Mean Std Mean Std Mean Std Mean Std Mean Std Mean Std Mean Std
Test 120.80032.4625E-140.80101.9447E-150.80071.9628E-150.80096.2930E-030.80082.0079E-150.80081.9853E-150.80111.9575E-150.80101.9614E-15
50.84093.1231E-030.84173.5876E-030.84143.7514E-040.84053.2613E-020.84153.5126E-150.84153.4732E-150.84183.4245E-150.84193.4314E-15
70.86592.5061E-020.86672.3759E-030.86641.7060E-030.86242.4832E-020.86652.0079E-150.86659.8165E-040.86681.9575E-150.86721.9614E-15
100.89405.1433E-020.89493.7514E-030.89462.3066E-030.88223.7970E-020.89469.0821E-030.89461.5891E-030.89501.4670E-150.89501.4700E-15
Test 220.67316.1698E-150.67384.8726E-160.67354.9178E-160.67478.8867E-030.67365.0308E-160.67364.9743E-160.67384.9045E-160.67384.9144E-16
50.75232.4625E-140.75305.2606E-030.75281.9628E-150.75192.8361E-020.75282.0079E-150.75281.9853E-150.75311.9575E-150.75351.9614E-15
70.79717.7532E-030.79807.5460E-040.79552.7635E-020.78429.0142E-020.79772.0079E-150.79774.4900E-040.79801.9575E-150.79801.9614E-15
100.82215.1433E-010.82714.7001E-020.82053.9951E-020.80408.2489E-020.82373.9489E-020.83315.3704E-020.81999.7657E-160.82089.7853E-16
Test 320.82216.1698E-150.82354.8726E-160.82264.9178E-160.82281.0077E-020.82275.0308E-160.82274.9743E-160.82304.9045E-160.82354.9144E-16
50.88992.2932E-030.89186.7698E-030.89043.4337E-150.88439.2268E-020.89053.5126E-150.89051.3250E-040.89083.4245E-150.89083.4314E-15
70.95244.4663E-020.95234.9588E-030.95194.0735E-030.93231.1353E-010.95091.4647E-030.95203.2223E-030.95131.4670E-150.95131.4700E-15
100.97326.4974E-020.97521.0909E-020.97271.5145E-020.95521.0502E-010.97283.0452E-040.97396.9552E-030.97322.4436E-150.97322.4485E-15
Test 420.78981.2285E-140.79069.7020E-160.79039.7920E-160.79043.7460E-030.79041.0017E-150.79049.9045E-160.79079.7657E-160.79079.7853E-16
50.88262.1185E-020.88344.5707E-030.88312.4502E-150.88331.2543E-020.88322.5065E-150.88322.4783E-150.88322.4436E-150.88352.4485E-15
70.92531.0483E-010.92721.3885E-020.92372.8636E-030.92913.0572E-020.92381.6517E-030.92701.2370E-020.92401.4670E-150.92421.4700E-15
100.96072.1076E-020.96161.8240E-030.96139.9661E-040.94376.8457E-020.96142.9962E-040.96145.7226E-040.96162.4436E-150.96192.4485E-15
Test 520.87421.2285E-140.87511.8197E-030.87479.7920E-160.87606.6756E-030.87481.0017E-150.87489.9045E-160.87509.7657E-160.87529.7853E-16
50.92749.0636E-020.93041.5998E-020.92699.7920E-160.92705.0174E-020.92701.0017E-150.92807.7475E-030.92719.7657E-160.92739.7853E-16
70.94934.5482E-020.95025.3900E-030.94882.3718E-030.94585.1024E-020.94892.0079E-150.94891.2370E-030.94901.9575E-150.95021.9614E-15
100.98362.7791E-010.98563.0874E-030.98423.5208E-020.96156.5906E-020.98642.1904E-030.98642.4387E-030.98664.9045E-160.98694.9144E-16
Test 620.79091.8455E-140.79191.4575E-150.79131.2229E-030.79155.9103E-030.79141.5048E-150.79141.4879E-150.79161.4670E-150.79191.4700E-15
50.83260.0000E+000.83341.1039E-040.83302.5024E-030.83223.0062E-020.83310.0000E+000.83310.0000E+000.83330.0000E+000.83340.0000E+00
70.89726.8796E-030.89803.1521E-040.89771.7452E-030.87391.1991E-010.89788.0581E-050.89780.0000E+000.89790.0000E+000.89860.0000E+00
100.92112.1239E-020.92202.3630E-030.92176.8762E-040.90108.1213E-020.92173.7530E-040.92171.0213E-030.92192.4436E-150.92252.4485E-15
Test 720.76170.0000E+000.76240.0000E+000.76210.0000E+000.76235.0174E-030.76220.0000E+000.76220.0000E+000.76260.0000E+000.76260.0000E+00
50.84191.2285E-140.84288.5378E-040.84141.8627E-030.83745.6126E-020.84251.0017E-150.84259.9045E-160.84279.7657E-160.84279.7853E-16
70.92325.0942E-020.92414.0662E-030.92376.9632E-030.90311.3904E-010.92382.5065E-150.92382.4783E-150.92352.4436E-150.92432.4485E-15
100.95977.9170E-020.95856.3818E-030.95816.3539E-030.93649.9072E-020.95722.4531E-040.95724.2347E-030.95680.0000E+000.95750.0000E+00
Test 820.73042.4625E-140.73101.9447E-150.73091.9628E-150.73005.1874E-030.73092.0079E-150.73091.9853E-150.73071.9575E-150.73181.9614E-15
50.92011.2285E-140.92109.7020E-160.92061.2055E-020.90622.0197E-010.92071.0017E-150.92079.9045E-160.92049.7657E-160.92109.7853E-16
70.95661.1630E+000.96162.9839E-030.96138.7910E-030.87913.1167E-010.96241.8921E-030.96244.9743E-160.96204.9045E-160.96274.9144E-16
100.97951.4360E-010.98261.6213E-030.98002.0846E-020.95211.7051E-010.98221.0907E-030.98221.6948E-030.98182.4436E-150.98252.4485E-15
Table 11. mSAR Otsu in terms of FSIM values overall competed for algorithms.
Table 11. mSAR Otsu in terms of FSIM values overall competed for algorithms.
LFDHHOSCAEOGSAAOASARmSAR
Test Image nTh Mean Std Mean Std Mean Std Mean Std Mean Std Mean Std Mean Std Mean Std
Test 120.80051.9063E-150.80051.8725E-150.80051.8759E-150.80061.0805E-020.79971.9401E-150.79821.9131E-150.80051.8725E-150.80021.8759E-15
50.84578.9112E-050.84571.6354E-030.84571.3209E-040.84581.2488E-150.84491.2915E-150.84331.2735E-150.84571.2465E-150.84181.2488E-15
70.87895.1117E-030.87943.6486E-030.87954.2458E-030.88003.1247E-150.87903.2316E-150.87731.8343E-030.87993.1190E-150.86913.1247E-15
100.91993.1590E-030.92021.6471E-030.92022.5890E-030.92029.6348E-150.91881.4372E-020.91731.5747E-030.92004.3711E-150.92014.3790E-15
Test 220.72491.9063E-150.72491.8725E-150.72491.8759E-150.72328.1872E-030.72431.9401E-150.72291.9131E-150.72491.8725E-150.72501.8759E-15
50.78231.2690E-150.78254.2585E-030.78231.2488E-150.77912.8914E-020.78151.2915E-150.78001.2735E-150.78231.2465E-150.78241.2488E-15
70.83401.6652E-030.83392.5451E-030.83136.0495E-020.83431.2718E-010.83341.9401E-150.83171.1600E-030.83461.8725E-150.83411.8759E-15
100.86363.8757E-020.86474.2679E-030.86313.8261E-020.86529.8151E-020.86402.5572E-030.86223.7751E-030.86511.8725E-150.86521.8759E-15
Test 320.87746.3732E-160.87746.2602E-160.87746.2715E-160.87759.4338E-030.87666.4862E-160.87496.3958E-160.87746.2602E-160.87736.2715E-16
50.92162.4545E-030.92125.0238E-030.92194.3790E-150.92187.5124E-150.92084.5289E-150.91901.7679E-030.92174.3711E-150.92164.3790E-15
70.95962.9326E-030.95894.3127E-030.95893.4143E-030.95879.7989E-150.95781.2119E-030.95612.6252E-030.95861.8725E-150.95831.8759E-15
100.97645.3657E-030.97575.6087E-030.97521.5189E-020.97569.9618E-150.97462.0514E-030.97345.8309E-030.97553.1190E-150.97503.1247E-15
Test 420.82552.5436E-150.82552.4985E-150.82552.5031E-150.82561.6323E-110.82472.5887E-150.82312.5527E-150.82552.4985E-150.82562.5031E-15
50.90686.3732E-040.90661.6067E-030.90683.1247E-150.90693.3932E-030.90593.2316E-150.90423.1866E-150.90683.1190E-150.90653.1247E-15
70.94642.2175E-030.94642.7302E-030.94601.5152E-030.94619.9742E-030.94515.1660E-040.94372.2139E-030.94603.1190E-150.94593.1247E-15
100.97331.5789E-030.97308.4385E-040.97292.8749E-040.97307.4054E-020.97203.7540E-040.97201.0920E-030.97292.4985E-150.97242.5031E-15
Test 520.84181.2690E-150.84192.0188E-030.84181.2488E-150.84195.3380E-060.84101.2915E-150.84101.2735E-150.84181.2465E-150.84191.2488E-15
50.88285.4885E-030.88391.2167E-020.88236.2715E-160.88393.5241E-020.88156.4862E-160.88205.8456E-030.88236.2602E-160.88246.2715E-16
70.91876.2006E-030.91928.3615E-030.91823.0137E-030.91958.3266E-020.91711.9401E-150.91722.5535E-030.91801.8725E-150.91811.8759E-15
100.95082.9314E-020.95195.1383E-030.95074.3045E-020.95289.2372E-020.95153.8453E-030.95153.7680E-030.95282.4985E-150.95232.5031E-15
Test 620.75201.9063E-150.75201.8725E-150.75202.8971E-040.74892.3302E-030.75131.9401E-150.75131.9131E-150.75201.8725E-150.75211.8759E-15
50.81081.9063E-150.81074.4874E-040.81071.1600E-030.80635.5225E-020.81001.9401E-150.81001.9131E-150.81091.8725E-150.81091.8759E-15
70.85481.3085E-030.85466.5721E-040.85491.6151E-030.83501.0860E-010.85383.5703E-040.85384.4657E-150.85464.3711E-150.85474.3790E-15
100.89052.0094E-030.89063.1786E-030.89028.0475E-040.85691.1039E-010.88921.5441E-040.88941.3569E-030.89011.2465E-150.89091.2488E-15
Test 720.78602.5436E-150.78602.4985E-150.78602.5031E-150.78292.9645E-030.78532.5887E-150.78532.5527E-150.78602.4985E-150.78612.5031E-15
50.86031.2690E-150.86037.8114E-050.86037.5480E-040.85306.7329E-020.85951.2915E-150.86031.2735E-150.86031.2465E-150.86041.2488E-15
70.91697.3884E-040.91672.5547E-030.91673.5132E-030.89701.2209E-010.91591.9401E-150.91681.9131E-150.91681.8725E-150.91691.8759E-15
100.94765.6896E-030.94645.2097E-030.94625.8231E-030.92231.0201E-010.94471.1114E-030.94583.9644E-030.94563.1190E-150.94793.1247E-15
Test 820.78621.2690E-150.78621.2465E-150.78621.2488E-150.78642.7730E-130.78541.2915E-150.78621.2735E-150.78641.2465E-150.78621.2488E-15
50.86682.5436E-150.86682.4985E-150.86697.2150E-030.86691.1402E-080.86602.5887E-150.86682.5527E-150.86682.4985E-150.86692.5031E-15
70.92525.4428E-020.92784.6802E-030.92705.2637E-030.92761.8180E-070.92673.3973E-030.92750.0000E+000.92750.0000E+000.92760.0000E+00
100.96183.0370E-020.96321.7366E-030.96182.7877E-020.96359.9484E-080.96256.9115E-040.96331.0963E-030.96346.2602E-160.96356.2715E-16
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

Houssein, E.H.; Mohamed, G.M.; Abdel Samee, N.; Alkanhel, R.; Ibrahim, I.A.; Wazery, Y.M. An Improved Search and Rescue Algorithm for Global Optimization and Blood Cell Image Segmentation. Diagnostics 2023, 13, 1422. https://doi.org/10.3390/diagnostics13081422

AMA Style

Houssein EH, Mohamed GM, Abdel Samee N, Alkanhel R, Ibrahim IA, Wazery YM. An Improved Search and Rescue Algorithm for Global Optimization and Blood Cell Image Segmentation. Diagnostics. 2023; 13(8):1422. https://doi.org/10.3390/diagnostics13081422

Chicago/Turabian Style

Houssein, Essam H., Gaber M. Mohamed, Nagwan Abdel Samee, Reem Alkanhel, Ibrahim A. Ibrahim, and Yaser M. Wazery. 2023. "An Improved Search and Rescue Algorithm for Global Optimization and Blood Cell Image Segmentation" Diagnostics 13, no. 8: 1422. https://doi.org/10.3390/diagnostics13081422

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop