Horizontal and vertical search artificial bee colony for image segmentation of COVID-19 X-ray images

IDRM: Brain tumor image segmentation with boosted RIME optimization

Timely diagnosis of medical conditions can significantly mitigate the risks they pose to human life. Consequently, there is an urgent demand for an effective auxiliary model that assists physicians in accurately diagnosing medical conditions based on imaging data. While multi-threshold image segmentation models have garnered considerable attention due to their simplicity and ease of implementation, the selection of threshold combinations greatly influences the segmentation performance. Traditional optimization algorithms often require substantial time to address multi-threshold image segmentation problems, and their segmentation accuracy is frequently unsatisfactory. As a result, metaheuristic algorithms have been employed in this domain. However, several algorithms suffer from drawbacks such as premature convergence and inadequate exploration of the solution space when it comes to threshold selection. For instance, the recently proposed optimization algorithm RIME, inspired by the physical phenomenon of rime-ice, falls short in terms of avoiding local optima and fully exploring the solution space. Therefore, this study introduces an enhanced version of RIME, called IDRM, which incorporates an interactive mechanism and Gaussian diffusion strategy. The interactive mechanism facilitates information exchange among agents, enabling them to evolve towards more promising directions and increasing the likelihood of discovering the optimal solution. Additionally, the Gaussian diffusion strategy enhances the agents' local exploration capabilities and expands their search within the solution space, effectively preventing them from becoming trapped in local optima. Experimental results on 30 benchmark test functions demonstrate that IDRM exhibits favorable optimization performance across various optimization functions, showcasing its robustness and convergence properties. Furthermore, the algorithm is applied to select threshold combinations for brain tumor image segmentation, and the results are evaluated using metrics such as Peak Signal-to-Noise Ratio (PSNR) and Structural Similarity Index Measure (SSIM). The overall findings consistently highlight the exceptional performance of this approach, further validating the effectiveness of IDRM in addressing image segmentation problems.

A convolutional neural network with pixel-wise sparse graph reasoning for COVID-19 lesion segmentation in CT images

The COVID-19 pandemic has extremely threatened human health, and automated algorithms are needed to segment infected regions in the lung using computed tomography (CT). Although several deep convolutional neural networks (DCNNs) have proposed for this purpose, their performance on this task is suppressed due to the limited local receptive field and deficient global reasoning ability. To address these issues, we propose a segmentation network with a novel pixel-wise sparse graph reasoning (PSGR) module for the segmentation of COVID-19 infected regions in CT images. The PSGR module, which is inserted between the encoder and decoder of the network, can improve the modeling of global contextual information. In the PSGR module, a graph is first constructed by projecting each pixel on a node based on the features produced by the encoder. Then, we convert the graph into a sparsely-connected one by keeping K strongest connections to each uncertainly segmented pixel. Finally, the global reasoning is performed on the sparsely-connected graph. Our segmentation network was evaluated on three publicly available datasets and compared with a variety of widely-used segmentation models. Our results demonstrate that (1) the proposed PSGR module can capture the long-range dependencies effectively and (2) the segmentation model equipped with this PSGR module can accurately segment COVID-19 infected regions in CT images and outperform all other competing models.

A self-adaptive quantum equilibrium optimizer with artificial bee colony for feature selection

Feature selection (FS) is a popular data pre-processing technique in machine learning to extract the optimal features to maintain or increase the classification accuracy of the dataset, which is a combinatorial optimization problem, requiring a powerful optimizer to obtain the optimum subset. The equilibrium optimizer (EO) is a recent physical-based metaheuristic algorithm with good performance for various optimization problems, but it may encounter premature or the local convergence in feature selection. This work presents a self-adaptive quantum EO with artificial bee colony for feature selection, named SQEOABC. In the proposed algorithm, the quantum theory and the self-adaptive mechanism are employed into the updating rule of EO to enhance convergence, and the updating mechanism from the artificial bee colony is also incorporated into EO to achieve appropriate FS solutions. In the experiments, 25 benchmark datasets from the UCI repository are investigated to verify SQEOABC, which is compared with several state-of-the-art metaheuristic algorithms and the variants of EO. The statistical results of fitness values and accuracy demonstrate that SQEOABC has better performance than the compared algorithms and the variants of EO. Finally, a real-world FS problem from COVID-19 illustrates the effectiveness and superiority of SQEOABC.

