An Enhanced RIME Optimizer with Horizontal and Vertical Crossover for Discriminating Microseismic and Blasting Signals in Deep Mines.

Real-time monitoring of rock stability during the mining process is critical. This paper first proposed a RIME algorithm (CCRIME) based on vertical and horizontal crossover search strategies to improve the quality of the solutions obtained by the RIME algorithm and further enhance its search capabilities. Then, by constructing a binary version of CCRIME, the key parameters of FKNN were optimized using a binary conversion method. Finally, a discrete CCRIME-based BCCRIME was developed, which uses an S-shaped function transformation approach to address the feature selection issue by converting the search result into a real number that can only be zero or one. The performance of CCRIME was examined in this study from various perspectives, utilizing 30 benchmark functions from IEEE CEC2017. Basic algorithm comparison tests and sophisticated variant algorithm comparison experiments were also carried out. In addition, this paper also used collected microseismic and blasting data for classification prediction to verify the ability of the BCCRIME-FKNN model to process real data. This paper provides new ideas and methods for real-time monitoring of rock mass stability during deep well mineral resource mining.

Boosted crow search algorithm for handling multi-threshold image problems with application to X-ray images of COVID-19.

COVID-19 is pervasive and threatens the safety of people around the world. Therefore, now, a method is needed to diagnose COVID-19 accurately. The identification of COVID-19 by X-ray images is a common method. The target area is extracted from the X-ray images by image segmentation to improve classification efficiency and help doctors make a diagnosis. In this paper, we propose an improved crow search algorithm (CSA) based on variable neighborhood descent (VND) and information exchange mutation (IEM) strategies, called VMCSA. The original CSA quickly falls into the local optimum, and the possibility of finding the best solution is significantly reduced. Therefore, to help the algorithm avoid falling into local optimality and improve the global search capability of the algorithm, we introduce VND and IEM into CSA. Comparative experiments are conducted at CEC2014 and CEC'21 to demonstrate the better performance of the proposed algorithm in optimization. We also apply the proposed algorithm to multi-level thresholding image segmentation using Renyi's entropy as the objective function to find the optimal threshold, where we construct 2-D histograms with grayscale images and non-local mean images and maximize the Renyi's entropy on top of the 2-D histogram. The proposed segmentation method is evaluated on X-ray images of COVID-19 and compared with some algorithms. VMCSA has a significant advantage in segmentation results and obtains better robustness than other algorithms. The available extra info can be found at https://github.com/1234zsw/VMCSA.

Advancing forensic-based investigation incorporating slime mould search for gene selection of high-dimensional genetic data.

Modern medicine has produced large genetic datasets of high dimensions through advanced gene sequencing technology, and processing these data is of great significance for clinical decision-making. Gene selection (GS) is an important data preprocessing technique that aims to select a subset of feature information to improve performance and reduce data dimensionality. This study proposes an improved wrapper GS method based on forensic-based investigation (FBI). The method introduces the search mechanism of the slime mould algorithm in the FBI to improve the original FBI; the newly proposed algorithm is named SMA_FBI; then GS is performed by converting the continuous optimizer to a binary version of the optimizer through a transfer function. In order to verify the superiority of SMA_FBI, experiments are first executed on the 30-function test set of CEC2017 and compared with 10 original algorithms and 10 state-of-the-art algorithms. The experimental results show that SMA_FBI is better than other algorithms in terms of finding the optimal solution, convergence speed, and robustness. In addition, BSMA_FBI (binary version of SMA_FBI) is compared with 8 binary algorithms on 18 high-dimensional genetic data from the UCI repository. The results indicate that BSMA_FBI is able to obtain high classification accuracy with fewer features selected in GS applications. Therefore, SMA_FBI is considered an optimization tool with great potential for dealing with global optimization problems, and its binary version, BSMA_FBI, can be used for GS tasks.

Kernel extreme learning with harmonized bat algorithm for prediction of pyrene toxicity in rats.

