
==== Front
Sci Rep
Sci Rep
Scientific Reports
2045-2322
Nature Publishing Group UK London

39294221
71448
10.1038/s41598-024-71448-6
Article
Energy curve based enhanced smell agent optimizer for optimal multilevel threshold selection of thermographic breast image segmentation
Kotte Sowjanya 1
Injeti Satish Kumar drinjetisatishkumar@nitw.ac.in

2
Thunuguntla Vinod Kumar 2
Kumar Polamarasetty P 3
Nuvvula Ramakrishna S S 4
Dhanamjayulu C. dhanamjayulu.c@vit.ac.in

5
Rahaman Mostafizur 6
Khan Baseem baseemkh@hu.edu.et

789
1 Electronics and Communications Engineering Department, Kakatiya Institute of Science and Technology Warangal, Warangal, Telangana 506015 India
2 https://ror.org/017ebfz38 grid.419655.a 0000 0001 0008 3668 Electrical Engineering Department, National Institute of Technology Warangal, Hanamkonda, Telangana 506004 India
3 grid.411829.7 0000 0004 1775 4749 Department of Electrical and Electronics Engineering, GMR Institute of Technology, Rajam, Andhra Pradesh India
4 https://ror.org/02k949197 grid.449504.8 0000 0004 1766 2457 Deparmtent of Electrical and Electronics Engineering, NMAM Institute of Technology, NITTE (Deemed to be University), Karkala, Karnataka India
5 grid.412813.d 0000 0001 0687 4946 School of Electrical Engineering, Vellore Institute of Technology, Vellore, Tamilnadu India
6 https://ror.org/02f81g417 grid.56302.32 0000 0004 1773 5396 Department of Chemistry, College of Science, King Saud University, 11451 Riyadh, Saudi Arabia
7 https://ror.org/04r15fz20 grid.192268.6 0000 0000 8953 2273 Department of Electrical and Computer Engineering, Hawassa University, 05, Hawassa, Ethiopia
8 https://ror.org/00a2xv884 grid.13402.34 0000 0004 1759 700X Center for Renewable Energy and Microgrids, Huanjiang Laboratory, Zhejiang University, 311816 Zhejiang, China
9 https://ror.org/05cgtjz78 grid.442905.e 0000 0004 0435 8106 Department of Technical Sciences, Western Caspian University, Baku, Azerbaijan
18 9 2024
18 9 2024
2024
14 2183311 5 2024
28 8 2024
© The Author(s) 2024
2024
https://creativecommons.org/licenses/by-nc-nd/4.0/ Open Access This article is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License, which permits any non-commercial use, sharing, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if you modified the licensed material. You do not have permission under this licence to share adapted material derived from this article or parts of it. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by-nc-nd/4.0/.
Multilevel thresholding image segmentation will subdivide an image into several meaningful regions or objects, which makes the image more informative and easier to analyze. Optimal multilevel thresholding approaches are extensively used for segmentation because they are easy to implement and offer low computational cost. Multilevel thresholding image segmentation is frequently performed using popular methods such as Otsu’s between-class variance and Kapur’s entropy. Numerous researchers have used evolutionary algorithms to identify the best multilevel thresholds based on the above approaches using histogram. This paper uses the Energy Curve (EC) based thresholding method instead of the histogram. Chaotic Bidirectional Smell Agent Optimization with Adaptive Control Strategy (ChBSAOACS), a powerful evolutionary algorithm, is developed and employed in this paper to create and execute an effective method for multilevel thresholding segmentation of breast thermogram images based on energy curves. The proposed algorithm was tested for viability on standard breast thermogram images. All experimental data are examined quantitatively and qualitatively to verify the suggested method’s efficacy.

Keywords

Breast thermograms
Multilevel thresholding
Energy curve
Improved smell agent optimization
Wilcoxon test
Subject terms

Energy science and technology
Engineering
issue-copyright-statement© Springer Nature Limited 2024
==== Body
pmcIntroduction

Breast cancer is the most frequently detected type of cancer in females worldwide. Studies indicate that 2 in 5 women are prone to breast cancer throughout their lifetime. Breast cancer1 has been the second leading cause of death in women since 2013.Similarly, multiple studies have shown that women have a greater chance of surviving from breast cancer if the disease is detected and treated early2,3. The Nitric Oxide generated by cancer cells is responsible for the local temperature rise, which has been documented in several investigations4,5. The vasodilation process caused by nitric oxide causes breast tissue to heat up over its typical temperature because it interrupts the regular blood vessel flow in the area. An increase in skin temperature has been linked to deep breast malignant tumors. The relationship between an object’s energy output and its temperature has been described by Stefan Boltzmann’s Law6. As a result, the distribution of body temperature can be determined by observing infrared radiation.

Hence screening methods are essential in the detection and diagnosis of early stages of cancer. Ultrasound, Positron Emission Tomography (PET), Computed Tomography (CT), Magnetic Resonance Imaging (MRI), and Mammography are some of the medical imaging techniques that have been heavily used to detect early signs of breast cancer. Ultrasound7 is another important breast screening method to reduce a woman’s lifetime radiation exposure. However, due to noise levels and the technician’s expertise, this method has some limitations. This technique fails to detect micro-calcifications and deep breast tissue. Despite the stressful and painful process involved in getting a mammogram, it has become the most extensively utilized diagnostic imaging technology for breast cancer screening8,9. Mammography uses X-ray radiation, which is harmful to human tissue. Furthermore, mammography has accuracy issues with small tumors, with a 4%–34% percent false negative ratio. Another diagnostic method commonly used for breast cancer screening is magnetic resonance imaging (MRI). MRI has a number of disadvantages compared to mammography and ultrasound, such as a higher probability of false positives and a longer data gathering time10.

Physiological or vascular alterations in the breasts are seen in thermographic11 pictures. The use of thermal imaging for monitoring purposes is risk-free since it is nonionizing, noninvasive, painless, passive, and real-time. This technique is safe for pregnant and nursing women since it does not employ ionizing radiation. It’s especially helpful for young women since their tissues are thick, making X-ray screening more challenging and potentially dangerous. Authors12,13suggest that CADs might benefit doctors in making diagnoses by highlighting anomalies or diseases in medical imaging.

However, the segmentation method has been used to many problems with great success. Identifying aberrant areas or categorizing the elements in digital pictures requires the use of image segmentation14. The fundamental objective of segmentation is to ease the analysis process by dividing an image into discrete parts according to predetermined criteria such as texture, color, or brightness. After segments have been extracted, visualization, detection, identification, and quantitative analysis are often performed. Thresholding has also been widely employed in the last decade to aid clinicians in the diagnosis process through the medical image processing automation. The complexity of structures with similar characteristics, low contrast, noise conditions, and unclear boundaries typical of medical images15–17 make interpretation and analysis of image details difficult even though many works on automatic and semiautomatic segmentation have been done.

Medical digital images need to be segmented for a variety of purposes, including pre- and post-operative evaluation, diagnosis, and therapy planning. Despite thermography screening’s limited clinical utility, enhancing its application and automated detection is crucial to bringing it to widespread clinical acceptability18,19.

An eight-step semi-automatic procedure for segmenting thermal images was proposed by the authors. According to the authors, the inframammary fold and edge detection issues account for the vast majority of the malfunctions. After having a human expert segment the photos by hand, the authors employed a fuzzy rule-based system to identify the segmented regions20. A hybrid version of the snake optimization (SO) algorithm combined with the opposite-based learning (OBL) mechanism. Then, it is used to segment CT liver images.The imaged thresholding technique is used for this purpose and employed SO-OBL to identify the best, or optimal, thresholding values for gray levels in real cases with liver disease images21 .

In22, an algorithm was introduced that uses automated thresholding and boundary detection to partition thermal breast images. Despite encouraging findings, it’s possible that the area of interest being discovered may not encompass all of the upper breasts. Therefore, there is need for further study into the creation of an automated approach that may aid in the diagnosis of breast cancer using thermograms and has a cheap computing cost and high degree of resilience. Thus, reliable thresholding of breast thermograms could be used to quickly assess clinical diagnoses. The swarm algorithm is used to analyze breast thermograms in this paper.

Utilization of swarm intelligence algorithms in the selection of multi-level thresholding segmentation of medical images is not a new concept. Several authors implemented various optimization algorithms to find the optimal threshold values for brain MRI image segmentation23–26 based on different objective functions such as Otsu’s between class variance and Kapur’s entropy etc. A multi-level image segmentation technique using HRO-based Renyi’s entropy algorithm for microscopic images of cement is proposed. Taking Renyi’s entropy as the objective function, HRO is used to search the optimal threshold values and compared with other optimization algorithms27 .

The authors used a novel swarm technique called Dragonfly Algorithm (DA)28 based on the Otsu method and Kapur entropy as objective functions on the DA in the designed methodology. The method presented uses the energy curve29–31 instead of the histogram to solve this issue. The energy function (EF) first described in32,33 is used to derive the energy curve. The EF determines the power of each pixel’s intensity level by considering its position. Energy curves offer advantages in terms of noise reduction, feature detection, spatial information representation, and integration with other image processing techniques. These advantages make energy curves particularly useful in applications requiring detailed and smooth analysis of intensity variations, such as medical imaging and advanced image processing tasks. However, histograms remain valuable for their simplicity and effectiveness in summarizing the global intensity distribution and for tasks like thresholding.