Gaussian bare-bone slime mould algorithm: performance optimization and case studies on truss structures

The slime mould algorithm (SMA) is a new meta-heuristic algorithm recently proposed. The algorithm is inspired by the foraging behavior of polycephalus slime moulds. It simulates the behavior and morphological changes of slime moulds during foraging through adaptive weights. Although the original SMA's performance is better than most swarm intelligence algorithms, it still has shortcomings, such as quickly falling into local optimal values and insufficient exploitation. This paper proposes a Gaussian barebone mutation enhanced SMA (GBSMA) to alleviate the original SMA's shortcomings. First of all, the Gaussian function in the Gaussian barebone accelerates the convergence while also expanding the search space, which improves the algorithm exploration and exploitation capabilities. Secondly, the differential evolution (DE) update strategy in the Gaussian barebone, using rand as the guiding vector. It also enhances the algorithm's global search performance to a certain extent. Also, the greedy selection is introduced on this basis, which prevents individuals from performing invalid position updates. In the IEEE CEC2017 test function, the proposed GBSMA is compared with a variety of meta-heuristic algorithms to verify the performance of GBSMA. Besides, GBSMA is applied to solve truss structure optimization problems. Experimental results show that the convergence speed and solution accuracy of the proposed GBSMA are significantly better than the original SMA and other similar products.

Supplementary Information

The online version contains supplementary material available at 10.1007/s10462-022-10370-7.

Multi-verse Optimizer with Rosenbrock and Diffusion Mechanisms for Multilevel Threshold Image Segmentation from COVID-19 Chest X-Ray Images

Coronavirus Disease 2019 (COVID-19) is the most severe epidemic that is prevalent all over the world. How quickly and accurately identifying COVID-19 is of great significance to controlling the spread speed of the epidemic. Moreover, it is essential to accurately and rapidly identify COVID-19 lesions by analyzing Chest X-ray images. As we all know, image segmentation is a critical stage in image processing and analysis. To achieve better image segmentation results, this paper proposes to improve the multi-verse optimizer algorithm using the Rosenbrock method and diffusion mechanism named RDMVO. Then utilizes RDMVO to calculate the maximum Kapur's entropy for multilevel threshold image segmentation. This image segmentation scheme is called RDMVO-MIS. We ran two sets of experiments to test the performance of RDMVO and RDMVO-MIS. First, RDMVO was compared with other excellent peers on IEEE CEC2017 to test the performance of RDMVO on benchmark functions. Second, the image segmentation experiment was carried out using RDMVO-MIS, and some meta-heuristic algorithms were selected as comparisons. The test image dataset includes Berkeley images and COVID-19 Chest X-ray images. The experimental results verify that RDMVO is highly competitive in benchmark functions and image segmentation experiments compared with other meta-heuristic algorithms.

Human treelike tubular structure segmentation: A comprehensive review and future perspectives

Various structures in human physiology follow a treelike morphology, which often expresses complexity at very fine scales. Examples of such structures are intrathoracic airways, retinal blood vessels, and hepatic blood vessels. Large collections of 2D and 3D images have been made available by medical imaging modalities such as magnetic resonance imaging (MRI), computed tomography (CT), Optical coherence tomography (OCT) and ultrasound in which the spatial arrangement can be observed. Segmentation of these structures in medical imaging is of great importance since the analysis of the structure provides insights into disease diagnosis, treatment planning, and prognosis. Manually labelling extensive data by radiologists is often time-consuming and error-prone. As a result, automated or semi-automated computational models have become a popular research field of medical imaging in the past two decades, and many have been developed to date. In this survey, we aim to provide a comprehensive review of currently publicly available datasets, segmentation algorithms, and evaluation metrics. In addition, current challenges and future research directions are discussed.

A novel minimum generalized cross entropy-based multilevel segmentation technique for the brain MRI/dermoscopic images