Polycyclic aromatic hydrocarbons (PAHs) are organic pollutants and manufactured substances conferring toxicity to human health. The present study investigated whether pyrene, a type of PAH, harms rats. Our research provides an effective feature selection strategy for the animal dataset from Wenzhou Medical University's Experimental Animal Center to thoroughly examine the impacts of PAH toxicity on rat features. Initially, we devised a high-performance optimization method (SCBA) and added the Sobol sequence, vertical crossover and horizontal crossover mechanisms to the bat algorithm (BA). The SCBA-KELM model, which combines SCBA with the kernel extreme learning machine model (KELM), has excellent accuracy and high stability for selecting features. Benchmark function tests are then used in this research to verify the overall optimization performance of SCBA. In this paper, the feature selection performance of SCBA-KELM is verified using various comparative experiments. According to the results, the features of the genes PXR, CAR, CYP2B1/2 and CYP1A1/2 have the most impact on rats. The SCBA-KELM model's classification performance for the gene dataset was 100%, and the model's precision value for the public dataset was around 96%, as determined by the classification index. In conclusion, the model utilized in this research is anticipated to be a reliable and valuable approach for toxicological classification and assessment.

Improved Latin hypercube sampling initialization-based whale optimization algorithm for COVID-19 X-ray multi-threshold image segmentation.

Image segmentation techniques play a vital role in aiding COVID-19 diagnosis. Multi-threshold image segmentation methods are favored for their computational simplicity and operational efficiency. Existing threshold selection techniques in multi-threshold image segmentation, such as Kapur based on exhaustive enumeration, often hamper efficiency and accuracy. The whale optimization algorithm (WOA) has shown promise in addressing this challenge, but issues persist, including poor stability, low efficiency, and accuracy in COVID-19 threshold image segmentation. To tackle these issues, we introduce a Latin hypercube sampling initialization-based multi-strategy enhanced WOA (CAGWOA). It incorporates a COS sampling initialization strategy (COSI), an adaptive global search approach (GS), and an all-dimensional neighborhood mechanism (ADN). COSI leverages probability density functions created from Latin hypercube sampling, ensuring even solution space coverage to improve the stability of the segmentation model. GS widens the exploration scope to combat stagnation during iterations and improve segmentation efficiency. ADN refines convergence accuracy around optimal individuals to improve segmentation accuracy. CAGWOA's performance is validated through experiments on various benchmark function test sets. Furthermore, we apply CAGWOA alongside similar methods in a multi-threshold image segmentation model for comparative experiments on lung X-ray images of infected patients. The results demonstrate CAGWOA's superiority, including better image detail preservation, clear segmentation boundaries, and adaptability across different threshold levels.

Enhanced differential evolution algorithm for feature selection in tuberculous pleural effusion clinical characteristics analysis.

Tuberculous pleural effusion poses a significant threat to human health due to its potential for severe disease and mortality. Without timely treatment, it may lead to fatal consequences. Therefore, early identification and prompt treatment are crucial for preventing problems such as chronic lung disease, respiratory failure, and death. This study proposes an enhanced differential evolution algorithm based on colony predation and dispersed foraging strategies. A series of experiments conducted on the IEEE CEC 2017 competition dataset validated the global optimization capability of the method. Additionally, a binary version of the algorithm is introduced to assess the algorithm's ability to address feature selection problems. Comprehensive comparisons of the effectiveness of the proposed algorithm with 8 similar algorithms were conducted using public datasets with feature sizes ranging from 10 to 10,000. Experimental results demonstrate that the proposed method is an effective feature selection approach. Furthermore, a predictive model for tuberculous pleural effusion is established by integrating the proposed algorithm with support vector machines. The performance of the proposed model is validated using clinical records collected from 140 tuberculous pleural effusion patients, totaling 10,780 instances. Experimental results indicate that the proposed model can identify key correlated indicators such as pleural effusion adenosine deaminase, temperature, white blood cell count, and pleural effusion color, aiding in the clinical feature analysis of tuberculous pleural effusion and providing early warning for its treatment and prediction.