“The No-Free Lunch Theorem” states that there is no single modern optimization strategy that can effectively tackle all real-world optimization issues. Furthermore, since every real-world issue has a unique characteristic that can be compared to the actions of one specific optimization method. For example, in image processing edge and lane detection problems can be used to describe ant systems’ behavior toward pheromone deposits. This analogy can be applied to the route planning problem in robotics, which can likewise be represented as an agent following the scent of an unknown substance. An agent’s olfactory organ (nose) is filled with smell molecules that move through the air and into the specialized cells (receptors) that deliver the message to the brain for proper interpretation. This paper gives a detailed implementation and validation of a new metaheuristic algorithm termed the chaotic smell agent optimization with adaptive control strategy (ChBSAOACS) in light of these interactions between an agent and its surrounding environment.

From the literature, it is observed that SAO showed superior performance over the other algorithms on CEC benchmark functions and many authors have utilized Otsu and Kapur’s objective approaches for multilevel image thresholding using various optimization algorithms based on energy curve. An improved version of SAO34 algorithm has been developed and implemented for the optimal multilevel thresholding of breast thermographic images based on energy curve.

The important contributions of this paper are:Chaotic Bidirectional Smell Agent Optimization with Adaptive Control Strategy is developed and implemented to multi-level thresholding for the first time.

To find the best thresholds for different breast thermographic images, ChBSAOACS algorithm maximizes the between class-variance and entropy described by Otsu and Kapur functions.

Qualitative and quantitative examination for eight different breast thermographic images using proposed approach.

A detailed validation of ChBSAOACS with other optimization algorithms proved the efficacy of the proposed approach.

Methodology

This section provides an overview of the optimization method for olfactory agents and shows how it may be implemented in multilevel thresholding scenario. In place of the image histogram, the chosen swarm and evolutionary algorithm learn the search space defined by the Otsu and Kapur methods, both of which are based on the energy curve.

Energy curve

Histogram-based multilevel thresholding is a widely employed method due to its convenience and effectiveness. An alternative to histogram-based segmentation is energy curve-based image segmentation35. The energy curve method, in contrast to the histogram method, maintains peaks and valleys in its plotted curve. In order to separate the objects in an image, segmentation algorithms must first find threshold values in the energy curve’s midpoint. Each valley is located between two nearby modes, and each mode stands in for a different feature of the image.1 Eg=-∑i=1M∑i=1N∑pq∈Nij2bijbpq+C

Consider Egis an EC of the image I. where I=gij,1≤i≤M,1≤i≤N. gij is the imaging value of I at pixel location i,j defined under the interval 0,L-1whereL=256. The energy of I is computed at grey level g0≤g≤L-1bij are the elements of a two-dimensional matrix Bg.Bg=bij,1≤i≤M,1≤i≤N,bij=1,ifgij>g;elsebij=-1. To ensure Eg>0 constant C is added to Eq. 1.Special correlation between adjacent pixels of an image I is Nijd=i+u,j+v,u,v∈Nd. In this paper d is considered a second-order system i.e., u,v∈±1,0,0,±1,1,±1,-1,±1.

Otsu’s between class variance

Otsu’s method36 takes a bi-modal histogram and separates foreground and background pixels by computing the best threshold that minimizes the two classes’ combined spread (intra-class variance). For the multi-level thresholding expansion of the Otsu method, the term “Multi Otsu” was coined. Otsu presented a nonparametric thresholding technique that uses the maximum variance of the distinct classes as a criterion for segmenting the image.

nt thresholds are required to divide the original image into nt+1 classes for the multi-level technique. As a result, th=th1,th2,⋯.thntencodes the collection of thresholds used for image segmentation. In this way, the grey value Ei of each pixel generates a probability PEi=EiNP where ∑i=1NPPEi=1and NP is the total number of pixels in the image.In order to calculate the variance σ2 and the means μk for each of the produced classes, the following formulae are used:2 σ2=∑k=1ntσk=∑k=1ntωkμk-μT

3 μk=∑i=thkthk+1-1kPEiωithiwhere,ωk=∑i=thkthk+1-1PEi

By optimizing the following equation, the best thresholds may be selected:4 fth=maxσ2th,0≤thi≤L-1,wherei=1,2,⋯ntandL=256

Kapur’s entropy

Kapur37 presented another nonparametric method for determining the best threshold values. It is based on the image histogram’s probability distribution and entropy. The approach seeks to determine the ideal ’th’ in terms of overall entropy. Entropy is a measure of an image’s separability and compactness between classes. In this view, entropy is maximized when the optimal ‘th’ values correctly separate the classes using Eq. 6.5 fth=max∑kntHk

6 Hk=∑i=thkthk+1-1PEiωklnPEiωk

Smell agent optimization (SAO)

It is through the sense of smell that most people get their first impressions of the world. The majority of living creatures can detect the presence of toxic chemicals in their surroundings utilizing their sense of smell. It’s natural to think about creating SAO with the help of human olfaction. However, as it turned out, olfaction is used by the majority of biological agents for the same main function in the process of hunting, mating, and avoiding danger. This caused a widespread smell agent to be developed as a result of an algorithm for maximizing efficiency38.

Sense of smell (olfaction)

Olfactory nerves, which are located in the nose, are responsible for allowing us to detect the scent of a material. Chemicals with molecular weights smaller than 300 Dalton are present in the smell, which diffuses from a source unevenly. Most agents need to be able to detect and distinguish these scent molecules. Among olfactory-capable agents, the process of olfaction is nearly identical. The ability to follow the scent plume is a crucial part of identifying remote odors. Several creatures, including humans, rely on this skill for survival. A person’s ability to identify potentially dangerous items such as iron tablets, household cleaners, and button batteries is based on their ability to detect the odor.

Steps of the SAO algorithm

The SAO has structured around three unique modes. Using the processes outlined in the previous paragraph, these modes are derived. Detecting odor molecules and determining whether or not to look for the source is the initial phase of operation for the agent. In 2nd mode, the agent uses the 1st mode’s choice to follow the smell molecules in search of the smell’s source. Using the third option prevents the agent from becoming confined within a small area if its trail is lost.

Sniffing mode

Since scent molecules tend to scatter in the direction of the agent, we begin the method by assigning them a randomly generated initial position. Using Eq. 7, we can find the total number of thresholds ‘d’ in the search space given the total number of smell molecules, ‘N’.7 xNd=xmin,d+xmax,d-xmin,d∗rand

To find its optimal position in the search space, the agent uses Eq. 7 to build a position vector. xmax,d and xmin,d are maximum and minimum limits for the decision variable and rand () is a random number between 0 and 1 in case of SAO. A cubic map has been used to initialize the position vector based on Eq. 18 in the case of ChBSAOACS. It is determined that the molecules of odor will diffuse from the source/origin at an initial velocity determined by Eq. 8.8 vNd=vmin,N+vmax,N-vmin,N∗rand()

Each molecule of a smell is a potential solution in the search space that may be used to solve a problem. These potential solutions (smell molecules) may be located using the location vector in Eq. 7 and the velocities of the molecules in Eq. 8. Since the smell molecules disperse in a Brownian fashion, their velocities may be updated using Eq. 12.9 xNdt+1=xNdt+vNdt+1∗▵t

Since it is assumed that the agent optimizes in increments of one step at a time, t is set to 1. For instance, until the last iteration is achieved, the algorithms keep increasing the iteration by 1 until they reach the end of the process. Therefore, the new position of the odor molecules is given by Eq. 10.10 xNdt+1=xNdt+vNdt+1

Each smell molecule evaporates at a different rate, shifting its location in the search space at a rate proportional to its diffusion velocity. Since the molecules of smell travel in a path-dependent way to the agent’s position, Eq. 10.11 vNdt+1=vNdt+v

12 v=r13KTm

In Eq. 12,v denotes the component of the velocity that is updated throughout time. Temperature and mass of smell particles, T and m, respectively; affect molecules’ momentum in the sense of smell. The normalizing constant for the sense of smell is denoted by the sign k. The technique is robust regardless of the starting parameters used for fragrance molecules, including temperature T and mass m. The ideas of mass and temperature (m and T) are derived from the ideal theory of gas. The values of m and T have been empirically determined to be 0.175 and 0.825, respectively, to facilitate efficient use of time. Eq. 10 tests the viability of the rearranged smell molecule’s potential binding areas. This means that we can now find the xbestd agent (best fitness position) and exit sniffing mode.

Trailing mode

When an agent is tasked with locating the source of an unpleasant odor, this mode mimics the actions of the agent. If the agent is searching for a smell source and it detects a new place with a higher concentration of scent molecules than its present position, the agent will move to that location using Eq. 13.13 xNdt+1=xNdt+r2∗olf∗xgbestdt-xNdt-r3∗olf∗xworstdt-xNdt

r2 and r3 are random numbers in the (0,1) range. Relatively speaking, both r2 and r3 penalizes the impact of olf on xgbestdt and xworstdt.

Sniffing mode provides a way for the agent to decide its current position xgbestdt agent and the point with the worst fitness xworstdt. This allows the agent to track the scent’s route more effectively. The relationship between exploration and exploitation in the algorithm is seen in Eq. 13. Olfaction ability is largely influenced by the size of one’s olfactory lobes, as well as one’s psychological and physical state, therefore the value of olf should be carefully chosen. Local searches benefit from low values of olf, while global searches benefit from high values of olf, since the former shows more strength in SAO’s ability to detect scents on a global search.

Random mode

Due to the discrete nature of smell molecules, their concentrations and intensities can change over time if they are spread out over a vast area relative to the search space. Because of this, trailing becomes more difficult and the scent is lost, making it difficult for an agent to follow. The agent may be unable to continue trailing at this moment, resulting in a local minimum. When this occurs, the agent enters a random mode, as follows:14 xNdt+1=xNdt+r4∗SL