BACKGROUND

One of the challenging and the primary stages of medical image examination is the identification of the source of any disease, which may be the aberrant damage or change in tissue or organ caused by infections, injury, and a variety of other factors. Any such condition related to skin or brain sometimes advances in cancer and becomes a life-threatening disease. So, an efficient automatic image segmentation approach is required at the initial stage of medical image analysis.

PURPOSE

To make a segmentation process efficient and reliable, it is essential to use an appropriate objective function and an efficient optimization algorithm to produce optimal results.

METHOD

The above problem is resolved in this paper by introducing a new minimum generalized cross entropy (MGCE) as an objective function, with the inclusion of the degree of divergence. Another key contribution is the development of a new optimizer called opposition African vulture optimization algorithm (OAVOA). The proposed optimizer boosted the exploration, skill by inheriting the opposition-based learning.

THE RESULTS

The experimental work in this study starts with a performance evaluation of the optimizer over a set of standards (23 numbers) and IEEE CEC14 (8 numbers) Benchmark functions. The comparative analysis of test results shows that the OAVOA outperforms different state-of-the-art optimizers. The suggested OAVOA-MGCE based multilevel thresholding approach is carried out on two different types of medical images - Brain MRI Images (AANLIB dataset), and dermoscopic images (ISIC 2016 dataset) and found superior than other entropy-based thresholding methods.

Multi-Strategy Learning Boosted Colony Predation Algorithm for Photovoltaic Model Parameter Identification

Modeling solar systems necessitates the effective identification of unknown and variable photovoltaic parameters. To efficiently convert solar energy into electricity, these parameters must be precise. The research introduces the multi-strategy learning boosted colony predation algorithm (MLCPA) for optimizing photovoltaic parameters and boosting the efficiency of solar power conversion. In MLCPA, opposition-based learning can be used to investigate each individual's opposing position, thereby accelerating convergence and preserving population diversity. Level-based learning categorizes individuals according to their fitness levels and treats them differently, allowing for a more optimal balance between variation and intensity during optimization. On a variety of benchmark functions, the MLCPA's performance is compared to the performance of the best algorithms currently in use. On a variety of benchmark functions, the MLCPA's performance is compared to that of existing methods. MLCPA is then used to estimate the parameters of the single, double, and photovoltaic modules. Last but not least, the stability of the proposed MLCPA algorithm is evaluated on the datasheets of many manufacturers at varying temperatures and irradiance levels. Statistics have demonstrated that the MLCPA is more precise and dependable in predicting photovoltaic mode critical parameters, making it a viable tool for solar system parameter identification issues.

A novel hybrid approach for feature selection enhancement: COVID-19 case study

Feature selection is a promising Artificial Intelligence technique for screening, analysing, predicting, and tracking current COVID-19 patients and likely future patients. Significant applications are developed to track data of confirmed, recovered, and death cases. In this work, we propose a new feature selection method based on a new way of hybridization between filter and wrapper methods. The proposed approach is expected to achieve high classification accuracy with a small feature subset. Specifically, the main contribution of this work is a four steps-based approach organized as follows: First, we remove consecutively duplicate and constant features. Then, we select the highest-ranked feature with Mutual Information. In the last step, we run the 'Backward Feature Elimination' algorithm to delete features from the active subset until a stopping criterion based on the degradation of classification performance is met. We applied the proposed approach to a COVID-19 dataset to test its ability to find the relevant feature for characterizing the disease, such as new cases infected with the virus, people vaccinated, and the number of deaths, to better assess the situation. For evaluation purposes, experiments are conducted at the first stage on the COVID-19 dataset, then on six benchmark datasets that have a high dimensional and large size. The method performance is tracked and measured on these datasets and a comparison with many approaches is provided.

HADCNet: Automatic segmentation of COVID-19 infection based on a hybrid attention dense connected network with dilated convolution