Environment random interaction of rime optimization with Nelder-Mead simplex for parameter estimation of photovoltaic models.

As countries attach importance to environmental protection, clean energy has become a hot topic. Among them, solar energy, as one of the efficient and easily accessible clean energy sources, has received widespread attention. An essential component in converting solar energy into electricity are solar cells. However, a major optimization difficulty remains in precisely and effectively calculating the parameters of photovoltaic (PV) models. In this regard, this study introduces an improved rime optimization algorithm (RIME), namely ERINMRIME, which integrates the Nelder-Mead simplex (NMs) with the environment random interaction (ERI) strategy. In the later phases of ERINMRIME, the ERI strategy serves as a complementary mechanism for augmenting the solution space exploration ability of the agent. By facilitating external interactions, this method improves the algorithm's efficacy in conducting a global search by keeping it from becoming stuck in local optima. Moreover, by incorporating NMs, ERINMRIME enhances its ability to do local searches, leading to improved space exploration. To evaluate ERINMRIME's optimization performance on PV models, this study conducted experiments on four different models: the single diode model (SDM), the double diode model (DDM), the three-diode model (TDM), and the photovoltaic (PV) module model. The experimental results show that ERINMRIME reduces root mean square error for SDM, DDM, TDM, and PV module models by 46.23%, 59.32%, 61.49%, and 23.95%, respectively, compared with the original RIME. Furthermore, this study compared ERINMRIME with nine improved classical algorithms. The results show that ERINMRIME is a remarkable competitor. Ultimately, this study evaluated the performance of ERINMRIME across three distinct commercial PV models, while considering varying irradiation and temperature conditions. The performance of ERINMRIME is superior to existing similar algorithms in different irradiation and temperature conditions. Therefore, ERINMRIME is an algorithm with great potential in identifying and recognizing unknown parameters of PV models.

Parrot optimizer: Algorithm and applications to medical problems.

Stochastic optimization methods have gained significant prominence as effective techniques in contemporary research, addressing complex optimization challenges efficiently. This paper introduces the Parrot Optimizer (PO), an efficient optimization method inspired by key behaviors observed in trained Pyrrhura Molinae parrots. The study features qualitative analysis and comprehensive experiments to showcase the distinct characteristics of the Parrot Optimizer in handling various optimization problems. Performance evaluation involves benchmarking the proposed PO on 35 functions, encompassing classical cases and problems from the IEEE CEC 2022 test sets, and comparing it with eight popular algorithms. The results vividly highlight the competitive advantages of the PO in terms of its exploratory and exploitative traits. Furthermore, parameter sensitivity experiments explore the adaptability of the proposed PO under varying configurations. The developed PO demonstrates effectiveness and superiority when applied to engineering design problems. To further extend the assessment to real-world applications, we included the application of PO to disease diagnosis and medical image segmentation problems, which are highly relevant and significant in the medical field. In conclusion, the findings substantiate that the PO is a promising and competitive algorithm, surpassing some existing algorithms in the literature. The supplementary files and open source codes of the proposed Parrot Optimizer (PO) is available at https://aliasgharheidari.com/PO.html and https://github.com/junbolian/PO.

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.

An enhanced deep deterministic policy gradient algorithm for intelligent control of robotic arms.

Aiming at the poor robustness and adaptability of traditional control methods for different situations, the deep deterministic policy gradient (DDPG) algorithm is improved by designing a hybrid function that includes different rewards superimposed on each other. In addition, the experience replay mechanism of DDPG is also improved by combining priority sampling and uniform sampling to accelerate the DDPG's convergence. Finally, it is verified in the simulation environment that the improved DDPG algorithm can achieve accurate control of the robot arm motion. The experimental results show that the improved DDPG algorithm can converge in a shorter time, and the average success rate in the robotic arm end-reaching task is as high as 91.27%. Compared with the original DDPG algorithm, it has more robust environmental adaptability.

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.

Hierarchical Harris hawks optimizer for feature selection.