Random number r4 penalizes the value of SL by stochastically increasing the steplength of SL. If the agent loses its trail or the trailing mode is unable to get the greatest fitness or identify the smell source, the agent will take a random step using Eq. 14.

This means that the agent will constantly want to stay where the scent molecules are most concentrated throughout the route. The agent uses its knowledge of its present position, xgbestdt agent, and its worst positions, xworstdt agent, throughout the trailing process described in Eq. 14. Although the agent can only look in the feasible region because of the optimization problem. In the flowchart shown in Figure 1, ChBSAOACS’s comprehensive implementation is explained.Fig. 1 Implementation flowchart for ChBSAOACS algorithm.

The proposed ChBSAOACS

In this section, an improved version of the SAO algorithm is proposed, and the one-dimensional cubic map is introduced in SAO initialization and an adaptive (non-linear) parameter control strategy is also performed.

Chaotic Map

Chaos occurs frequently in nonlinear systems. The formula for the fundamental cubic map39 is as follows:15 Zn+1=∝Zn3-βZn

When the chaos factors, denoted by α and β, β in the range [2.3,3], the cubic map is chaotic. The interval of the cubic map is (− 2, 2) for α = 1, while the interval of the series is (− 1, 1) for α = 4. The cubic map is also possible as:16 Zn+1=ρZn(1-Zn2)

Where the ρ denotes a tunable variable. In Eq. 18, the cubic map sequence is in (0, 1), and the ergodicity of the produced chaotic variable Znimproves when ρ = 2.595.

During the search phase, the chaotic map can arbitrarily disperse the population of olfactory agents throughout the interval [0, 1]. In the proposed technique, the agents’ positions are first determined using a cubic map, with z (0) set to 0.315 to guarantee that the initialized interval lies within the range (0, 1).

Concept of bidirectional search

The bidirectional adjustment can enhance the algorithms’ searching performance by enabling the parameters to conduct local searches in both forward and backward directions given in Eq. 17.17 if[f(x+SL)<f(x)]→x=x+SLelse[f(x-SL)<f(x)]→x=x-SLelsenochangeinthepresentposition

Where x, f(x) and S represents the current position of butterfly, objective fitness function value and step length respectively.

Adaptive control strategy

From Eq. 13, we may deduce that the olf contributes significantly to ChBSAOACS’s optimal solution finding performance. The value of olf should be carefully chosen since olfactory capability is mostly determined by olfactory lobe size, agent psychology and health40. So, whereas a low value of olf suggests weak olfaction, which favors local searching, a high value of olf shows greater olfaction, which prefers global searching of SAO. However, in standard SAO, olf = 0.75, and setting a to a constant does not allow for a good compromise between global and local search. As a result, we suggest the following method of adaptive parameter control:18 olft=olfmin-olfmax-olfmin.sinπμtmaxit2

Parameter olf has the initial value and final value, μ tuning parameter, and maxit is maximum number of iterations. The parameters used in this study were μ=2 maxit = 200/800, olfmin=0.1 andolfmax=0.9. It’s important to remember that as the parameter gets bigger, the improvement technique starts to backfire.

Performance evaluation of ChBSAOACS

To demonstrate the effectiveness of the proposed ChBSAOACS in locating the global solution, it is applied to a large number of complicated test functions; sample test results for unimodal and multimodal functions from CEC14 and CEC17 are shown in Table 1. High Conditioned Elliptic, Discuss, Rosen Brocks, Weierstrass, Griewanks, Rastrigins’, Zakharov, Happy Cat, Ackley’s, power Functions, etc. pass the CEC14 tests, as do the planned ChBSAOACS. The performance of the SAO, DA, KH, GA, and PSO algorithms are compared with the test results. Table 1 displays the findings, which demonstrate that the ChBSAOACS performed better than the other algorithms in determining the global best fitness values for the designated test functions. Figure 2 depicts the plots of convergence for a few chosen functions. As can be seen in Figure 2, ChBSAOACS has outperformed the other algorithms when it comes to finding the optimum global fitness values.Table 1 Performance evaluation of optimization algorithms over benchmark functions.

S.No.	Function representation	Function name	Model	Fitness value	
ChBSAOACS	SAO	DA	KH	GA	PSO	
1	f(1)	Bent Cigar	Modal	6.7341e−196	2.2006e−122	1.3347e−111	0	4.4396e−49	23273.2699	
2	f(2)	Power	3.04001e−206	4.6067e−197	5.8194e−134	6.6962e−103	2.6673e−61	5.1821e−06	
3	f(3)	Zakharov	6.7151e−196	2.7244e−130	3.951e−104	6.0692e−185	1.8146e−53	5.1821e−06	
4	f(4)	Rosenbrock	21.6076	20.2603	0.0050841	24.422	20.9486	0.563	
5	f(5)	Discus	8.1886e−205	3.0416e−129	1.7516e−105	5.7894e−92	2.9457e−50	191.3907	
6	f(6)	High Conditioned Elliptic	6.30653e−110	5.5166e−123	1.456e−99	1.2416e−254	9.5065e−50	3449.572	
7	f(7)	Expanded Schaffer	Multi-modal	0	0	0	0	0	10.2602	
8	f(8)	Levy Function	0.180851	8.6041e−07	3.5237e−06	2.9488e−08	0.44764	11.7971	
9	f(9)	Modified Schwef	0.00038183	0.00038183	0.00038183	0.00038183	0.00038183	0.00047019	
10	f(10)	Ackley	8.8818e−16	8.8818e−16	8.8818e−16	8.8818e−16	8.8818e−16	0.028317	
11	f(11)	Weierstrass	5.6843e−14	1.4921e−13	7.1054e−15	0	5.6843e−14	36.5718	
12	f(12)	HappyCat	0.23935	0.38269	0.043666	0.65567	0.74106	1.4096	

Fig. 2 Convergence characteristics of selected test functions from CEC14 and CEC17.

Experimental evaluation and discussion

In order to compare the performance of several optimization techniques for multi-level image thresholding, a standard collection of breast thermogram images has been employed. The initial step in solving any optimization issue is to set the parameters of the method to be used. Prior to execution the SAO and ChBSAOACS algorithms, values are assigned based on a sensitivity study of the parameters (parameter tuning), as indicated in Table 2. Energy curve-based Otsu and Kapur techniques are used to evaluate the performance of ChBSAOACS using a collection of eight widely used breast thermogram images from literature. Figure 3 gives information about the test images under consideration and their corresponding histogram and energy curve. The outcomes are compared and analyzed with other methods based on Dragonfly Algorithm (DA), Kill Herd Algorithm (KHA), Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) algorithms24,25,41 from the literature.Table 2 Algorithm parameters and assigned values.

Algorithm	Parameter	Description	Value assigned	
ChBSAOACS	Olf	Olfaction Capacity	Max = 0.9, Min = 0.1	
SL	Step length	0.9	
m	Mass	0.175	
T	Temperature	0.825	
DA	s	Separation	0.1	
a	Alignment	0.1	
c	Cohesion	0.7	
f	Food factor	1	
e	Enemy factor	1	
w 	Adaptive weight	0.9 to 0.2	
KH	C_flag	Crossover flag	1	
GA	CR	Crossover rate	0.75	
M	Mutation rate	0.05	
E	Elitism rate	0.10	
PSO	C1,C2	Cognitive parameters	2	
r1,r2	Random numbers	[0,1]	
W 	Inertia weight	0.9 to 0.1	
Common algorithm parameters		Number of smellmolecules	100	
D	Number of decision variables	Th = 2,3,4 and 5	
Maxit	Maximum number of iterations	200 for Otsu and 800 for Kapur	

Fig. 3 Test images and their corresponding histogram and energy curve.

Results of ChBSAOACS-based algorithms for multilevel image thresholding are evaluated using post-execution evaluations of picture quality such as Root Mean Square Error (RMSE), Peak Signal to Noise Ratio (PSNR), Structural Similarity Index (SSIM)42, Feature Similarity Index (FSIM)and43,44. Wilcoxon’s rank-sum test is a prominent non-parametric statistical analysis method for evaluating the performance of optimization algorithms. Self-written MATLAB algorithms running on an Intel Core i5-10310U2.21 GHz Dual Processor with 8 GB RAM are used in all simulations.Fig. 4 ChBSAOACS implementation results over test10 image using EC-Otsu and EC-Kapur methods.

Fig. 5 ChBSAOACS implementation results over test11 image using EC-Otsu and EC-Kapur methods.

Fig. 6 ChBSAOACS implementation results over test2 image using EC-Otsu and EC-Kapur methods.

Fig. 7 ChBSAOACS implementation results over test3 image using EC-Otsu and EC-Kapur methods.

Fig. 8 ChBSAOACS implementation results over test30 image using EC-Otsu and EC-Kapur methods.

Fig. 9 ChBSAOACS implementation results over test31 image using EC-Otsu and EC-Kapur methods.

Fig. 10 ChBSAOACS implementation results over test4 image using EC-Otsu and EC-Kapur methods.

Fig. 11 ChBSAOACS implementation results over test5 image using EC-Otsu and EC -Kapur methods.

Test 10, test 11, test 2, test 3, test 30, test 31, test 4, and test 5 breast thermogram images45 from EC-Otsu-ChBSAOACS and EC-Kapur-ChBSAOACS are displayed in Figs. 4, 5, 6, 7, 8, 9, 10 and 11. Input image, segmented output images at ideal threshold levels, and corresponding energy curve information for Otsu-ChBSAOACS and Kapur-ChBSAOACS are all provided in each Figure. Images segmented using either method may be easily distinguished from one another. The reason for this is that Otsu’s between-class variance and Kapur’s entropy serve as the basis for two distinct methods. Therefore, it is necessary to rely on picture quality measures to evaluate the results. The optimal threshold values achieved using EC-Otsu-ChBSAOACS are compared in Table 3 with those obtained using other methods, including EC-Otsu-based SAO, DA, KHA, GA, and PSO algorithms41.Table 3 Optimal threshold levels obtained by various optimization algorithms using EC based Otsu method.