the automatic segmentation of lung infections in CT slices provides a rapid and effective strategy for diagnosing, treating, and assessing COVID-19 cases. However, the segmentation of the infected areas presents several difficulties, including high intraclass variability and interclass similarity among infected areas, as well as blurred edges and low contrast. Therefore, we propose HADCNet, a deep learning framework that segments lung infections based on a dual hybrid attention strategy. HADCNet uses an encoder hybrid attention module to integrate feature information at different scales across the peer hierarchy to refine the feature map. Furthermore, a decoder hybrid attention module uses an improved skip connection to embed the semantic information of higher-level features into lower-level features by integrating multi-scale contextual structures and assigning the spatial information of lower-level features to higher-level features, thereby capturing the contextual dependencies of lesion features across levels and refining the semantic structure, which reduces the semantic gap between feature maps at different levels and improves the model segmentation performance. We conducted fivefold cross-validations of our model on four publicly available datasets, with final mean Dice scores of 0.792, 0.796, 0.785, and 0.723. These results show that the proposed model outperforms popular state-of-the-art semantic segmentation methods and indicate its potential use in the diagnosis and treatment of COVID-19.

Directional mutation and crossover boosted ant colony optimization with application to COVID-19 X-ray image segmentation

This paper focuses on the study of Coronavirus Disease 2019 (COVID-19) X-ray image segmentation technology. We present a new multilevel image segmentation method based on the swarm intelligence algorithm (SIA) to enhance the image segmentation of COVID-19 X-rays. This paper first introduces an improved ant colony optimization algorithm, and later details the directional crossover (DX) and directional mutation (DM) strategy, XMACO. The DX strategy improves the quality of the population search, which enhances the convergence speed of the algorithm. The DM strategy increases the diversity of the population to jump out of the local optima (LO). Furthermore, we design the image segmentation model (MIS-XMACO) by incorporating two-dimensional (2D) histograms, 2D Kapur's entropy, and a nonlocal mean strategy, and we apply this model to COVID-19 X-ray image segmentation. Benchmark function experiments based on the IEEE CEC2014 and IEEE CEC2017 function sets demonstrate that XMACO has a faster convergence speed and higher convergence accuracy than competing models, and it can avoid falling into LO. Other SIAs and image segmentation models were used to ensure the validity of the experiments. The proposed MIS-XMACO model shows more stable and superior segmentation results than other models at different threshold levels by analyzing the experimental results.

SAFNet: A deep spatial attention network with classifier fusion for breast cancer detection

Breast cancer is a top dangerous killer for women. An accurate early diagnosis of breast cancer is the primary step for treatment. A novel breast cancer detection model called SAFNet is proposed based on ultrasound images and deep learning. We employ a pre-trained ResNet-18 embedded with the spatial attention mechanism as the backbone model. Three randomized network models are trained for prediction in the SAFNet, which are fused by majority voting to produce more accurate results. A public ultrasound image dataset is utilized to evaluate the generalization ability of our SAFNet using 5-fold cross-validation. The simulation experiments reveal that the SAFNet can produce higher classification results compared with four existing breast cancer classification methods. Therefore, our SAFNet is an accurate tool to detect breast cancer that can be applied in clinical diagnosis.

Tool for Predicting College Student Career Decisions: An Enhanced Support Vector Machine Framework

The goal of this research is to offer an effective intelligent model for forecasting college students’ career decisions in order to give a useful reference for career decisions and policy formation by relevant departments. The suggested prediction model is mainly based on a support vector machine (SVM) that has been modified using an enhanced butterfly optimization approach with a communication mechanism and Gaussian bare-bones mechanism (CBBOA). To get a better set of parameters and feature subsets, first, we added a communication mechanism to BOA to improve its global search capability and balance exploration and exploitation trends. Then, Gaussian bare-bones was added to increase the population diversity of BOA and its ability to jump out of the local optimum. The optimal SVM model (CBBOA-SVM) was then developed to predict the career decisions of college students based on the obtained parameters and feature subsets that are already optimized by CBBOA. In order to verify the effectiveness of CBBOA, we compared it with some advanced algorithms on all benchmark functions of CEC2014. Simulation results demonstrated that the performance of CBBOA is indeed more comprehensive. Meanwhile, comparisons between CBBOA-SVM and other machine learning approaches for career decision prediction were carried out, and the findings demonstrate that the provided CBBOA-SVM has better classification and more stable performance. As a result, it is plausible to conclude that the CBBOA-SVM is capable of being an effective tool for predicting college student career decisions.