INTRODUCTION: The main feature selection methods include filter, wrapper-based, and embedded methods. Because of its characteristics, the wrapper method must include a swarm intelligence algorithm, and its performance in feature selection is closely related to the algorithm's quality. Therefore, it is essential to choose and design a suitable algorithm to improve the performance of the feature selection method based on the wrapper. Harris hawks optimization (HHO) is a superb optimization approach that has just been introduced. It has a high convergence rate and a powerful global search capability but it has an unsatisfactory optimization effect on high dimensional problems or complex problems. Therefore, we introduced a hierarchy to improve HHO's ability to deal with complex problems and feature selection. OBJECTIVES: To make the algorithm obtain good accuracy with fewer features and run faster in feature selection, we improved HHO and named it EHHO. On 30 UCI datasets, the improved HHO (EHHO) can achieve very high classification accuracy with less running time and fewer features. METHODS: We first conducted extensive experiments on 23 classical benchmark functions and compared EHHO with many state-of-the-art metaheuristic algorithms. Then we transform EHHO into binary EHHO (bEHHO) through the conversion function and verify the algorithm's ability in feature extraction on 30 UCI data sets. RESULTS: Experiments on 23 benchmark functions show that EHHO has better convergence speed and minimum convergence than other peers. At the same time, compared with HHO, EHHO can significantly improve the weakness of HHO in dealing with complex functions. Moreover, on 30 datasets in the UCI repository, the performance of bEHHO is better than other comparative optimization algorithms. CONCLUSION: Compared with the original bHHO, bEHHO can achieve excellent classification accuracy with fewer features and is also better than bHHO in running time.

An Enhanced Hunger Games Search Optimization with Application to Constrained Engineering Optimization Problems.

The Hunger Games Search (HGS) is an innovative optimizer that operates without relying on gradients and utilizes a population-based approach. It draws inspiration from the collaborative foraging activities observed in social animals in their natural habitats. However, despite its notable strengths, HGS is subject to limitations, including inadequate diversity, premature convergence, and susceptibility to local optima. To overcome these challenges, this study introduces two adjusted strategies to enhance the original HGS algorithm. The first adaptive strategy combines the Logarithmic Spiral (LS) technique with Opposition-based Learning (OBL), resulting in the LS-OBL approach. This strategy plays a pivotal role in reducing the search space and maintaining population diversity within HGS, effectively augmenting the algorithm's exploration capabilities. The second adaptive strategy, the dynamic Rosenbrock Method (RM), contributes to HGS by adjusting the search direction and step size. This adjustment enables HGS to escape from suboptimal solutions and enhances its convergence accuracy. Combined, these two strategies form the improved algorithm proposed in this study, referred to as RLHGS. To assess the efficacy of the introduced strategies, specific experiments are designed to evaluate the impact of LS-OBL and RM on enhancing HGS performance. The experimental results unequivocally demonstrate that integrating these two strategies significantly enhances the capabilities of HGS. Furthermore, RLHGS is compared against eight state-of-the-art algorithms using 23 well-established benchmark functions and the CEC2020 test suite. The experimental results consistently indicate that RLHGS outperforms the other algorithms, securing the top rank in both test suites. This compelling evidence substantiates the superior functionality and performance of RLHGS compared to its counterparts. Moreover, RLHGS is applied to address four constrained real-world engineering optimization problems. The final results underscore the effectiveness of RLHGS in tackling such problems, further supporting its value as an efficient optimization method.

Differential evolution-assisted salp swarm algorithm with chaotic structure for real-world problems.