Image	Th	ChBSAOACS	SAO	DA	KH	GA	PSO	
test10	2	98,181	98,180	102,184	110,223	102,184	102,184	
3	86,160,190	86,161,188	92,165,192	102,184,186	92,165,192	92,165,192	
4	75,144,177,199	74,145,178,201	89,60,183,203	95,167,193,194	88,160,183,203	89,160,183,203	
5	54,112,158,181,201	54,113,157,184,204	79,145,171,187,206	78,154,179,200,236	78,143,170,186,205	77,142,172,187,205	
test11	2	90,172	91,174	100,182	108,154	100,182	100,182	
3	83,158,190	81,160,189	91,64,194	100,182,249	91,164,194	91,164,193	
4	51,115,164,193	50,114,162,199	89,160,184,209	92,164,193,241	90,161,184,209	90,160,183,208	
5	49,108,151,173,197	49,106,157,170,201	59,122,163,186,210	91,162,188,218,223	62,123,163,185,210	64,122,163,186,208	
test2	2	119,162	117,160	125,169	146,174	125,169	125,169	
3	75,124,165	75,125,166	115,147,181	125,169,211	115,147,181	115,147,181	
4	73,115,145,179	72,114,148,181	113,144,176,206	113,147,183,234	113,144,176,206	113,144,175,207	
5	72,109,129,154,182	72,110,130,169,204	108,129,154,179,207	114,143,176,213,233	107,130,155,179,208	106,129,154,177,205	
test3	2	74,145	72,152	124,68	145,177	124,168	124,168	
3	71,127,167	71,130,171	77,133,173	123,168,215	77,133,173	78,133,173	
4	80,110,142,176	80,112,152,181	74,119,151,180	81,132,172,178	73,119,151,180	73,119,150,180	
5	33,69,108,139,173	42,68,110,162,200	73,114,141,165,184	72,119,147,178,181	69,114,140,164,183	72,113,138,162,183	
test30	2	100,194	100,195	104,197	116,208	104,197	104,197	
3	77,151,198	76,150,196	100,181,210	104,197,209	100,181,210	100,181,210	
4	63,132,180,209	64,138,181,207	91,164,192,217	105,181,211,251	90,163,192,217	91,163,192,217	
5	26,77,146,185,212	30,77,149,186,206	82,151,179,200,221	79,160,188,212,241	81,150,178,199,220	82,152,179,199,220	
test31	2	80,141	81,150	80,145	128,207	80,145	80,145	
3	77,126,164	76,130,164	77,134,176	80,145,158	77,134,176	77,134,176	
4	75,119,149,180	75,120,150,178	75,120,151,181	76,135,176,220	75,120,151,181	72,120,151,180	
5	74,110,131,154,181	74,111,130,154,180	75,120,151,178,207	75,120,151,183,215	77,120,151,178,207	77,120,150,179,209	
test4	2	78,138	77,138	79,142	137,252	79,142	79,142	
3	75,123,161	75,125,160	76,125,165	79,142,180	76,125,165	76,125,165	
4	74,119,150,181	74,119,150,185	75,120,153,183	73,126,166,206	74,120,153,183	74,120,153,182	
5	72,109,131,156,183	72,110,131,156,185	73,110,132,158,184	78,121,155,183,246	70,110,132,159,185	74,111,132,157,182	
test5	2	72,139	70,139	74,144	137,151	74,144	74,144	
3	69,122,162	69,122,162	72,125,167	74,144,168	72,125,167	72,125,167	
4	72,106,118,148	72,106,118,150	71,118,151,185	71,126,168,248	71,118,151,185	69,118,152,185	
5	70,117,134,169,212	70,117,136,170,210	70,112,138,167,202	78,116,148,183,191	73,112,138,167,202	65,111,138,167,201	

Table 4 Optimal threshold levels obtained by various optimization algorithms using EC based Kapur method.

Image	Th	ChBSAOACS	SAO	DA	KH	GA	PSO	
test10	2	162,231	162,230	45,118	46,118	45,118	45,118	
3	65,145,217	65,145,216	4 5,115,152	44,116,151	45,115,152	46,114,152	
4	51,99,140,223	50,100,140,223	45,115,152,205	44,112,152,208	46,115,152,205	47,114,151,205	
5	58,114,150,191,240	58,114,151,192,238	43,79,116,152,205	48,81,116,146,198	43,79,116,152,205	46,79,115,148,203	
test11	2	166,240	166,239	134,210	134,206	134,210	134,210	
3	75,132,217	75,132,218	52,127,206	59,125,210	52,127,206	51,127,206	
4	52,127,192,233	52,127,192,234	37,82,128,206	38,84,126,212	37,82,128,206	37,83,127,206	
5	67,126,164,211,247	68,126,164,211,247	37,82,127,166,212	38,80,121,164,204	37,80,127,166,211	39,81,125,164,210	
test2	2	90,215	90,214	95,196	94,195	95,196	95,196	
3	95,149,233	95,149,232	95,144,196	95,152,195	95,144,196	95,149,196	
4	93,150,201,241	93,152,201,240	53,95,144,196	47,94,154,196	53,95,144,196	52,95,135,197	
5	35,70,150,198,234	35,71,152,200,239	53,95,144,196,239	43,94,126,156,197	54,92,143,196,239	53,91,129,160,199	
test3	2	96,202	96,201	95,197	96,196	95,197	94,197	
3	92,162,235	93,162,134	95,154,196	93,148,199	95,153,197	95,153,196	
4	89,146,198,240	89,147,199,241	61,95,154,196	54,93,156,196	60,95,150,197	46,96,155,196	
5	52,117,161,199,238	52,117,161,201,241	52,95 153 196 241	39,94,130,156,196	44,96,129,158,197	60,92,125,159,200	
test30	2	181,237	180,237	42,133	43,132	42,133	42,133	
3	54,145,225	54,145,225	42,133,197	42,131,202	42,133,197	42,133,198	
4	73,136,181,240	73,136,180,239	42,89,136,198	44,92,135,191	42,89,136,197	40,89,136,201	
5	54,109,157,199,233	54,109,157,199,232	40,85,128,156,202	44,89,118,153,199	41,85,128,156,202	40,80,124,156,208	
test31	2	133,234	133,230	134,195	131,195	134,195	134,195	
3	125,204,244	125,205,242	59,95,195	30,136,195	59,95,195	30,141,195	
4	34,118,175,238	35,118,176,239	59,95,147,195	57,95,154,202	59,95,147,195	61,92,146,195	
5	108,142,195,225,251	109,142,198,220,248	29,59,95,147,195	57,93,133,155,195	29,59,95,147,195	32,62,93,139,195	
test4	2	96,206	96,205	96,196	96,196	96,196	96,196	
3	88,173,232	89,172,230	95,148,196	95,143,199	95,148,196	95,147,196	
4	87,155,205,241	88,154,204,242	61,95,148,196	64,95,137,196	61,95,148,196	60,93,150,195	
5	34,95,160,196,235	35,96,161,195,229	31,61,95,148,196	27,63,94,161,201	30,61,95,148,196	64,95,131,158,199	
test5	2	145,236	146,235	95,196	95,195	95,196	95,196	
3	73,132,171	74,132,172	58,94,196	61,91,196	58,94,196	57,94,198	
4	75,134,196,241	75,134,196,239	58,94,146,196	59,94,136,197	58,94,146,196	57,94,137,197	
5	71,121,146,170,208	71,123,145,172,212	58,94,146,196,240	62,93,118,159,203	58,94,125,159,196	56,90,128,159,195	

Table 4 presents the comparison of optimal threshold values obtained byEC-Kapur-ChBSAOACS with various existing approaches such as EC-Kapur-based DA, KHA, GA and PSO algorithms24,25,41. To our knowledge, no algorithms have produced the same set of solutions for the matching image as shown in Tables 3 and 4 for a given value of ’th’. Therefore, it is clear that different optimization algorithms use different evolutionary processes to arrive at the optimal solution. The PSNR values for all images at each threshold setting are compared across several Otsu and Kapur-based methods in Table 5. When compared to other current methods, the PSNR values produced using the EC-Otsu-ChBSAOACS and EC-Kapur-ChBSAOACS procedures are consistently superior (see Table 6). The quality of the segmented image increases as PSNR rises. The EC-Otsu-PSO method yields the lowest average PSNR value, at 15.91, while the EC-Kapur-ChBSAOACS method yields the highest, at 20.03.Table 5 PSNR values obtained by various optimization algorithms using EC based Otsu and Kapur methods.

