In order to improve the global search ability of biogeography-based optimization(BBO)algorithm in multi-threshold image segmentation,a multi-threshold image segmentation based on improved BBO algorithm is proposed.Whe...In order to improve the global search ability of biogeography-based optimization(BBO)algorithm in multi-threshold image segmentation,a multi-threshold image segmentation based on improved BBO algorithm is proposed.When using BBO algorithm to optimize threshold,firstly,the elitist selection operator is used to retain the optimal set of solutions.Secondly,a migration strategy based on fusion of good solution and pending solution is introduced to reduce premature convergence and invalid migration of traditional migration operations.Thirdly,to reduce the blindness of traditional mutation operations,a mutation operation through binary computation is created.Then,it is applied to the multi-threshold image segmentation of two-dimensional cross entropy.Finally,this method is used to segment the typical image and compared with two-dimensional multi-threshold segmentation based on particle swarm optimization algorithm and the two-dimensional multi-threshold image segmentation based on standard BBO algorithm.The experimental results show that the method has good convergence stability,it can effectively shorten the time of iteration,and the optimization performance is better than the standard BBO algorithm.展开更多
The bat algorithm(BA)is a metaheuristic algorithm for global optimisation that simulates the echolocation behaviour of bats with varying pulse rates of emission and loudness,which can be used to find the globally opti...The bat algorithm(BA)is a metaheuristic algorithm for global optimisation that simulates the echolocation behaviour of bats with varying pulse rates of emission and loudness,which can be used to find the globally optimal solutions for various optimisation problems.Knowing the recent criticises of the originality of equations,the principle of BA is concise and easy to implement,and its mathematical structure can be seen as a hybrid particle swarm with simulated annealing.In this research,the authors focus on the performance optimisation of BA as a solver rather than discussing its originality issues.In terms of operation effect,BA has an acceptable convergence speed.However,due to the low proportion of time used to explore the search space,it is easy to converge prematurely and fall into the local optima.The authors propose an adaptive multi-stage bat algorithm(AMSBA).By tuning the algorithm's focus at three different stages of the search process,AMSBA can achieve a better balance between exploration and exploitation and improve its exploration ability by enhancing its performance in escaping local optima as well as maintaining a certain convergence speed.Therefore,AMSBA can achieve solutions with better quality.A convergence analysis was conducted to demonstrate the global convergence of AMSBA.The authors also perform simulation experiments on 30 benchmark functions from IEEE CEC 2017 as the objective functions and compare AMSBA with some original and improved swarm-based algorithms.The results verify the effectiveness and superiority of AMSBA.AMSBA is also compared with eight representative optimisation algorithms on 10 benchmark functions derived from IEEE CEC 2020,while this experiment is carried out on five different dimensions of the objective functions respectively.A balance and diversity analysis was performed on AMSBA to demonstrate its improvement over the original BA in terms of balance.AMSBA was also applied to the multi-threshold image segmentation of Citrus Macular disease,which is a bacterial infection that causes lesions on citrus trees.The segmentation results were analysed by comparing each comparative algorithm's peak signal-to-noise ratio,structural similarity index and feature similarity index.The results show that the proposed BA-based algorithm has apparent advantages,and it can effectively segment the disease spots from citrus leaves when the segmentation threshold is at a low level.Based on a comprehensive study,the authors think the proposed optimiser has mitigated the main drawbacks of the BA,and it can be utilised as an effective optimisation tool.展开更多
The Tunicate Swarm Algorithm(TSA)inspires by simulating the lives of Tunicates at sea and how food is obtained.This algorithm is easily entrapped to local optimization despite the simplicity and optimal,leading to ear...The Tunicate Swarm Algorithm(TSA)inspires by simulating the lives of Tunicates at sea and how food is obtained.This algorithm is easily entrapped to local optimization despite the simplicity and optimal,leading to early convergence compared to some metaheuristic algorithms.This paper sought to improve this algorithm's performance using mutating operators such as the lévy mutation operator,the Cauchy mutation operator,and the Gaussian mutation operator for global optimization problems.Thus,we introduced a version of this algorithm called the QLGCTSA algorithm.Each of these operators has a different performance,increasing the QLGCTSA algorithm performance at a specific optimization operation stage.This algorithm has been run on benchmark functions,including three different compositions,unimodal(UM),and multimodal(MM)groups and its performance evaluate six large-scale engineering problems.Experimental results show that the QLGCTSA algorithm had outperformed other competing optimization algorithms.展开更多
Multi-threshold image segmentation divides an image into regions with distinct features. However,as the number of thresholds increases,its computational complexity grows exponentially. To address this issue,an improve...Multi-threshold image segmentation divides an image into regions with distinct features. However,as the number of thresholds increases,its computational complexity grows exponentially. To address this issue,an improved transient search optimization(ITSO) algorithm is proposed to overcome the limitations of the original transient search optimization(TSO) algorithm,such as susceptibility to local optima and low convergence accuracy. ITSO enhances the diversity of initial solutions through a dynamic reflection learning strategy based on the Beta distribution,improves exploration capability using a Cauchy inverse cumulative distribution operator,and balances exploration and exploitation through a dynamic perturbation strategy. Tests on CEC2022 demonstrate that ITSO outperforms the dandelion optimizer(DO),tunicate swarm algorithm(TSA), whale optimization algorithm(WOA),golden jackal optimization(GJO),TSO,goose algorithm(GOOSE),and love evolution algorithm(LEA). When applied to image segmentation,ITSO achieves superior performance in terms of Otsu fitness,peak signal-to-noise ratio(PSNR),structural similarity(SSIM),and feature similarity(FSIM),showcasing its strong research value and application potential.展开更多
Multilevel threshold image segmentation divides an image into several regions with distinct characteristics.While effective,its computational complexity increases exponentially with the number of thresholds,highlighti...Multilevel threshold image segmentation divides an image into several regions with distinct characteristics.While effective,its computational complexity increases exponentially with the number of thresholds,highlighting the need for more efficient and stable methods.An improved sparrow search algorithm(ISSA)that combines multiple strategies to address the dependency on the initial population and solution accuracy issues in the basic sparrow search algorithm(SSA)was proposed in this paper.ISSA leverages circle chaotic mapping to enhance population diversity,a tangent flight operator to improve search diversity,and a triangular random walk to perturb the optimal solution,thereby enhancing global search capability and avoiding local optima.Performance evaluations on 16 benchmark functions demonstrate that ISSA surpasses the gray wolf optimizer(GWO),whale optimization algorithm(WOA),rat swarm optimizer(RSO),moth-flame optimization(MFO),and SSA in terms of search speed,accuracy,and robustness.When applied to multilevel threshold image segmentation,ISSA excels in Kapur's maximum entropy,peak signal-to-noise ratio(PSNR),structural similarity(SSIM),and feature similarity(FSIM),highlighting its significant research value and application potential in the field of image segmentation.展开更多
Heart disease prediction is a critical issue in healthcare,where accurate early diagnosis can save lives and reduce healthcare costs.The problem is inherently complex due to the high dimensionality of medical data,irr...Heart disease prediction is a critical issue in healthcare,where accurate early diagnosis can save lives and reduce healthcare costs.The problem is inherently complex due to the high dimensionality of medical data,irrelevant or redundant features,and the variability in risk factors such as age,lifestyle,andmedical history.These challenges often lead to inefficient and less accuratemodels.Traditional predictionmethodologies face limitations in effectively handling large feature sets and optimizing classification performance,which can result in overfitting poor generalization,and high computational cost.This work proposes a novel classification model for heart disease prediction that addresses these challenges by integrating feature selection through a Genetic Algorithm(GA)with an ensemble deep learning approach optimized using the Tunicate Swarm Algorithm(TSA).GA selects the most relevant features,reducing dimensionality and improvingmodel efficiency.Theselected features are then used to train an ensemble of deep learning models,where the TSA optimizes the weight of each model in the ensemble to enhance prediction accuracy.This hybrid approach addresses key challenges in the field,such as high dimensionality,redundant features,and classification performance,by introducing an efficient feature selection mechanism and optimizing the weighting of deep learning models in the ensemble.These enhancements result in a model that achieves superior accuracy,generalization,and efficiency compared to traditional methods.The proposed model demonstrated notable advancements in both prediction accuracy and computational efficiency over traditionalmodels.Specifically,it achieved an accuracy of 97.5%,a sensitivity of 97.2%,and a specificity of 97.8%.Additionally,with a 60-40 data split and 5-fold cross-validation,the model showed a significant reduction in training time(90 s),memory consumption(950 MB),and CPU usage(80%),highlighting its effectiveness in processing large,complex medical datasets for heart disease prediction.展开更多
基金Science and Technology Plan of Gansu Province(No.144NKCA040)
文摘In order to improve the global search ability of biogeography-based optimization(BBO)algorithm in multi-threshold image segmentation,a multi-threshold image segmentation based on improved BBO algorithm is proposed.When using BBO algorithm to optimize threshold,firstly,the elitist selection operator is used to retain the optimal set of solutions.Secondly,a migration strategy based on fusion of good solution and pending solution is introduced to reduce premature convergence and invalid migration of traditional migration operations.Thirdly,to reduce the blindness of traditional mutation operations,a mutation operation through binary computation is created.Then,it is applied to the multi-threshold image segmentation of two-dimensional cross entropy.Finally,this method is used to segment the typical image and compared with two-dimensional multi-threshold segmentation based on particle swarm optimization algorithm and the two-dimensional multi-threshold image segmentation based on standard BBO algorithm.The experimental results show that the method has good convergence stability,it can effectively shorten the time of iteration,and the optimization performance is better than the standard BBO algorithm.
基金BBSRC,Grant/Award Number:RM32G0178B8National Natural Science Foundation of China,Grant/Award Numbers:U19A2061,U1809209,62076185+11 种基金Science and Technology Development Project of Jilin Province,Grant/Award Number:20190301024NYJilin Provincial Industrial Innovation Special Fund Project,Grant/Award Number:2018C039-3MRC,Grant/Award Number:MC_PC_17171Royal Society,Grant/Award Number:RP202G0230BHF,Grant/Award Number:AA/18/3/34220Hope Foundation for Cancer Research,Grant/Award Number:RM60G0680GCRF,Grant/Award Number:P202PF11Sino-UK Industrial Fund,Grant/Award Number:RP202G0289LIAS,Grant/Award Numbers:P202ED10,P202RE969Data Science Enhancement Fund,Grant/Award Number:P202RE237Fight for Sight,Grant/Award Number:24NN201Sino-UK Education Fund,Grant/Award Number:OP202006。
文摘The bat algorithm(BA)is a metaheuristic algorithm for global optimisation that simulates the echolocation behaviour of bats with varying pulse rates of emission and loudness,which can be used to find the globally optimal solutions for various optimisation problems.Knowing the recent criticises of the originality of equations,the principle of BA is concise and easy to implement,and its mathematical structure can be seen as a hybrid particle swarm with simulated annealing.In this research,the authors focus on the performance optimisation of BA as a solver rather than discussing its originality issues.In terms of operation effect,BA has an acceptable convergence speed.However,due to the low proportion of time used to explore the search space,it is easy to converge prematurely and fall into the local optima.The authors propose an adaptive multi-stage bat algorithm(AMSBA).By tuning the algorithm's focus at three different stages of the search process,AMSBA can achieve a better balance between exploration and exploitation and improve its exploration ability by enhancing its performance in escaping local optima as well as maintaining a certain convergence speed.Therefore,AMSBA can achieve solutions with better quality.A convergence analysis was conducted to demonstrate the global convergence of AMSBA.The authors also perform simulation experiments on 30 benchmark functions from IEEE CEC 2017 as the objective functions and compare AMSBA with some original and improved swarm-based algorithms.The results verify the effectiveness and superiority of AMSBA.AMSBA is also compared with eight representative optimisation algorithms on 10 benchmark functions derived from IEEE CEC 2020,while this experiment is carried out on five different dimensions of the objective functions respectively.A balance and diversity analysis was performed on AMSBA to demonstrate its improvement over the original BA in terms of balance.AMSBA was also applied to the multi-threshold image segmentation of Citrus Macular disease,which is a bacterial infection that causes lesions on citrus trees.The segmentation results were analysed by comparing each comparative algorithm's peak signal-to-noise ratio,structural similarity index and feature similarity index.The results show that the proposed BA-based algorithm has apparent advantages,and it can effectively segment the disease spots from citrus leaves when the segmentation threshold is at a low level.Based on a comprehensive study,the authors think the proposed optimiser has mitigated the main drawbacks of the BA,and it can be utilised as an effective optimisation tool.
文摘The Tunicate Swarm Algorithm(TSA)inspires by simulating the lives of Tunicates at sea and how food is obtained.This algorithm is easily entrapped to local optimization despite the simplicity and optimal,leading to early convergence compared to some metaheuristic algorithms.This paper sought to improve this algorithm's performance using mutating operators such as the lévy mutation operator,the Cauchy mutation operator,and the Gaussian mutation operator for global optimization problems.Thus,we introduced a version of this algorithm called the QLGCTSA algorithm.Each of these operators has a different performance,increasing the QLGCTSA algorithm performance at a specific optimization operation stage.This algorithm has been run on benchmark functions,including three different compositions,unimodal(UM),and multimodal(MM)groups and its performance evaluate six large-scale engineering problems.Experimental results show that the QLGCTSA algorithm had outperformed other competing optimization algorithms.
基金supported by the National Key Research and Development Program of China (2022ZD0119000)
文摘Multi-threshold image segmentation divides an image into regions with distinct features. However,as the number of thresholds increases,its computational complexity grows exponentially. To address this issue,an improved transient search optimization(ITSO) algorithm is proposed to overcome the limitations of the original transient search optimization(TSO) algorithm,such as susceptibility to local optima and low convergence accuracy. ITSO enhances the diversity of initial solutions through a dynamic reflection learning strategy based on the Beta distribution,improves exploration capability using a Cauchy inverse cumulative distribution operator,and balances exploration and exploitation through a dynamic perturbation strategy. Tests on CEC2022 demonstrate that ITSO outperforms the dandelion optimizer(DO),tunicate swarm algorithm(TSA), whale optimization algorithm(WOA),golden jackal optimization(GJO),TSO,goose algorithm(GOOSE),and love evolution algorithm(LEA). When applied to image segmentation,ITSO achieves superior performance in terms of Otsu fitness,peak signal-to-noise ratio(PSNR),structural similarity(SSIM),and feature similarity(FSIM),showcasing its strong research value and application potential.
基金supported by the National Key R&D Program of China:Science and Technology Innovation 2030(2022ZD0119000)。
文摘Multilevel threshold image segmentation divides an image into several regions with distinct characteristics.While effective,its computational complexity increases exponentially with the number of thresholds,highlighting the need for more efficient and stable methods.An improved sparrow search algorithm(ISSA)that combines multiple strategies to address the dependency on the initial population and solution accuracy issues in the basic sparrow search algorithm(SSA)was proposed in this paper.ISSA leverages circle chaotic mapping to enhance population diversity,a tangent flight operator to improve search diversity,and a triangular random walk to perturb the optimal solution,thereby enhancing global search capability and avoiding local optima.Performance evaluations on 16 benchmark functions demonstrate that ISSA surpasses the gray wolf optimizer(GWO),whale optimization algorithm(WOA),rat swarm optimizer(RSO),moth-flame optimization(MFO),and SSA in terms of search speed,accuracy,and robustness.When applied to multilevel threshold image segmentation,ISSA excels in Kapur's maximum entropy,peak signal-to-noise ratio(PSNR),structural similarity(SSIM),and feature similarity(FSIM),highlighting its significant research value and application potential in the field of image segmentation.
文摘Heart disease prediction is a critical issue in healthcare,where accurate early diagnosis can save lives and reduce healthcare costs.The problem is inherently complex due to the high dimensionality of medical data,irrelevant or redundant features,and the variability in risk factors such as age,lifestyle,andmedical history.These challenges often lead to inefficient and less accuratemodels.Traditional predictionmethodologies face limitations in effectively handling large feature sets and optimizing classification performance,which can result in overfitting poor generalization,and high computational cost.This work proposes a novel classification model for heart disease prediction that addresses these challenges by integrating feature selection through a Genetic Algorithm(GA)with an ensemble deep learning approach optimized using the Tunicate Swarm Algorithm(TSA).GA selects the most relevant features,reducing dimensionality and improvingmodel efficiency.Theselected features are then used to train an ensemble of deep learning models,where the TSA optimizes the weight of each model in the ensemble to enhance prediction accuracy.This hybrid approach addresses key challenges in the field,such as high dimensionality,redundant features,and classification performance,by introducing an efficient feature selection mechanism and optimizing the weighting of deep learning models in the ensemble.These enhancements result in a model that achieves superior accuracy,generalization,and efficiency compared to traditional methods.The proposed model demonstrated notable advancements in both prediction accuracy and computational efficiency over traditionalmodels.Specifically,it achieved an accuracy of 97.5%,a sensitivity of 97.2%,and a specificity of 97.8%.Additionally,with a 60-40 data split and 5-fold cross-validation,the model showed a significant reduction in training time(90 s),memory consumption(950 MB),and CPU usage(80%),highlighting its effectiveness in processing large,complex medical datasets for heart disease prediction.