There is a new nature-inspired algorithm called salp swarm algorithm (SSA), due to its simple framework, it has been widely used in many fields. But when handling some complicated optimization problems, especially the multimodal and high-dimensional optimization problems, SSA will probably have difficulties in convergence performance or dropping into the local optimum. To mitigate these problems, this paper presents a chaotic SSA with differential evolution (CDESSA). In the proposed framework, chaotic initialization and differential evolution are introduced to enrich the convergence speed and accuracy of SSA. Chaotic initialization is utilized to produce a better initial population aim at locating a better global optimal. At the same time, differential evolution is used to build up the search capability of each agent and improve the sense of balance of global search and intensification of SSA. These mechanisms collaborate to boost SSA in accelerating convergence activity. Finally, a series of experiments are carried out to test the performance of CDESSA. Firstly, IEEE CEC2014 competition fuctions are adopted to evaluate the ability of CDESSA in working out the real-parameter optimization problems. The proposed CDESSA is adopted to deal with feature selection (FS) problems, then five constrained engineering optimization problems are also adopted to evaluate the property of CDESSA in dealing with real engineering scenarios. Experimental results reveal that the proposed CDESSA method performs significantly better than the original SSA and other compared methods.

From coarse to fine: Two-stage deep residual attention generative adversarial network for repair of iris textures obscured by eyelids and eyelashes.

We propose a two-stage deep residual attention generative adversarial network (TSDRA-GAN) for inpainting iris textures obscured by eyelids. This two-stage generation approach ensures that the semantic and texture information of the generated images is preserved. In the second stage of the fine network, a modified residual block (MRB) is used to further extract features and mitigate the performance degradation caused by the deepening of the network, thus following the concept of using a residual structure as a component of the encoder. In addition, for the skip connection part of this phase, we propose a dual-attention computing connection (DACC) to computationally fuse the features of the encoder and decoder in both directions to achieve more effective information fusion for iris inpainting tasks. Under completely fair and equal experimental conditions, it is shown that the method presented in this paper can effectively restore original iris images and improve recognition accuracy.

Improved Colony Predation Algorithm Optimized Convolutional Neural Networks for Electrocardiogram Signal Classification.

Recently, swarm intelligence algorithms have received much attention because of their flexibility for solving complex problems in the real world. Recently, a new algorithm called the colony predation algorithm (CPA) has been proposed, taking inspiration from the predatory habits of groups in nature. However, CPA suffers from poor exploratory ability and cannot always escape solutions known as local optima. Therefore, to improve the global search capability of CPA, an improved variant (OLCPA) incorporating an orthogonal learning strategy is proposed in this paper. Then, considering the fact that the swarm intelligence algorithm can go beyond the local optimum and find the global optimum solution, a novel OLCPA-CNN model is proposed, which uses the OLCPA algorithm to tune the parameters of the convolutional neural network. To verify the performance of OLCPA, comparison experiments are designed to compare with other traditional metaheuristics and advanced algorithms on IEEE CEC 2017 benchmark functions. The experimental results show that OLCPA ranks first in performance compared to the other algorithms. Additionally, the OLCPA-CNN model achieves high accuracy rates of 97.7% and 97.8% in classifying the MIT-BIH Arrhythmia and European ST-T datasets.

ACSN: Attention capsule sampling network for diagnosing COVID-19 based on chest CT scans.

Automated diagnostic techniques based on computed tomography (CT) scans of the chest for the coronavirus disease (COVID-19) help physicians detect suspected cases rapidly and precisely, which is critical in providing timely medical treatment and preventing the spread of epidemic outbreaks. Existing capsule networks have played a significant role in automatic COVID-19 detection systems based on small datasets. However, extracting key slices is difficult because CT scans typically show many scattered lesion sections. In addition, existing max pooling sampling methods cannot effectively fuse the features from multiple regions. Therefore, in this study, we propose an attention capsule sampling network (ACSN) to detect COVID-19 based on chest CT scans. A key slices enhancement method is used to obtain critical information from a large number of slices by applying attention enhancement to key slices. Then, the lost active and background features are retained by integrating two types of sampling. The results of experiments on an open dataset of 35,000 slices show that the proposed ACSN achieve high performance compared with state-of-the-art models and exhibits 96.3% accuracy, 98.8% sensitivity, 93.8% specificity, and 98.3% area under the receiver operating characteristic curve.

An enhanced ant colony optimizer with Cauchy-Gaussian fusion and novel movement strategy for multi-threshold COVID-19 X-ray image segmentation.