Image	Th	Otsu	Kapur	
ChBSAO ACS	SAO	DA	KH	GA	PSO	ChBSAOACS	SAO	DA	KH	GA	PSO	
test10	2	15.156	14.915	14.67	13.5481	14.669	13.187	12.998	12.512	12.2	12.19	11.956	12.2	
3	19.562	19.321	19.076	14.6051	19.0085	16.948	17.61	17.124	16.812	16.784	16.483	16.791	
4	20.656	20.415	20.17	18.0927	20.122	18.351	22.338	21.852	21.54	21.428	21.12	21.477	
5	22.586	22.345	22.1	20.2068	22.034	19.69	26.708	26.222	25.91	25.577	25.377	25.73	
test11	2	15.016	14.775	14.53	14.4225	14.532	13.034	13.398	12.912	12.6	12.576	12.351	12.6	
3	18.236	17.995	17.75	14.6255	17.7293	15.958	18.22	17.734	17.422	17.366	17.082	17.415	
4	19.026	18.785	18.54	17.697	18.5104	17.444	23.048	22.562	22.25	21.96	21.807	22.219	
5	22.016	21.775	21.53	20.1041	21.4719	19.136	27.428	26.942	26.63	26.251	26.6	26.44	
test2	2	10.616	10.375	10.13	8.7132	10.134	9.078	13.088	12.602	12.29	12.276	12.043	12.289	
3	11.783	11.542	11.297	10.0853	11.3151	10.156	18.098	17.612	17.3	17.005	16.955	17.076	
4	12.656	12.415	12.17	11.4805	11.6385	11.644	22.378	21.892	21.58	21.246	21.159	21.355	
5	18.026	17.785	17.54	14.1203	14.8925	16.861	26.519	26.033	25.721	25.223	25.335	25.273	
test3	2	12.593	12.352	12.107	10.287	12.1114	10.918	13.287	12.801	12.489	12.528	12.3	12.476	
3	19.532	19.291	19.046	12.1821	19.0373	17.091	18.168	17.682	17.37	17.116	17.046	17.084	
4	20.999	20.758	20.513	19.1492	20.497	18.389	22.473	21.987	21.675	21.425	21.274	21.442	
5	21.696	21.455	21.21	20.1831	21.1571	19.182	26.637	26.151	25.839	25.431	25.432	25.375	
test30	2	15.626	15.385	15.14	14.4597	15.136	13.585	12.958	12.472	12.16	12.11	11.918	12.16	
3	17.206	16.965	16.72	15.2292	16.6983	15.049	18.088	17.602	17.29	17.199	16.946	17.284	
4	19.846	19.605	19.36	17.0289	19.188	17.418	22.668	22.182	21.87	21.694	21.436	21.826	
5	20.796	20.555	20.31	19.3267	20.2358	18.212	27.158	26.672	26.36	25.978	25.831	26.193	
test31	2	17.126	16.885	16.64	11.5916	16.641	14.938	12.768	12.282	11.97	11.914	11.728	11.959	
3	17.892	17.651	17.406	16.8352	17.3939	15.602	17.498	17.012	16.7	16.554	16.367	16.685	
4	18.826	18.585	18.34	17.3622	18.2651	16.489	21.646	21.16	20.848	20.67	20.616	20.715	
5	18.926	18.685	18.44	18.2791	18.3613	16.822	26.056	25.57	25.258	24.614	24.926	24.627	
test4	2	17.599	17.358	17.113	9.8767	17.116	15.145	13.088	12.602	12.29	12.28	12.043	12.288	
3	19.216	18.975	18.73	17.4631	18.7028	16.911	18.248	17.762	17.45	17.236	17.098	17.328	
4	19.866	19.625	19.38	18.8003	19.2365	17.488	22.688	22.202	21.89	21.534	21.464	21.745	
5	20.726	20.485	20.24	19.4868	20.1937	18.129	26.888	26.402	26.09	25.523	25.65	25.713	
test5	2	17.276	17.035	16.79	9.8326	16.789	15.181	12.538	12.052	11.74	11.728	11.509	11.738	
3	18.776	18.535	18.29	17.1246	18.2185	16.359	17.568	17.082	16.77	16.572	16.441	16.684	
4	19.416	19.175	18.93	18.2989	18.9077	17.175	22.109	21.623	21.311	21.08	21.013	21.113	
5	20.076	19.835	19.59	19.3108	19.4124	17.616	26.718	26.232	25.92	25.306	25.416	25.348	

The suggested Otsu-ChBSAOACS and Kapur-ChBSAOACS methods, as well as other methods, are compared to FSIM values produced by other methods in Table 6. According to common knowledge, an FSIM value near to ‘1’ implies that the input images was segmented effectively with little loss of features in the output image. Average FSIM values range from 0.7188 when using EC-Otsu-PSO to 0.8135 when using EC-Otsu-ChBSAOACS, a significant increase. Table 7 compares the SSIM values found using several methods, including the proposed Otsu-ChBSAOACS and Kapur-ChBSAOACS methods. The SSIM result close to ’1’ implies that the input image was segmented efficiently and structurally comparable to the input image with little loss of information content. Average FSIM values range from 0.6908 for EC-Otsu-PSO to 0.7536 for EC-Otsu-ChBSAOACS, which indicates a significant increase. Based on the quantitative analysis of results for the investigated approaches it is clear that the overall performance of the EC-based thresholding approach using Kapur’s entropy is better than all other approaches for the tested images. However, it appears that image thresholding ability was better with the EC-Otsu approach than the EC-Kapur approach based on qualitative results.Table 6 FSIM values obtained by various optimization algorithms using EC based Otsu and Kapur methods.

Image	Th	Otsu	Kapur	
ChBSAOACS	SAO	DA	KH	GA	PSO	ChBSAOACS	SAO	DA	KH	GA	PSO	
test10	2	0.7539	0.7515	0.7394	0.784	0.7394	0.6653	0.804	0.792	0.768	0.7536	0.768	0.768	
3	0.7977	0.7953	0.7832	0.7448	0.782	0.7009	0.843	0.831	0.807	0.7913	0.8054	0.806	
4	0.8305	0.8281	0.816	0.7774	0.8145	0.7318	0.849	0.837	0.813	0.7973	0.8111	0.8114	
5	0.8575	0.8551	0.843	0.8129	0.842	0.7531	0.842	0.83	0.806	0.7911	0.8042	0.8045	
test11	2	0.8051	0.8027	0.7906	0.814	0.7906	0.7115	0.842	0.83	0.806	0.7889	0.806	0.806	
3	0.8315	0.8291	0.817	0.7912	0.8165	0.7345	0.871	0.859	0.835	0.8185	0.8069	0.8264	
4	0.8395	0.8371	0.825	0.8133	0.8238	0.745	0.872	0.86	0.836	0.8131	0.8353	0.8354	
5	0.8685	0.8661	0.854	0.8314	0.8521	0.7625	0.88	0.868	0.844	0.8193	0.8402	0.8408	
test2	2	0.7045	0.7021	0.69	0.6539	0.69	0.6205	0.671	0.659	0.635	0.6305	0.6346	0.6346	
3	0.7435	0.7411	0.729	0.695	0.7284	0.6556	0.704	0.692	0.668	0.6615	0.6459	0.6464	
4	0.7545	0.7521	0.74	0.7263	0.7394	0.6795	0.7418	0.7298	0.7058	0.6874	0.712	0.7054	
5	0.8175	0.8151	0.803	0.7586	0.785	0.7273	0.778	0.766	0.742	0.719	0.7293	0.738	
test3	2	0.7385	0.7361	0.724	0.7076	0.7234	0.6509	0.736	0.724	0.7	0.6822	0.7	0.6982	
3	0.786	0.7836	0.7715	0.7244	0.7716	0.6944	0.754	0.742	0.718	0.6945	0.7107	0.7117	
4	0.8377	0.8353	0.8232	0.7764	0.8243	0.7397	0.791	0.779	0.755	0.717	0.7455	0.7442	
5	0.8594	0.857	0.8449	0.8171	0.846	0.7633	0.814	0.802	0.778	0.7428	0.7679	0.7736	
test30	2	0.8535	0.8511	0.839	0.8358	0.839	0.7547	0.846	0.834	0.81	0.7941	0.81	0.81	
3	0.8531	0.8507	0.8386	0.84	0.8385	0.7548	0.879	0.867	0.843	0.8267	0.8424	0.8422	
4	0.8685	0.8661	0.854	0.8436	0.8531	0.7713	0.8854	0.8734	0.8494	0.8365	0.8483	0.851	
5	0.8845	0.8821	0.87	0.8587	0.8693	0.7826	0.905	0.893	0.869	0.8449	0.8674	0.8622	
test31	2	0.7915	0.7891	0.777	0.7506	0.777	0.6995	0.7544	0.7424	0.7184	0.704	0.7184	0.7189	
3	0.8055	0.8031	0.791	0.7815	0.7907	0.7119	0.7877	0.7757	0.7517	0.7325	0.7517	0.7511	
4	0.8465	0.8441	0.832	0.7939	0.8312	0.7476	0.802	0.79	0.766	0.7446	0.759	0.7584	
5	0.8535	0.8511	0.839	0.8254	0.8373	0.7592	0.827	0.815	0.791	0.7644	0.7873	0.7818	
test4	2	0.7285	0.7261	0.714	0.6772	0.7135	0.6414	0.654	0.642	0.618	0.6198	0.6157	0.6157	
3	0.7935	0.7911	0.779	0.7246	0.7783	0.7018	0.705	0.693	0.669	0.6551	0.6263	0.6264	
4	0.8305	0.8281	0.816	0.7876	0.815	0.7314	0.761	0.749	0.725	0.6946	0.7275	0.7192	
5	0.8665	0.8641	0.852	0.8121	0.8489	0.7599	0.784	0.772	0.748	0.7277	0.7354	0.7399	
test5	2	0.7495	0.7471	0.735	0.6912	0.735	0.6621	0.6964	0.6844	0.6604	0.65	0.6574	0.6608	
3	0.7985	0.7961	0.784	0.7444	0.7837	0.7047	0.7197	0.7077	0.6837	0.6885	0.6825	0.6939	
4	0.8315	0.8291	0.817	0.7878	0.8157	0.7342	0.769	0.757	0.733	0.7068	0.7076	0.7322	
5	0.8535	0.8511	0.839	0.8166	0.8373	0.7517	0.805	0.793	0.769	0.7469	0.7628	0.7606	