A Hybrid Arithmetic Optimization and Golden Sine Algorithm for Solving Industrial Engineering Design Problems

Arithmetic Optimization Algorithm (AOA) is a physically inspired optimization algorithm that mimics arithmetic operators in mathematical calculation. Although the AOA has an acceptable exploration and exploitation ability, it also has some shortcomings such as low population diversity, premature convergence, and easy stagnation into local optimal solutions. The Golden Sine Algorithm (Gold-SA) has strong local searchability and fewer coefficients. To alleviate the above issues and improve the performance of AOA, in this paper, we present a hybrid AOA with Gold-SA called HAGSA for solving industrial engineering design problems. We divide the whole population into two subgroups and optimize them using AOA and Gold-SA during the searching process. By dividing these two subgroups, we can exchange and share profitable information and utilize their advantages to find a satisfactory global optimal solution. Furthermore, we used the Levy flight and proposed a new strategy called Brownian mutation to enhance the searchability of the hybrid algorithm. To evaluate the efficiency of the proposed work, HAGSA, we selected the CEC 2014 competition test suite as a benchmark function and compared HAGSA against other well-known algorithms. Moreover, five industrial engineering design problems were introduced to verify the ability of algorithms to solve real-world problems. The experimental results demonstrate that the proposed work HAGSA is significantly better than original AOA, Gold-SA, and other compared algorithms in terms of optimization accuracy and convergence speed.

Application of Improved Satin Bowerbird Optimizer in Image Segmentation

Aiming at the problems of low optimization accuracy and slow convergence speed of Satin Bowerbird Optimizer (SBO), an improved Satin Bowerbird Optimizer (ISBO) based on chaotic initialization and Cauchy mutation strategy is proposed. In order to improve the value of the proposed algorithm in engineering and practical applications, we apply it to the segmentation of medical and plant images. To improve the optimization accuracy, convergence speed and pertinence of the initial population, the population is initialized by introducing the Logistic chaotic map. To avoid the algorithm falling into local optimum (prematurity), the search performance of the algorithm is improved through Cauchy mutation strategy. Based on extensive visual and quantitative data analysis, this paper conducts a comparative analysis of the ISBO with the SBO, the fuzzy Gray Wolf Optimizer (FGWO), and the Fuzzy Coyote Optimization Algorithm (FCOA). The results show that the ISBO achieves better segmentation effects in both medical and plant disease images.

An efficient rotational direction heap-based optimization with orthogonal structure for medical diagnosis

The heap-based optimizer (HBO) is an optimization method proposed in recent years that may face local stagnation problems and show slow convergence speed due to the lack of detailed analysis of optimal solutions and a comprehensive search. Therefore, to mitigate these drawbacks and strengthen the performance of the algorithm in the field of medical diagnosis, a new MGOHBO method is proposed by introducing the modified Rosenbrock's rotational direction method (MRM), an operator from the grey wolf optimizer (GWM), and an orthogonal learning strategy (OL). The MGOHBO is compared with eleven famous and improved optimizers on IEEE CEC 2017. The results on benchmark functions indicate that the boosted MGOHBO has several significant advantages in terms of convergence accuracy and speed of the process. Additionally, this article analyzed the diversity and balance of MGOHBO in detail. Finally, the proposed MGOHBO algorithm is utilized to optimize the kernel extreme learning machines (KELM), and a new MGOHBO-KELM is proposed. To validate the performance of MGOHBO-KELM, seven disease diagnostic questions were introduced for testing in this work. In contrast to advanced models such as HBO-KELM and BP, it can be concluded that the MGOHBO-KELM model can achieve optimal results, which also proves that it has practical significance in solving medical diagnosis problems.

Non-Systematic Weighted Satisfiability in Discrete Hopfield Neural Network Using Binary Artificial Bee Colony Optimization