The novel coronavirus pneumonia (COVID-19) is a respiratory disease of great concern in terms of its dissemination and severity, for which X-ray imaging-based diagnosis is one of the effective complementary diagnostic methods. It is essential to be able to separate and identify lesions from their pathology images regardless of the computer-aided diagnosis techniques. Therefore, image segmentation in the pre-processing stage of COVID-19 pathology images would be more helpful for effective analysis. In this paper, to achieve highly effective pre-processing of COVID-19 pathological images by using multi-threshold image segmentation (MIS), an enhanced version of ant colony optimization for continuous domains (MGACO) is first proposed. In MGACO, not only a new move strategy is introduced, but also the Cauchy-Gaussian fusion strategy is incorporated. It has been accelerated in terms of convergence speed and has significantly enhanced its ability to jump out of the local optimum. Furthermore, an MIS method (MGACO-MIS) based on MGACO is developed, where it applies the non-local means, 2D histogram as the basis, and employs 2D Kapur's entropy as the fitness function. To demonstrate the performance of MGACO, we qualitatively analyze it in detail and compare it with other peers on 30 benchmark functions from IEEE CEC2014, which proves that it has a stronger capability of solving problems over the original ant colony optimization for continuous domains. To verify the segmentation effect of MGACO-MIS, we conducted a comparison experiment with eight other similar segmentation methods based on real pathology images of COVID-19 at different threshold levels. The final evaluation and analysis results fully demonstrate that the developed MGACO-MIS is sufficient to obtain high-quality segmentation results in the COVID-19 image segmentation and has stronger adaptability to different threshold levels than other methods. Therefore, it has been well-proven that MGACO is an excellent swarm intelligence optimization algorithm, and MGACO-MIS is also an excellent segmentation method.

An accelerated sine mapping whale optimizer for feature selection.

An improved whale optimization algorithm (SWEWOA) is presented for global optimization issues. Firstly, the sine mapping initialization strategy (SS) is used to generate the population. Secondly, the escape energy (EE) is introduced to balance the exploration and exploitation of WOA. Finally, the wormhole search (WS) strengthens the capacity for exploitation. The hybrid design effectively reinforces the optimization capability of SWEWOA. To prove the effectiveness of the design, SWEWOA is performed in two test sets, CEC 2017 and 2022, respectively. The advantage of SWEWOA is demonstrated in 26 superior comparison algorithms. Then a new feature selection method called BSWEWOA-KELM is developed based on the binary SWEWOA and kernel extreme learning machine (KELM). To verify its performance, 8 high-performance algorithms are selected and experimentally studied in 16 public datasets of different difficulty. The test results demonstrate that SWEWOA performs excellently in selecting the most valuable features for classification problems.

Eres-UNet++: Liver CT image segmentation based on high-efficiency channel attention and Res-UNet+.

Computerized tomography (CT) is of great significance for the localization and diagnosis of liver cancer. Many scholars have recently applied deep learning methods to segment CT images of liver and liver tumors. Unlike natural images, medical image segmentation is usually more challenging due to its nature. Aiming at the problem of blurry boundaries and complex gradients of liver tumor images, a deep supervision network based on the combination of high-efficiency channel attention and Res-UNet++ (ECA residual UNet++) is proposed for liver CT image segmentation, enabling fully automated end-to-end segmentation of the network. In this paper, the UNet++ structure is selected as the baseline. The residual block feature encoder based on context awareness enhances the feature extraction ability and solves the problem of deep network degradation. The introduction of an efficient attention module combines the depth of the feature map with spatial information to alleviate the uneven sample distribution impact; Use DiceLoss to replace the cross-entropy loss function to optimize network parameters. The liver and liver tumor segmentation accuracy on the LITS dataset was 95.8% and 89.3%, respectively. The results show that compared with other algorithms, the method proposed in this paper achieves a good segmentation performance, which has specific reference significance for computer-assisted diagnosis and treatment to attain fine segmentation of liver and liver tumors.