Table 7 SSIM values obtained by various optimization algorithms using EC based Otsu and Kapur methods.

Image	Th	Otsu	Kapur	
ChBSAOACS	SAO	DA	KH	GA	PSO	ChBSAOACS	SAO	DA	KH	GA	PSO	
test10	2	0.7088	0.6868	0.6625	0.721	0.6625	0.6621	0.7781	0.7661	0.734	0.7217	0.7196	0.734	
3	0.7965	0.7745	0.7502	0.6597	0.7482	0.743	0.7931	0.7811	0.749	0.7335	0.7342	0.7472	
4	0.8243	0.8023	0.778	0.7274	0.7756	0.778	0.8441	0.8321	0.8	0.7818	0.7838	0.7941	
5	0.8523	0.8303	0.806	0.7732	0.8041	0.8022	0.8267	0.8147	0.7826	0.7709	0.7671	0.7829	
test11	2	0.7308	0.7088	0.6845	0.73	0.6845	0.6838	0.7881	0.7761	0.744	0.7277	0.729	0.744	
3	0.7913	0.7693	0.745	0.6832	0.7448	0.7442	0.8171	0.8051	0.773	0.7583	0.7274	0.7421	
4	0.8123	0.7903	0.766	0.7405	0.7553	0.7553	0.8141	0.8021	0.77	0.7497	0.7546	0.7693	
5	0.8443	0.8223	0.798	0.7757	0.7969	0.7936	0.8331	0.8211	0.789	0.7684	0.7698	0.7859	
test2	2	0.4023	0.3803	0.356	0.2443	0.356	0.3524	0.8201	0.8081	0.776	0.7608	0.7604	0.776	
3	0.4945	0.4725	0.4482	0.3521	0.4495	0.4477	0.8501	0.8381	0.806	0.7718	0.7716	0.7976	
4	0.6093	0.5873	0.563	0.4592	0.4749	0.4753	0.9061	0.8941	0.862	0.8183	0.8492	0.8545	
5	0.8413	0.8193	0.795	0.5931	0.7539	0.6375	0.9361	0.9241	0.892	0.858	0.8705	0.8812	
test3	2	0.5863	0.5643	0.54	0.4493	0.5391	0.5389	0.7625	0.7505	0.7184	0.7021	0.7046	0.7177	
3	0.8739	0.8519	0.8276	0.5399	0.8274	0.8263	0.7901	0.7781	0.746	0.704	0.7173	0.742	
4	0.9028	0.8808	0.8565	0.8279	0.8566	0.8543	0.8601	0.8481	0.816	0.7663	0.8032	0.8059	
5	0.9163	0.8943	0.87	0.8476	0.8675	0.8672	0.9021	0.8901	0.858	0.8256	0.8388	0.8536	
test30	2	0.6305	0.6085	0.5842	0.588	0.5842	0.5835	0.5851	0.5731	0.541	0.5314	0.5299	0.541	
3	0.6353	0.6133	0.589	0.5813	0.5887	0.5889	0.6661	0.6541	0.622	0.6082	0.6095	0.6219	
4	0.6713	0.6493	0.625	0.5936	0.622	0.6206	0.6744	0.6624	0.6303	0.625	0.6162	0.635	
5	0.6843	0.6623	0.638	0.6242	0.6362	0.6371	0.6891	0.6771	0.645	0.6309	0.63	0.6428	
test31	2	0.6983	0.6763	0.652	0.3776	0.652	0.6513	0.1331	0.1211	0.089	0.087	0.065	0.0737	
3	0.7094	0.6874	0.6631	0.6529	0.6631	0.6614	0.4041	0.3921	0.36	0.3552	0.3459	0.3532	
4	0.7313	0.7093	0.685	0.6603	0.6827	0.6838	0.6891	0.6771	0.645	0.6132	0.6149	0.6054	
5	0.7393	0.7173	0.693	0.6799	0.6851	0.6871	0.7661	0.7541	0.722	0.7281	0.6704	0.7081	
test4	2	0.8053	0.7833	0.759	0.3161	0.7591	0.7407	0.7191	0.7071	0.675	0.6701	0.6596	0.6731	
3	0.8463	0.8243	0.8	0.7648	0.7986	0.7988	0.7442	0.7322	0.7001	0.6841	0.6761	0.713	
4	0.8623	0.8403	0.816	0.7993	0.8133	0.8152	0.8261	0.8141	0.782	0.7354	0.7668	0.7713	
5	0.8783	0.8563	0.832	0.8132	0.8322	0.8303	0.8561	0.8441	0.812	0.7963	0.7873	0.8095	
test5	2	0.7793	0.7573	0.733	0.2639	0.7321	0.7321	0.2891	0.2771	0.245	0.3425	0.0687	0.2103	
3	0.8063	0.7843	0.76	0.7354	0.7583	0.7565	0.7461	0.7341	0.702	0.6848	0.6827	0.6986	
4	0.8223	0.8003	0.776	0.7568	0.7727	0.7732	0.7931	0.7811	0.749	0.72	0.6993	0.7394	
5	0.8293	0.8073	0.783	0.7784	0.7785	0.782	0.8301	0.8181	0.786	0.762	0.7686	0.7833	

Methods of statistical analysis are compared and contrasted using Wilcoxon’s rank-sum test, which takes into account both alternative and null hypotheses. The lack of a substantial difference is represented by the null hypothesis, whereas its presence is shown by the alternative. The alternative hypothesis is accepted if and only if the null hypothesis is rejected at a significant level (P>0.05). Each method has been executed for 30 times to perform the test. Wilcoxon’s rank-sum test results are shown in Table 8 for each technique. In addition, the computing complexity of each approach is evaluated to maintain a level playing field. ChBSAOACS and SAO has an O(t(N D)) computational complexity, where t is the number of iterations, D is the number of variables, and N is the population size of the solutions. There is no difference in computational complexity between GA, PSO, and DA. However, KHA has a worst-case computational complexity of O(t(Nlog(N))) and an average complexity of O(t(N2)). This means that the computational complexity of KHA is worse than those of GA, PSO, DA, and variants of SAO due to the need to sort the solutions in each iteration.Table 8 Wilcoxin’s test.

Image	Th	Otsu	Kapur	
ChBSAOACS versus SAO	ChBSAOACS versus DA	ChBSAOACS versus KH	ChBSAOACS versus GA	ChBSAOACS versus PSO	ChBSAOACS versus SAO	ChBSAOACS versus DA	ChBSAOACS versus KH	ChBSAOACS versus GA	ChBSAOACS versus PSO	
	h		h		h		h		h				h		h		h		h	
test10	2	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	
3	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	
4	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	0.0862	0	<<0.05	1	
5	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	0.0621	0	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	0.0752	0	
test11	2	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	
3	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	0.0621	0	<<0.05	1	<<0.05	1	
4	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	
5	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	0.0772	0	0.0561	0	0.0657	0	<<0.05	1	<<0.05	1	<<0.05	1	
test2	2	<<0.06	0	<<0.07	0	0.0681	0	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	
3	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	0.0721	0	<<0.05	1	<<0.05	1	
4	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	0.0625	0	<<0.05	1	
5	<<0.05	1	<<0.05	1	<<0.05	1	0.0721	0	0.0678	0	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	0.0635	0	
test3	2	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	
3	<<0.05	1	<<0.05	1	0.0824	0	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	
4	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	
5	<<0.05	1	0.0615	0	<<0.05	1	<<0.05	1	0.0921	0	<<0.05	1	<<0.05	1	0.0829	0	<<0.05	1	0.0589	0	
test30	2	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	0.0712	0	<<0.05	1	
3	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	
4	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	
5	<<0.05	1	<<0.05	1	0.0724	0	<<0.05	1	0.0623	0	0.0713	0	0.0713	0	0.0873	0	<<0.05	1	0.0724	0	
test31	2	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	0.635	0	<<0.05	1	
3	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	
4	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	
5	<<0.05	1	<<0.05	1	0.0812	0	<<0.05	1	0.0814	0	<<0.05	1	<<0.05	1	0.0788	0	<<0.05	1	0.0685	0	
test4	2	0.0624	0	0.0714	0	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.061	0	<<0.05	1	0.0698	0	<<0.05	1	
3	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	
4	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	
5	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	0.0624	0	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	0.0961	0	
test5	2	<<0.05	1	<<0.073	0	0.0614	0	<<0.05	1	<<0.05	1	0.0841	0	0.0841	0	<<0.05	1	<<0.05	1	<<0.05	1	
3	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	
4	<<0.05	1	<<0.05	1	<<0.05	1	0.0857	0	<<0.05	1	<<0.05	1	<<0.05	1	0.0633	0	<<0.05	1	<<0.05	1	
5	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	<<0.05	1	0.0952	0	
		38		36		35		38		33		37		36		34		35		33	

With each repetition, the ChBSAOACS algorithm’s adaptive mechanism enhances the convergence speed. It’s also crucial for maintaining a healthy balance between exploration and exploitation so that selection issues don’t generate too many local solutions and so that an accurate estimate of the best solution can be found. Sniffing mode (Gases Brownian Motion), trailing mode and random mode is used to calculate the new position of a molecule in ChBSAOACS. The fitness values are taken into account when the ChBSAOACS algorithm is updated (the fitness value is related to the molecule mass and temperature). Because of the high velocities of molecules, the ChBSAOACS algorithm can scan the search space more quickly than other algorithms. The local search and global search capabilities of the ChBSAOACS algorithm may be better exploited and explored using this approach. As a result, ChBSAOACS outperformed the other algorithms in this research by a wide margin. The average execution time for investigated ChBSAOACS, SAO, DA, KH, GA and PSO optimization algorithms at 5 threshold levels is 31s, 27s, 28s, 26s, 47s and 29s respectively.

