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 computational accuracy and efficiency of modeling the stress spectrum derived from bridge monitoring data significantly influence the fatigue life assessment of steel bridges.Therefore,determining the optimal stre...The computational accuracy and efficiency of modeling the stress spectrum derived from bridge monitoring data significantly influence the fatigue life assessment of steel bridges.Therefore,determining the optimal stress spectrum model is crucial for further fatigue reliability analysis.This study investigates the performance of the REBMIX algorithm in modeling both univariate(stress range)and multivariate(stress range and mean stress)distributions of the rain-flowmatrix for a steel arch bridge,usingAkaike’s Information Criterion(AIC)as a performance metric.Four types of finitemixture distributions—Normal,Lognormal,Weibull,and Gamma—are employed tomodel the stress range.Additionally,mixed distributions,including Normal-Normal,Lognormal-Normal,Weibull-Normal,and Gamma-Normal,are utilized to model the joint distribution of stress range and mean stress.The REBMIX algorithm estimates the number of components,component weights,and component parameters for each candidate finite mixture distribution.The results demonstrate that the REBMIX algorithm-based mixture parameter estimation approach effectively identifies the optimal distribution based on AIC values.Furthermore,the algorithm exhibits superior computational efficiency compared to traditional methods,making it highly suitable for practical applications.展开更多
To address the issues of low accuracy and high false positive rate in traditional Otsu algorithm for defect detection on infrared images of wind turbine blades(WTB),this paper proposes a technique that combines morpho...To address the issues of low accuracy and high false positive rate in traditional Otsu algorithm for defect detection on infrared images of wind turbine blades(WTB),this paper proposes a technique that combines morphological image enhancement with an improved Otsu algorithm.First,mathematical morphology’s differential multi-scale white and black top-hat operations are applied to enhance the image.The algorithm employs entropy as the objective function to guide the iteration process of image enhancement,selecting appropriate structural element scales to execute differential multi-scale white and black top-hat transformations,effectively enhancing the detail features of defect regions and improving the contrast between defects and background.Afterwards,grayscale inversion is performed on the enhanced infrared defect image to better adapt to the improved Otsu algorithm.Finally,by introducing a parameter K to adjust the calculation of inter-class variance in the Otsu method,the weight of the target pixels is increased.Combined with the adaptive iterative threshold algorithm,the threshold selection process is further fine-tuned.Experimental results show that compared to traditional Otsu algorithms and other improvements,the proposed method has significant advantages in terms of defect detection accuracy and reducing false positive rates.The average defect detection rate approaches 1,and the average Hausdorff distance decreases to 0.825,indicating strong robustness and accuracy of the method.展开更多
Parkinson’s disease is a neurodegenerative disorder that inflicts irreversible damage on humans.Some experimental data regarding Parkinson’s patients are redundant and irrelevant,posing significant challenges for di...Parkinson’s disease is a neurodegenerative disorder that inflicts irreversible damage on humans.Some experimental data regarding Parkinson’s patients are redundant and irrelevant,posing significant challenges for disease detection.Therefore,there is a need to devise an effective method for the selective extraction of disease-specific information,ensuring both accuracy and the utilization of fewer features.In this paper,a Binary Hybrid Artificial Hummingbird and Flower Pollination Algorithm(FPA),called BFAHA,is proposed to solve the problem of Parkinson’s disease diagnosis based on speech signals.First,combining FPA with Artificial Hummingbird Algorithm(AHA)can take advantage of the strong global exploration ability possessed by FPA to improve the disadvantages of AHA,such as premature convergence and easy falling into local optimum.Second,the Hemming distance is used to determine the difference between the other individuals in the population and the optimal individual after each iteration,if the difference is too significant,the cross-mutation strategy in the genetic algorithm(GA)is used to induce the population individuals to keep approaching the optimal individual in the random search process to speed up finding the optimal solution.Finally,an S-shaped function converts the improved algorithm into a binary version to suit the characteristics of the feature selection(FS)tasks.In this paper,10 high-dimensional datasets from UCI and the ASU are used to test the performance of BFAHA and apply it to Parkinson’s disease diagnosis.Compared with other state-of-the-art algorithms,BFAHA shows excellent competitiveness in both the test datasets and the classification problem,indicating that the algorithm proposed in this study has apparent advantages in the field of feature selection.展开更多
Time-frequency-based methods are proven to be effective for parameter estimation of linear frequency modulation （LFM） signals. The smoothed pseudo Winger-Ville distribution （SPWVD） is used for the parameter estima...Time-frequency-based methods are proven to be effective for parameter estimation of linear frequency modulation （LFM） signals. The smoothed pseudo Winger-Ville distribution （SPWVD） is used for the parameter estimation of multi-LFM signals, and a method of the SPWVD binarization by a dynamic threshold based on the Otsu algorithm is proposed. The proposed method is effective in the demand for the estimation of different parameters and the unknown signal-to-noise ratio （SNR） circumstance. The performance of this method is confirmed by numerical simulation.展开更多
In this study,a novel hybrid Water Cycle Moth-Flame Optimization(WCMFO)algorithm is proposed for multilevel thresholding brain image segmentation in Magnetic Resonance(MR)image slices.WCMFO constitutes a hybrid betwee...In this study,a novel hybrid Water Cycle Moth-Flame Optimization(WCMFO)algorithm is proposed for multilevel thresholding brain image segmentation in Magnetic Resonance(MR)image slices.WCMFO constitutes a hybrid between the two techniques,comprising the water cycle and moth-flame optimization algorithms.The optimal thresholds are obtained by maximizing the between class variance(Otsu’s function)of the image.To test the performance of threshold searching process,the proposed algorithm has been evaluated on standard benchmark of ten axial T2-weighted brain MR images for image segmentation.The experimental outcomes infer that it produces better optimal threshold values at a greater and quicker convergence rate.In contrast to other state-of-the-art methods,namely Adaptive Wind Driven Optimization(AWDO),Adaptive Bacterial Foraging(ABF)and Particle Swarm Optimization(PSO),the proposed algorithm has been found to be better at producing the best objective function,Peak Signal-to-Noise Ratio(PSNR),Standard Deviation(STD)and lower computational time values.Further,it was observed thatthe segmented image gives greater detail when the threshold level increases.Moreover,the statistical test result confirms that the best and mean values are almost zero and the average difference between best and mean value 1.86 is obtained through the 30 executions of the proposed algorithm.Thus,these images will lead to better segments of gray,white and cerebrospinal fluid that enable better clinical choices and diagnoses using a proposed algorithm.展开更多
This study is trying to address the critical need for efficient routing in Mobile Ad Hoc Networks(MANETs)from dynamic topologies that pose great challenges because of the mobility of nodes.Themain objective was to del...This study is trying to address the critical need for efficient routing in Mobile Ad Hoc Networks(MANETs)from dynamic topologies that pose great challenges because of the mobility of nodes.Themain objective was to delve into and refine the application of the Dijkstra’s algorithm in this context,a method conventionally esteemed for its efficiency in static networks.Thus,this paper has carried out a comparative theoretical analysis with the Bellman-Ford algorithm,considering adaptation to the dynamic network conditions that are typical for MANETs.This paper has shown through detailed algorithmic analysis that Dijkstra’s algorithm,when adapted for dynamic updates,yields a very workable solution to the problem of real-time routing in MANETs.The results indicate that with these changes,Dijkstra’s algorithm performs much better computationally and 30%better in routing optimization than Bellman-Ford when working with configurations of sparse networks.The theoretical framework adapted,with the adaptation of the Dijkstra’s algorithm for dynamically changing network topologies,is novel in this work and quite different from any traditional application.The adaptation should offer more efficient routing and less computational overhead,most apt in the limited resource environment of MANETs.Thus,from these findings,one may derive a conclusion that the proposed version of Dijkstra’s algorithm is the best and most feasible choice of the routing protocol for MANETs given all pertinent key performance and resource consumption indicators and further that the proposed method offers a marked improvement over traditional methods.This paper,therefore,operationalizes the theoretical model into practical scenarios and also further research with empirical simulations to understand more about its operational effectiveness.展开更多
基金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.
基金jointly supported by the Fundamental Research Funds for the Central Universities(Grant No.xzy012023075)the Zhejiang Engineering Research Center of Intelligent Urban Infrastructure(Grant No.IUI2023-YB-12).
文摘The computational accuracy and efficiency of modeling the stress spectrum derived from bridge monitoring data significantly influence the fatigue life assessment of steel bridges.Therefore,determining the optimal stress spectrum model is crucial for further fatigue reliability analysis.This study investigates the performance of the REBMIX algorithm in modeling both univariate(stress range)and multivariate(stress range and mean stress)distributions of the rain-flowmatrix for a steel arch bridge,usingAkaike’s Information Criterion(AIC)as a performance metric.Four types of finitemixture distributions—Normal,Lognormal,Weibull,and Gamma—are employed tomodel the stress range.Additionally,mixed distributions,including Normal-Normal,Lognormal-Normal,Weibull-Normal,and Gamma-Normal,are utilized to model the joint distribution of stress range and mean stress.The REBMIX algorithm estimates the number of components,component weights,and component parameters for each candidate finite mixture distribution.The results demonstrate that the REBMIX algorithm-based mixture parameter estimation approach effectively identifies the optimal distribution based on AIC values.Furthermore,the algorithm exhibits superior computational efficiency compared to traditional methods,making it highly suitable for practical applications.
基金supported by Natural Science Foundation of Jilin Province(YDZJ202401352ZYTS).
文摘To address the issues of low accuracy and high false positive rate in traditional Otsu algorithm for defect detection on infrared images of wind turbine blades(WTB),this paper proposes a technique that combines morphological image enhancement with an improved Otsu algorithm.First,mathematical morphology’s differential multi-scale white and black top-hat operations are applied to enhance the image.The algorithm employs entropy as the objective function to guide the iteration process of image enhancement,selecting appropriate structural element scales to execute differential multi-scale white and black top-hat transformations,effectively enhancing the detail features of defect regions and improving the contrast between defects and background.Afterwards,grayscale inversion is performed on the enhanced infrared defect image to better adapt to the improved Otsu algorithm.Finally,by introducing a parameter K to adjust the calculation of inter-class variance in the Otsu method,the weight of the target pixels is increased.Combined with the adaptive iterative threshold algorithm,the threshold selection process is further fine-tuned.Experimental results show that compared to traditional Otsu algorithms and other improvements,the proposed method has significant advantages in terms of defect detection accuracy and reducing false positive rates.The average defect detection rate approaches 1,and the average Hausdorff distance decreases to 0.825,indicating strong robustness and accuracy of the method.
基金supported by the National Natural Science Foundation of China under Grant Nos.U21A20464,62066005the Innovation Project of Guangxi Graduate Education under Grant No.YCSW2023259.
文摘Parkinson’s disease is a neurodegenerative disorder that inflicts irreversible damage on humans.Some experimental data regarding Parkinson’s patients are redundant and irrelevant,posing significant challenges for disease detection.Therefore,there is a need to devise an effective method for the selective extraction of disease-specific information,ensuring both accuracy and the utilization of fewer features.In this paper,a Binary Hybrid Artificial Hummingbird and Flower Pollination Algorithm(FPA),called BFAHA,is proposed to solve the problem of Parkinson’s disease diagnosis based on speech signals.First,combining FPA with Artificial Hummingbird Algorithm(AHA)can take advantage of the strong global exploration ability possessed by FPA to improve the disadvantages of AHA,such as premature convergence and easy falling into local optimum.Second,the Hemming distance is used to determine the difference between the other individuals in the population and the optimal individual after each iteration,if the difference is too significant,the cross-mutation strategy in the genetic algorithm(GA)is used to induce the population individuals to keep approaching the optimal individual in the random search process to speed up finding the optimal solution.Finally,an S-shaped function converts the improved algorithm into a binary version to suit the characteristics of the feature selection(FS)tasks.In this paper,10 high-dimensional datasets from UCI and the ASU are used to test the performance of BFAHA and apply it to Parkinson’s disease diagnosis.Compared with other state-of-the-art algorithms,BFAHA shows excellent competitiveness in both the test datasets and the classification problem,indicating that the algorithm proposed in this study has apparent advantages in the field of feature selection.
基金supported by the National Natural Science Foundation of China (61302188)the Nanjing University of Science and Technology Research Foundation (2010ZDJH05)
文摘Time-frequency-based methods are proven to be effective for parameter estimation of linear frequency modulation （LFM） signals. The smoothed pseudo Winger-Ville distribution （SPWVD） is used for the parameter estimation of multi-LFM signals, and a method of the SPWVD binarization by a dynamic threshold based on the Otsu algorithm is proposed. The proposed method is effective in the demand for the estimation of different parameters and the unknown signal-to-noise ratio （SNR） circumstance. The performance of this method is confirmed by numerical simulation.
文摘In this study,a novel hybrid Water Cycle Moth-Flame Optimization(WCMFO)algorithm is proposed for multilevel thresholding brain image segmentation in Magnetic Resonance(MR)image slices.WCMFO constitutes a hybrid between the two techniques,comprising the water cycle and moth-flame optimization algorithms.The optimal thresholds are obtained by maximizing the between class variance(Otsu’s function)of the image.To test the performance of threshold searching process,the proposed algorithm has been evaluated on standard benchmark of ten axial T2-weighted brain MR images for image segmentation.The experimental outcomes infer that it produces better optimal threshold values at a greater and quicker convergence rate.In contrast to other state-of-the-art methods,namely Adaptive Wind Driven Optimization(AWDO),Adaptive Bacterial Foraging(ABF)and Particle Swarm Optimization(PSO),the proposed algorithm has been found to be better at producing the best objective function,Peak Signal-to-Noise Ratio(PSNR),Standard Deviation(STD)and lower computational time values.Further,it was observed thatthe segmented image gives greater detail when the threshold level increases.Moreover,the statistical test result confirms that the best and mean values are almost zero and the average difference between best and mean value 1.86 is obtained through the 30 executions of the proposed algorithm.Thus,these images will lead to better segments of gray,white and cerebrospinal fluid that enable better clinical choices and diagnoses using a proposed algorithm.
基金supported by Northern Border University,Arar,Kingdom of Saudi Arabia,through the Project Number“NBU-FFR-2024-2248-03”.
文摘This study is trying to address the critical need for efficient routing in Mobile Ad Hoc Networks(MANETs)from dynamic topologies that pose great challenges because of the mobility of nodes.Themain objective was to delve into and refine the application of the Dijkstra’s algorithm in this context,a method conventionally esteemed for its efficiency in static networks.Thus,this paper has carried out a comparative theoretical analysis with the Bellman-Ford algorithm,considering adaptation to the dynamic network conditions that are typical for MANETs.This paper has shown through detailed algorithmic analysis that Dijkstra’s algorithm,when adapted for dynamic updates,yields a very workable solution to the problem of real-time routing in MANETs.The results indicate that with these changes,Dijkstra’s algorithm performs much better computationally and 30%better in routing optimization than Bellman-Ford when working with configurations of sparse networks.The theoretical framework adapted,with the adaptation of the Dijkstra’s algorithm for dynamically changing network topologies,is novel in this work and quite different from any traditional application.The adaptation should offer more efficient routing and less computational overhead,most apt in the limited resource environment of MANETs.Thus,from these findings,one may derive a conclusion that the proposed version of Dijkstra’s algorithm is the best and most feasible choice of the routing protocol for MANETs given all pertinent key performance and resource consumption indicators and further that the proposed method offers a marked improvement over traditional methods.This paper,therefore,operationalizes the theoretical model into practical scenarios and also further research with empirical simulations to understand more about its operational effectiveness.