Recently, new variants of non-systematic satisfiability logic were proposed to govern Discrete Hopfield Neural Network. This new variant of satisfiability logical rule will provide flexibility and enhance the diversity of the neuron states in the Discrete Hopfield Neural Network. However, there is no systematic method to control and optimize the logical structure of non-systematic satisfiability. Additionally, the role of negative literals was neglected, reducing the expressivity of the information that the logical structure holds. This study proposed an additional optimization layer of Discrete Hopfield Neural Network called the logic phase that controls the distribution of negative literals in the logical structure. Hence, a new variant of non-systematic satisfiability named Weighted Random 2 Satisfiability was formulated. Thus, a proposed searching technique called the binary Artificial Bee Colony algorithm will ensure the correct distribution of the negative literals. It is worth mentioning that the binary Artificial Bee Colony has flexible and less free parameters where the modifications tackled on the objective function. Specifically, this study utilizes a binary Artificial Bee Colony algorithm by modifying the updating rule equation by using not and (NAND) logic gate operator. The performance of the binary Artificial Bee Colony will be compared with other variants of binary Artificial Bee Colony algorithms of different logic gate operators and conventional binary algorithms such as the Particle Swarm Optimization, Exhaustive Search, and Genetic Algorithm. The experimental results and comparison show that the proposed algorithm is compatible in finding the correct logical structure according to the initiate ratio of negative literal.

Random Replacement Crisscross Butterfly Optimization Algorithm for Standard Evaluation of Overseas Chinese Associations

The butterfly optimization algorithm (BOA) is a swarm intelligence optimization algorithm proposed in 2019 that simulates the foraging behavior of butterflies. Similarly, the BOA itself has certain shortcomings, such as a slow convergence speed and low solution accuracy. To cope with these problems, two strategies are introduced to improve the performance of BOA. One is the random replacement strategy, which involves replacing the position of the current solution with that of the optimal solution and is used to increase the convergence speed. The other is the crisscross search strategy, which is utilized to trade off the capability of exploration and exploitation in BOA to remove local dilemmas whenever possible. In this case, we propose a novel optimizer named the random replacement crisscross butterfly optimization algorithm (RCCBOA). In order to evaluate the performance of RCCBOA, comparative experiments are conducted with another nine advanced algorithms on the IEEE CEC2014 function test set. Furthermore, RCCBOA is combined with support vector machine (SVM) and feature selection (FS)—namely, RCCBOA-SVM-FS—to attain a standardized construction model of overseas Chinese associations. It is found that the reasonableness of bylaws; the regularity of general meetings; and the right to elect, be elected, and vote are of importance to the planning and standardization of Chinese associations. Compared with other machine learning methods, the RCCBOA-SVM-FS model has an up to 95% accuracy when dealing with the normative prediction problem of overseas Chinese associations. Therefore, the constructed model is helpful for guiding the orderly and healthy development of overseas Chinese associations.

Modified Remora Optimization Algorithm for Global Optimization and Multilevel Thresholding Image Segmentation

Image segmentation is a key stage in image processing because it simplifies the representation of the image and facilitates subsequent analysis. The multi-level thresholding image segmentation technique is considered one of the most popular methods because it is efficient and straightforward. Many relative works use meta-heuristic algorithms (MAs) to determine threshold values, but they have issues such as poor convergence accuracy and stagnation into local optimal solutions. Therefore, to alleviate these shortcomings, in this paper, we present a modified remora optimization algorithm (MROA) for global optimization and image segmentation tasks. We used Brownian motion to promote the exploration ability of ROA and provide a greater opportunity to find the optimal solution. Second, lens opposition-based learning is introduced to enhance the ability of search agents to jump out of the local optimal solution. To substantiate the performance of MROA, we first used 23 benchmark functions to evaluate the performance. We compared it with seven well-known algorithms regarding optimization accuracy, convergence speed, and significant difference. Subsequently, we tested the segmentation quality of MORA on eight grayscale images with cross-entropy as the objective function. The experimental metrics include peak signal-to-noise ratio (PSNR), structure similarity (SSIM), and feature similarity (FSIM). A series of experimental results have proved that the MROA has significant advantages among the compared algorithms. Consequently, the proposed MROA is a promising method for global optimization problems and image segmentation.