However, the ChBSAOACS algorithm presents a novel and potentially powerful approach to optimization, it has certain limitations related to complexity, computational cost, parameter sensitivity, scalability, and dependence on initial conditions. Addressing these limitations through future research directions such as optimizing computational efficiency, developing robust parameter tuning methods, exploring hybrid approaches, and enhancing scalability and robustness can further improve the algorithm’s performance and broaden its applicability.

Conclusions

Breast thermogram image segmentation based on multilevel thresholding was proposed in this article. More image information was retained while using EC-based multi-level thresholding with Otsu and Kapur objective functions. Experiments have shown that the suggested approach is simple and superior to existing segmentation methods in terms of segmenting breast thermogram images. There are a variety of quantitative indicators used to estimate the suggested method’s performance. The likelihood between the original image and the segmented image is reflected in these quality characteristics. Quantitative evidence demonstrates that EC-based thresholding using Kapur’s entropy yields accurate picture segments. Compared to other approaches, the proposed algorithm produces output images with well-delimited parts that may be evaluated qualitatively. The preliminary findings are encouraging and warrant further investigation on image classification, remote sensing, image denoising and enhancement, and other computational difficulties are only some of the many image processing problems that benefit from the EC-Kapur approach. Due to its speed and robustness, the suggested technique can also be used for other types of applications like control system design, wireless sensor networks, feature selection, data mining, clustering, etc. The hybridization of ChBSAOACS with other metaheuristic algorithms can also improve the algorithm’s performance. The method may be used with various local and global search strategies, such as Pareto distribution, Lévy flight random walk, mutation operators, and more.

Acknowledgements

The KSU author acknowledges the funding from Researchers Supporting Project number (RSPD2024R674), King Saud University, Riyadh, Saudi Arabia.

Author contributions

All the authors have contributed equally to this article.

Data availibility

The images used in the study are publicly available in DMR—Database For Mastology Research https://visual.ic.uff.br/dmi.

Competing interests

The authors declare no competing interests.

Publisher's note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
==== Refs
References

1. How Common Is Breast Cancer? http://www.cancer.org/cancer/breastcancer/detailedguide/breast-cancer-key-statistics (2022).
2. Gautherie, M., Thermopathology, Breast, Vivo & Flow, B. Thermal Chara (1980).
3. Lee H Chen YPP Image based computer aided diagnosis system for cancer detection Expert Syst. Appl. 2015 42 5356 5365 10.1016/j.eswa.2015.02.005
Lee, H. & Chen, Y. P. P. Image based computer aided diagnosis system for cancer detection. Expert Syst. Appl. 42, 5356–5365 (2015).
4. Anbar M Hyperthermia of the cancerous breast: Analysis of mechanism Cancer Lett. 1994 84 90354 90363 10.1016/0304-3835(94)90354-9
Anbar, M. Hyperthermia of the cancerous breast: Analysis of mechanism. Cancer Lett. 84, 90354–90363 (1994).
5. Anbar M Detection of cancerous breasts by dynamic area telethermometry IEEE Eng. Med. Biol. Mag. 2001 20 80 91 10.1109/51.956823 11668900
Anbar, M. Detection of cancerous breasts by dynamic area telethermometry. IEEE Eng. Med. Biol. Mag. 20, 80–91 (2001).11668900
6. Kermani S Samadzadehaghdam N Etehadtavakol M Automatic color segmentation of breast infrared images using a Gaussian mixture model Optik (Stuttg) 2015 126 3288 3294 10.1016/j.ijleo.2015.08.007
Kermani, S., Samadzadehaghdam, N. & Etehadtavakol, M. Automatic color segmentation of breast infrared images using a Gaussian mixture model. Optik (Stuttg) 126, 3288–3294 (2015).
7. Kuhl CK Mammography, breast ultrasound, and magnetic resonance imaging for surveillance of women at high familial risk for breast cancer J. Clin. Oncol. 2005 23 8469 8476 10.1200/JCO.2004.00.4960 16293877
Kuhl, C. K. Mammography, breast ultrasound, and magnetic resonance imaging for surveillance of women at high familial risk for breast cancer. J. Clin. Oncol. 23, 8469–8476 (2005).16293877
8. Kolb TM Lichy J Newhouse JH Comparison of the performance of screening mammography, physical examination, and breast US and evaluation of factors that influence them: an analysis of 27,825 patient evaluations Radiology 2002 225 165 175 10.1148/radiol.2251011667 12355001
Kolb, T. M., Lichy, J. & Newhouse, J. H. Comparison of the performance of screening mammography, physical examination, and breast US and evaluation of factors that influence them: an analysis of 27,825 patient evaluations. Radiology 225, 165–175 (2002).12355001
9. Huynh AMJSDPT The false-negative mammogram Radiographics 1998 18 1137 1154 10.1148/radiographics.18.5.9747612 9747612
Huynh, A. M. J. S. D. P. T. The false-negative mammogram. Radiographics 18, 1137–1154 (1998).9747612
10. Port ER Park A Borgen PI Morris E Montgomery LL Results of MRI screening for breast cancer in high-risk patients with LCIS and atypical hyperplasia Ann Surg Oncol 2007 14 1051 1057 10.1245/s10434-006-9195-5 17206485
Port, E. R., Park, A., Borgen, P. I., Morris, E. & Montgomery, L. L. Results of MRI screening for breast cancer in high-risk patients with LCIS and atypical hyperplasia. Ann Surg Oncol 14, 1051–1057 (2007).17206485
11. Etehadtavakol MNEYK BREAST thermography as a potential non-contact method in the early detection of cancer: a review J Mech Med Biol 2013 13 1330001 1330001 10.1142/S0219519413300019
Etehadtavakol, M. N. E. Y. K. BREAST thermography as a potential non-contact method in the early detection of cancer: a review. J Mech Med Biol 13, 1330001–1330001 (2013).
12. Arakeri MP Reddy GR Computer-aided diagnosis system for tissue characterization of brain tumor on magnetic resonance images Signal Image Video Process 2015 9 409 425 10.1007/s11760-013-0456-z
Arakeri, M. P. & Reddy, G. R. Computer-aided diagnosis system for tissue characterization of brain tumor on magnetic resonance images. Signal Image Video Process 9, 409–425 (2015).
13. Moghbel M Mashohor S A review of computer assisted detection/diagnosis (CAD) in breast thermography for breast cancer detection Artif Intell Rev 2013 39 305 313 10.1007/s10462-011-9274-2
Moghbel, M. & Mashohor, S. A review of computer assisted detection/diagnosis (CAD) in breast thermography for breast cancer detection. Artif Intell Rev 39, 305–313 (2013).
14. Elaziz MA Oliva D Ewees AA Xiong S Multi-level thresholding-based grey scale image segmentation using multi-objective multi-verse optimizer Expert Syst. Appl. 2019 125 112 129 10.1016/j.eswa.2019.01.047
Elaziz, M. A., Oliva, D., Ewees, A. A. & Xiong, S. Multi-level thresholding-based grey scale image segmentation using multi-objective multi-verse optimizer. Expert Syst. Appl. 125, 112–129 (2019).
15. Sathya PD Kayalvizhi R Optimal segmentation of brain MRI based on adaptive bacterial foraging algorithm Neurocomputing 2011 74 2299 2313 10.1016/j.neucom.2011.03.010
Sathya, P. D. & Kayalvizhi, R. Optimal segmentation of brain MRI based on adaptive bacterial foraging algorithm. Neurocomputing 74, 2299–2313 (2011).
16. Joliot M Mazoyer BM Three-dimensional segmentation and interpolation of magnetic resonance brain images IEEE Trans. Med. Imaging 1993 12 269 277 10.1109/42.232255 18218414
Joliot, M. & Mazoyer, B. M. Three-dimensional segmentation and interpolation of magnetic resonance brain images. IEEE Trans. Med. Imaging 12, 269–277 (1993).18218414
17. Johnston B Atkins MS Mackiewich B Anderson M Segmentation of multiple sclerosis lesions in intensity corrected multispectral MRI IEEE Trans. Med. Imaging 1996 15 154 169 10.1109/42.491417 18215898
Johnston, B., Atkins, M. S., Mackiewich, B. & Anderson, M. Segmentation of multiple sclerosis lesions in intensity corrected multispectral MRI. IEEE Trans. Med. Imaging 15, 154–169 (1996).18215898
18. Ng EY Etehadtavakol M Application of Infrared to Biomedical Sciences 2017 Singapore Springer
Ng, E. Y. & Etehadtavakol, M. (eds) Application of Infrared to Biomedical Sciences (Springer, Singapore, 2017).
19. Shehab A Secure and robust fragile watermarking scheme for medical images IEEE Access 2018 6 10269 10278 10.1109/ACCESS.2018.2799240
Shehab, A. Secure and robust fragile watermarking scheme for medical images. IEEE Access 6, 10269–10278 (2018).
20. Scales, N., Kerry, C. & Prize, M. Automated image segmentation for breast analysis using infrared images. In The 26th Annual International Conference of the IEEE Engineering in Medicine and Biology Society 1737–1740 (2004).
21. Houssein EH Abdalkarim N Hussain K Mohamed E Accurate multilevel thresholding image segmentation via oppositional Snake Optimization algorithm: Real cases with liver disease Comput. Biol. Med. 2024 169 107922 10.1016/j.compbiomed.2024.107922 38184861
Houssein, E. H., Abdalkarim, N., Hussain, K. & Mohamed, E. Accurate multilevel thresholding image segmentation via oppositional Snake Optimization algorithm: Real cases with liver disease. Comput. Biol. Med. 169, 107922. 10.1016/j.compbiomed.2024.107922 (2024).38184861
22. Motta, L. S., Conci, A., Lima, R. C. F. & Diniz, E. M. Automatic Segmentation on Thermograms in Order to Aid Diagnosis and 2D Modeling (2010).
23. Manikandan S Ramar K Iruthayarajan MW Srinivasagan KG Multilevel thresholding for segmentation of medical brain images using real coded genetic algorithm Measurement (Lond) 2014 47 558 568 10.1016/j.measurement.2013.09.031
Manikandan, S., Ramar, K., Iruthayarajan, M. W. & Srinivasagan, K. G. Multilevel thresholding for segmentation of medical brain images using real coded genetic algorithm. Measurement (Lond) 47, 558–568 (2014).
24. Kotte S Pullakura RK Injeti SK Optimal multilevel thresholding selection for brain MRI image segmentation based on adaptive wind driven optimization Measurement (Lond) 2018 130 340 361 10.1016/j.measurement.2018.08.007
Kotte, S., Pullakura, R. K. & Injeti, S. K. Optimal multilevel thresholding selection for brain MRI image segmentation based on adaptive wind driven optimization. Measurement (Lond) 130, 340–361 (2018).
25. Sathya PD Kayalvizhi R Amended bacterial foraging algorithm for multilevel thresholding of magnetic resonance brain images Measurement (Lond) 2011 44 1828 1848 10.1016/j.measurement.2011.09.005
Sathya, P. D. & Kayalvizhi, R. Amended bacterial foraging algorithm for multilevel thresholding of magnetic resonance brain images. Measurement (Lond) 44, 1828–1848 (2011).
26. Maitra M Chatterjee A A novel technique for multilevel optimal magnetic resonance brain image thresholding using bacterial foraging Measurement (Lond) 2008 41 1124 1134 10.1016/j.measurement.2008.03.002
Maitra, M. & Chatterjee, A. A novel technique for multilevel optimal magnetic resonance brain image thresholding using bacterial foraging. Measurement (Lond) 41, 1124–1134 (2008).
27. Liu W Huang Y Ye Z Cai W Yang S Cheng X Frank I Renyi’s entropy based multilevel thresholding using a novel meta-heuristics algorithm Appl. Sci. 2020 10 3225 10.3390/app10093225
Liu, W. et al. Renyi’s entropy based multilevel thresholding using a novel meta-heuristics algorithm. Appl. Sci. 10, 3225. 10.3390/app10093225 (2020).
28. Mirjalili S Dragonfly algorithm: A new meta-heuristic optimization technique for solving single-objective, discrete, and multi-objective problems Neural Comput. Appl. 2016 27 1053 1073 10.1007/s00521-015-1920-1
Mirjalili, S. Dragonfly algorithm: A new meta-heuristic optimization technique for solving single-objective, discrete, and multi-objective problems. Neural Comput. Appl. 27, 1053–1073 (2016).
29. Díaz-Cortés MA A multi-level thresholding method for breast thermograms analysis using Dragonfly algorithm Infrared Phys. Technol. 2018 93 346 361 10.1016/j.infrared.2018.08.007
Díaz-Cortés, M. A. A multi-level thresholding method for breast thermograms analysis using Dragonfly algorithm. Infrared Phys. Technol. 93, 346–361 (2018).
30. Oliva D Hinojosa S Elaziz MA Ortega-Sánchez N Context based image segmentation using antlion optimization and sine cosine algorithm Multimed. Tools Appl. 2018 77 25761 25797 10.1007/s11042-018-5815-x
Oliva, D., Hinojosa, S., Elaziz, M. A. & Ortega-Sánchez, N. Context based image segmentation using antlion optimization and sine cosine algorithm. Multimed. Tools Appl. 77, 25761–25797 (2018).
31. Kandhway P Bhandari AK Spatial context-based optimal multilevel energy curve thresholding for image segmentation using soft computing techniques Neural Comput. Appl. 2020 32 8901 8937 10.1007/s00521-019-04381-9
Kandhway, P. & Bhandari, A. K. Spatial context-based optimal multilevel energy curve thresholding for image segmentation using soft computing techniques. Neural Comput. Appl. 32, 8901–8937 (2020).
32. Ghosh S Bruzzone L Patra S Bovolo F Ghosh A A context-sensitive technique for unsupervised change detection based on hopfield-type neural networks IEEE Trans. Geosci. Remote Sens. 2007 45 778 788 10.1109/TGRS.2006.888861
Ghosh, S., Bruzzone, L., Patra, S., Bovolo, F. & Ghosh, A. A context-sensitive technique for unsupervised change detection based on hopfield-type neural networks. IEEE Trans. Geosci. Remote Sens. 45, 778–788 (2007).
33. Patra S Gautam R Singla A A novel context sensitive multilevel thresholding for image segmentation Appl. Soft Comput. J. 2014 23 122 127 10.1016/j.asoc.2014.06.016
Patra, S., Gautam, R. & Singla, A. A novel context sensitive multilevel thresholding for image segmentation. Appl. Soft Comput. J. 23, 122–127 (2014).
34. Li J Tang W Wang J Zhang X Multilevel thresholding selection based on variational mode decomposition for image segmentation Signal Process. 2018 147 80 91 10.1016/j.sigpro.2018.01.022
Li, J., Tang, W., Wang, J. & Zhang, X. Multilevel thresholding selection based on variational mode decomposition for image segmentation. Signal Process. 147, 80–91 (2018).
35. Kandhway P Bhandari AK Spatial context-based optimal multilevel energy curve thresholding for image segmentation using soft computing techniques Neural Comput. Appl. 2020 32 8901 8937 10.1007/s00521-019-04381-9
Kandhway, P. & Bhandari, A. K. Spatial context-based optimal multilevel energy curve thresholding for image segmentation using soft computing techniques. Neural Comput. Appl. 32, 8901–8937 (2020).
36. Otsu, N. A threshold selection method from gray-level histograms. IEEE Trans. Syst. Man Cybern. 9, 62–66 (1979).
37. Kapur JN Sahoo PK Wong AK A new method for gray-level picture thresholding using the entropy of the histogram Comput. Vis. Graph. Image Process. 1985 29 273 285 10.1016/0734-189X(85)90125-2
Kapur, J. N., Sahoo, P. K. & Wong, A. K. A new method for gray-level picture thresholding using the entropy of the histogram. Comput. Vis. Graph. Image Process. 29, 273–285 (1985).
38. Salawudeen AT Mu’azu MB Sha’aban YA Adedokun AE A novel Smell Agent Optimization (SAO): An extensive CEC study and engineering application Knowl. Based Syst. 2021 232 107486 10.1016/j.knosys.2021.107486
Salawudeen, A. T., Mu’azu, M. B., Sha’aban, Y. A. & Adedokun, A. E. A novel Smell Agent Optimization (SAO): An extensive CEC study and engineering application. Knowl. Based Syst. 232, 107486 (2021).
39. Palacios A Cycling chaos in one-dimensional coupled iterated maps Int. J. Bifurc. Chaos 2002 12 1859 1868 10.1142/S0218127402005492
Palacios, A. Cycling chaos in one-dimensional coupled iterated maps. Int. J. Bifurc. Chaos 12, 1859–1868 (2002).
40. Rottstaedt F Size matters—The olfactory bulb as a marker for depression J. Affect. Disord. 2018 229 193 198 10.1016/j.jad.2017.12.047 29324366
Rottstaedt, F. Size matters—The olfactory bulb as a marker for depression. J. Affect. Disord. 229, 193–198 (2018).29324366
41. Díaz-Cortés MA A multi-level thresholding method for breast thermograms analysis using Dragonfly algorithm Infrared Phys. Technol. 2018 93 346 361 10.1016/j.infrared.2018.08.007
Díaz-Cortés, M. A. A multi-level thresholding method for breast thermograms analysis using Dragonfly algorithm. Infrared Phys. Technol. 93, 346–361 (2018).
42. Ren L Gaussian kernel probability-driven slime mould algorithm with new movement mechanism for multi-level image segmentation Measurement (Lond) 2022 192 110884 10.1016/j.measurement.2022.110884
Ren, L. Gaussian kernel probability-driven slime mould algorithm with new movement mechanism for multi-level image segmentation. Measurement (Lond) 192, 110884 (2022).
43. Aziz MA Ewees AA Hassanien AE Whale Optimization Algorithm and Moth-Flame Optimization for multilevel thresholding image segmentation Expert Syst. Appl. 2017 83 242 256 10.1016/j.eswa.2017.04.023
Aziz, M. A., Ewees, A. A. & Hassanien, A. E. Whale Optimization Algorithm and Moth-Flame Optimization for multilevel thresholding image segmentation. Expert Syst. Appl. 83, 242–256 (2017).
44. Sowjanya K Injeti SK Investigation of butterfly optimization and gases Brownian motion optimization algorithms for optimal multilevel image thresholding Expert Syst. Appl. 2021 182 115286 10.1016/j.eswa.2021.115286
Sowjanya, K. & Injeti, S. K. Investigation of butterfly optimization and gases Brownian motion optimization algorithms for optimal multilevel image thresholding. Expert Syst. Appl. 182, 115286 (2021).
45. DMR—Database For Mastology Research. https://visual.ic.uff.br/dmi .
