Jianfeng Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Jianfeng Wang has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
- Bin Wang
Hanyang University
2 shared publications - Xiaoyan Zhang
College of Design, Hanyang University, Ansan 15588, Republic of Korea
2 shared publications - Bin Wang
College of Design, Hanyang University, Ansan 16588, Republic of Korea
1 shared publication - Fuqiang Chen
Department of Artificial Intelligence, Guangzhou Huashang College, Guangzhou 511300, China
1 shared publication - Jia Luo
School of Electrical Engineering, Shandong University, Jinan 250061, China
1 shared publication - Jingbo Zhan
School of Computer and Control Engineering, Northeast Forestry University, Harbin 150040, China
1 shared publication
Latest Publications
- Open Access
Symmetry-Guided Multi-Elite Gekko Japonicus Optimization Algorithm for Global Optimization and Artistic Image Segmentation
This paper presents a symmetry-guided multi-elite Gekko Japonicus Algorithm, termed MIGJA, for global optimization and multi-threshold image segmentation. The method modifies the original GJA from three aspects. In the movement stage, a success-rate feedback mechanism is used to adapt the Lévy-flight probability and step-size coefficient according to recent search behavior, allowing the population to switch more flexibly between exploration and exploitation. In the guidance stage, several elite individuals are combined to form a weighted collaborative center, which reduces the excessive dependence on a single best solution and provides a more balanced search direction. In the reconstruction stage, historical memory and differential information are introduced into the tail reconstruction process to help inferior or stagnant individuals move out of local regions during the later search phase. The proposed MIGJA is tested on the CEC2017 and CEC2020 benchmark suites and further applied to Otsu-based multi-threshold image segmentation. The numerical results show that MIGJA performs competitively in terms of convergence accuracy and stability. According to the Friedman mean-rank results, MIGJA ranks first in all test settings, with mean-rank reductions of about 78.8–84.5% compared with the original GJA and 66.7–76.1% compared with the strongest competitor. In the segmentation experiments, MIGJA also obtains favorable objective function values and image quality metrics, including PSNR, FSIM, and SSIM. These findings suggest that the proposed algorithm is suitable for both benchmark optimization and multi-threshold image segmentation tasks.
Open AccessSymmetry-Guided Multi-Elite Gekko Japonicus Optimization Algorithm for Global Optimization and Artistic Image Segmentation
This paper presents a symmetry-guided multi-elite Gekko Japonicus Algorithm, termed MIGJA, for global optimization and multi-threshold image segmentation. The method modifies the original GJA from three aspects. In the movement stage, a success-rate feedback mechanism is used to adapt the Lévy-flight probability and step-size coefficient according to recent search behavior, allowing the population to switch more flexibly between exploration and exploitation. In the guidance stage, several elite individuals are combined to form a weighted collaborative center, which reduces the excessive dependence on a single best solution and provides a more balanced search direction. In the reconstruction stage, historical memory and differential information are introduced into the tail reconstruction process to help inferior or stagnant individuals move out of local regions during the later search phase. The proposed MIGJA is tested on the CEC2017 and CEC2020 benchmark suites and further applied to Otsu-based multi-threshold image segmentation. The numerical results show that MIGJA performs competitively in terms of convergence accuracy and stability. According to the Friedman mean-rank results, MIGJA ranks first in all test settings, with mean-rank reductions of about 78.8–84.5% compared with the original GJA and 66.7–76.1% compared with the strongest competitor. In the segmentation experiments, MIGJA also obtains favorable objective function values and image quality metrics, including PSNR, FSIM, and SSIM. These findings suggest that the proposed algorithm is suitable for both benchmark optimization and multi-threshold image segmentation tasks.
- Open Access
- 13 May 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (10) , 1659
Task Scheduling Optimization in Cloud-Edge Collaborative Architecture via a Multi-Strategy Artificial Lemming Algorithm
In the cloud computing environment, various heterogeneous architectures have emerged, and the cloud-edge collaborative task scheduling architecture has come into being under this background. However, the complexity of cloud-edge heterogeneous architecture significantly restricts the improvement of scheduling performance. Therefore, researchers propose solving this problem by leveraging intelligent optimization algorithms. The Artificial Lemming Algorithm has received extensive attention due to its strong robustness. However, when dealing with the problem of cloud-edge collaborative task scheduling, there are still some drawbacks, such as long system response time and unstable scheduling performance. In response to the above problems, this paper proposes a multi-strategy artificial lemming algorithm. Specifically, by coordinating high-order Chebyshev polynomials with chaotic mapping to enhance the richness of the initial population, the scheduling response time is indirectly shortened. Secondly, the Adaptive Spatial Search Mechanism is introduced to make up for the deficiencies in the exploration stage, enhance the algorithm’s exploration ability, and thereby improve the optimization effect of scheduling satisfaction. Furthermore, the Bernstein-Guided Correction Strategy is introduced to enhance the exploitation capability of the algorithm to improve the stability of cloud-edge scheduling. The experimental results demonstrate that compared with the baseline algorithms, the proposed MALA reduces the total scheduling cost by at least 3% across cloud-edge collaborative resource scheduling problems of different scales.
- 13 May 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (10) , 1659
Open AccessTask Scheduling Optimization in Cloud-Edge Collaborative Architecture via a Multi-Strategy Artificial Lemming Algorithm
In the cloud computing environment, various heterogeneous architectures have emerged, and the cloud-edge collaborative task scheduling architecture has come into being under this background. However, the complexity of cloud-edge heterogeneous architecture significantly restricts the improvement of scheduling performance. Therefore, researchers propose solving this problem by leveraging intelligent optimization algorithms. The Artificial Lemming Algorithm has received extensive attention due to its strong robustness. However, when dealing with the problem of cloud-edge collaborative task scheduling, there are still some drawbacks, such as long system response time and unstable scheduling performance. In response to the above problems, this paper proposes a multi-strategy artificial lemming algorithm. Specifically, by coordinating high-order Chebyshev polynomials with chaotic mapping to enhance the richness of the initial population, the scheduling response time is indirectly shortened. Secondly, the Adaptive Spatial Search Mechanism is introduced to make up for the deficiencies in the exploration stage, enhance the algorithm’s exploration ability, and thereby improve the optimization effect of scheduling satisfaction. Furthermore, the Bernstein-Guided Correction Strategy is introduced to enhance the exploitation capability of the algorithm to improve the stability of cloud-edge scheduling. The experimental results demonstrate that compared with the baseline algorithms, the proposed MALA reduces the total scheduling cost by at least 3% across cloud-edge collaborative resource scheduling problems of different scales.
- Open Access
Teaching–Learning–Studying-Based Optimization with Dance Learning Strategies for Global Optimization Problems and Real-World Applications
This paper addresses two key challenges: low solution accuracy and premature convergence in high-dimensional optimization problems, as well as the difficulty of jointly optimizing coverage, redundancy, and movement cost in wireless sensor network (WSN) deployment. To solve these issues, an improved Teaching–Learning–Studying-Based Optimization algorithm, named TLSBO-DLS, is proposed. Within the original TLSBO framework, three enhancement strategies are incorporated: (1) a dimension-adaptive update probability mechanism to improve fine-grained search capability; (2) a dance learning strategy that enhances dynamic exploration through oscillatory cooperative learning; and (3) an elite adaptive perturbation mechanism based on a Cauchy–Gaussian hybrid distribution to improve convergence accuracy and help escape local optima. Empirical evaluations conducted on the CEC2017, CEC2020, and CEC2022 benchmark datasets indicate that TLSBO-DLS achieves superior performance compared to nine alternative algorithms, exhibiting higher solution precision and faster convergence behavior. Furthermore, its advantage is rigorously confirmed through statistical analyses using the Wilcoxon rank-sum test and the Friedman ranking test. Furthermore, a two-dimensional multi-objective WSN node deployment model is constructed, and TLSBO-DLS is applied to a practical scenario with 30 sensor nodes. The results show that the proposed algorithm achieves a coverage rate of 85.50%, a redundant coverage rate of only 5.15%, and an average node movement distance as low as 15.8471. In terms of global performance, the proposed method surpasses PSO, GWO, WOA, as well as several enhanced TLSBO variants, thereby demonstrating its strong capability and practical value when addressing high-dimensional challenging optimization tasks and real-world engineering problems.
Open AccessTeaching–Learning–Studying-Based Optimization with Dance Learning Strategies for Global Optimization Problems and Real-World Applications
This paper addresses two key challenges: low solution accuracy and premature convergence in high-dimensional optimization problems, as well as the difficulty of jointly optimizing coverage, redundancy, and movement cost in wireless sensor network (WSN) deployment. To solve these issues, an improved Teaching–Learning–Studying-Based Optimization algorithm, named TLSBO-DLS, is proposed. Within the original TLSBO framework, three enhancement strategies are incorporated: (1) a dimension-adaptive update probability mechanism to improve fine-grained search capability; (2) a dance learning strategy that enhances dynamic exploration through oscillatory cooperative learning; and (3) an elite adaptive perturbation mechanism based on a Cauchy–Gaussian hybrid distribution to improve convergence accuracy and help escape local optima. Empirical evaluations conducted on the CEC2017, CEC2020, and CEC2022 benchmark datasets indicate that TLSBO-DLS achieves superior performance compared to nine alternative algorithms, exhibiting higher solution precision and faster convergence behavior. Furthermore, its advantage is rigorously confirmed through statistical analyses using the Wilcoxon rank-sum test and the Friedman ranking test. Furthermore, a two-dimensional multi-objective WSN node deployment model is constructed, and TLSBO-DLS is applied to a practical scenario with 30 sensor nodes. The results show that the proposed algorithm achieves a coverage rate of 85.50%, a redundant coverage rate of only 5.15%, and an average node movement distance as low as 15.8471. In terms of global performance, the proposed method surpasses PSO, GWO, WOA, as well as several enhanced TLSBO variants, thereby demonstrating its strong capability and practical value when addressing high-dimensional challenging optimization tasks and real-world engineering problems.
- Open Access
A Multi-Strategy Improved Information Acquisition Algorithm for Numerical Optimization and Artistic Image Segmentation
To address the shortcomings of the information acquisition optimizer (IAO)—specifically its susceptibility to premature convergence, insufficient exploitation capability during later stages, and population diversity decay when applied to complex optimization problems—this paper proposes a multi-strategy improved information acquisition optimizer (MIIAO). Centered on balancing exploration and exploitation capabilities during the search process, this method incorporates several key strategies: an adaptive differential perturbation factor is designed to dynamically adjust the search step size; an elite-guided information acquisition mechanism is introduced to enhance convergence efficiency within high-quality regions; a diversity-based restart perturbation strategy is integrated to mitigate the risk of entrapment in local optima; and a mirror boundary handling technique is adopted to bolster the resilience of solutions near boundaries and improve the effectiveness of searching within the feasible domain. To validate the efficacy of the proposed method, MIIAO was applied to the CEC2014, CEC2017, and CEC2022 benchmark test suites and systematically compared against various representative intelligent optimization algorithms. Furthermore, the method was applied to multi-threshold image segmentation tasks based on Otsu’s criterion. Experimental results demonstrate that MIIAO consistently exhibits superior solution accuracy, convergence speed, stability, and statistical ranking across various dimensions and a diverse range of complex test functions; the results of the Wilcoxon rank-sum test and Friedman mean ranking further substantiate its comprehensive performance advantages. In the image segmentation experiments, MIIAO achieved superior Otsu objective function values across multiple test images and under various threshold settings, while also demonstrating higher segmentation quality and greater robustness across evaluation metrics such as PSNR, SSIM, and FSIM. In summary, the proposed MIIAO effectively enhances the original IAO’s global search capability, local exploitation capability, and ability to maintain population diversity, thereby demonstrating significant potential for practical application in both numerical optimization and multi-threshold image segmentation tasks.
Open AccessA Multi-Strategy Improved Information Acquisition Algorithm for Numerical Optimization and Artistic Image Segmentation
To address the shortcomings of the information acquisition optimizer (IAO)—specifically its susceptibility to premature convergence, insufficient exploitation capability during later stages, and population diversity decay when applied to complex optimization problems—this paper proposes a multi-strategy improved information acquisition optimizer (MIIAO). Centered on balancing exploration and exploitation capabilities during the search process, this method incorporates several key strategies: an adaptive differential perturbation factor is designed to dynamically adjust the search step size; an elite-guided information acquisition mechanism is introduced to enhance convergence efficiency within high-quality regions; a diversity-based restart perturbation strategy is integrated to mitigate the risk of entrapment in local optima; and a mirror boundary handling technique is adopted to bolster the resilience of solutions near boundaries and improve the effectiveness of searching within the feasible domain. To validate the efficacy of the proposed method, MIIAO was applied to the CEC2014, CEC2017, and CEC2022 benchmark test suites and systematically compared against various representative intelligent optimization algorithms. Furthermore, the method was applied to multi-threshold image segmentation tasks based on Otsu’s criterion. Experimental results demonstrate that MIIAO consistently exhibits superior solution accuracy, convergence speed, stability, and statistical ranking across various dimensions and a diverse range of complex test functions; the results of the Wilcoxon rank-sum test and Friedman mean ranking further substantiate its comprehensive performance advantages. In the image segmentation experiments, MIIAO achieved superior Otsu objective function values across multiple test images and under various threshold settings, while also demonstrating higher segmentation quality and greater robustness across evaluation metrics such as PSNR, SSIM, and FSIM. In summary, the proposed MIIAO effectively enhances the original IAO’s global search capability, local exploitation capability, and ability to maintain population diversity, thereby demonstrating significant potential for practical application in both numerical optimization and multi-threshold image segmentation tasks.
- Open Access
Multi-Threshold Art Symmetry Image Segmentation and Numerical Optimization Based on the Modified Golden Jackal Optimization
To address the issues of uneven population initialization, insufficient individual information interaction, and passive boundary handling in the standard Golden Jackal Optimization (GJO) algorithm, while improving the accuracy and efficiency of multilevel thresholding in artistic image segmentation, this paper proposes an improved Golden Jackal Optimization algorithm (MGJO) and applies it to this task. MGJO introduces a high-quality point set for population initialization, ensuring a more uniform distribution of initial individuals in the search space and better adaptation to the complex grayscale characteristics of artistic images. A dual crossover strategy, integrating horizontal and vertical information exchange, is designed to enhance individual information sharing and fine-grained dimensional search, catering to the segmentation needs of artistic image textures and color layers. Furthermore, a global-optimum-based boundary handling mechanism is constructed to prevent information loss when boundaries are exceeded, thereby preserving the boundary details of artistic images. The performance of MGJO was evaluated on the CEC2017 (dim = 30, 100) and CEC2022 (dim = 10, 20) benchmark suites against seven algorithms, including GWO and IWOA. Population diversity analysis, exploration–exploitation balance assessment, Wilcoxon rank-sum tests, and Friedman mean-rank tests all demonstrate that MGJO significantly outperforms the comparison algorithms in optimization accuracy, stability, and statistical reliability. In multilevel thresholding for artistic image segmentation, using Otsu’s between-class variance as the objective function, MGJO achieves higher fitness values (approaching Otsu’s optimal values) across various artistic images with complex textures and colors, as well as benchmark images such as Baboon, Camera, and Lena, in 4-, 6-, 8-, and 10-level thresholding tasks. The resulting segmented images exhibit superior peak signal-to-noise ratio (PSNR), structural similarity (SSIM), and feature similarity (FSIM) compared to other algorithms, more precisely preserving brushstroke details and color layers. Friedman average rankings consistently place MGJO in the lead. These experimental results indicate that MGJO effectively overcomes the performance limitations of the standard GJO, demonstrating excellent performance in both numerical optimization and multilevel thresholding artistic image segmentation. It provides an efficient solution for high-dimensional complex optimization problems and practical demands in artistic image processing.
Open AccessMulti-Threshold Art Symmetry Image Segmentation and Numerical Optimization Based on the Modified Golden Jackal Optimization
To address the issues of uneven population initialization, insufficient individual information interaction, and passive boundary handling in the standard Golden Jackal Optimization (GJO) algorithm, while improving the accuracy and efficiency of multilevel thresholding in artistic image segmentation, this paper proposes an improved Golden Jackal Optimization algorithm (MGJO) and applies it to this task. MGJO introduces a high-quality point set for population initialization, ensuring a more uniform distribution of initial individuals in the search space and better adaptation to the complex grayscale characteristics of artistic images. A dual crossover strategy, integrating horizontal and vertical information exchange, is designed to enhance individual information sharing and fine-grained dimensional search, catering to the segmentation needs of artistic image textures and color layers. Furthermore, a global-optimum-based boundary handling mechanism is constructed to prevent information loss when boundaries are exceeded, thereby preserving the boundary details of artistic images. The performance of MGJO was evaluated on the CEC2017 (dim = 30, 100) and CEC2022 (dim = 10, 20) benchmark suites against seven algorithms, including GWO and IWOA. Population diversity analysis, exploration–exploitation balance assessment, Wilcoxon rank-sum tests, and Friedman mean-rank tests all demonstrate that MGJO significantly outperforms the comparison algorithms in optimization accuracy, stability, and statistical reliability. In multilevel thresholding for artistic image segmentation, using Otsu’s between-class variance as the objective function, MGJO achieves higher fitness values (approaching Otsu’s optimal values) across various artistic images with complex textures and colors, as well as benchmark images such as Baboon, Camera, and Lena, in 4-, 6-, 8-, and 10-level thresholding tasks. The resulting segmented images exhibit superior peak signal-to-noise ratio (PSNR), structural similarity (SSIM), and feature similarity (FSIM) compared to other algorithms, more precisely preserving brushstroke details and color layers. Friedman average rankings consistently place MGJO in the lead. These experimental results indicate that MGJO effectively overcomes the performance limitations of the standard GJO, demonstrating excellent performance in both numerical optimization and multilevel thresholding artistic image segmentation. It provides an efficient solution for high-dimensional complex optimization problems and practical demands in artistic image processing.
- Open Access
- 11 November 2025
- Published by MDPI AG in Biomimetics
- Vol. 10 (11) , 760
Multi-Strategy Improved POA for Global Optimization Problems and 3D UAV Path Planning
With the rapid development of smart manufacturing and the low-altitude economy, drone technology—as a vital component of next-generation intelligent equipment—has garnered significant attention from researchers. Path planning, one of the core challenges in drone technology advancement, directly impacts the efficiency and safety of drone mission execution. However, most existing drone path planning algorithms suffer from issues such as requiring extensive interactive information or being prone to getting stuck in local optima. This study introduces a multi-strategy enhanced Pelican Optimization Algorithm (MIPOA) tailored for UAV path planning. To improve the quality of the initial population, a hybrid initialization approach combining low-discrepancy sequences with heuristic refinement is developed. The low-discrepancy component promotes a more uniform distribution across the search space, while the heuristic mechanism enhances the fitness of selected individuals and reduces redundant exploration. Furthermore, a subgroup mean-guided updating strategy is designed to accelerate convergence toward the global optimum. To maintain exploration ability, a random reinitialization boundary mechanism is incorporated, effectively preventing premature convergence. To validate the algorithm’s performance, MIPOA is compared with eleven benchmark metaheuristics on the CEC2017 test suite, and statistical analyses confirm its superior optimization capability. Finally, MIPOA is applied to 3D UAV path planning under four threat scenarios in a realistic environment, demonstrating robust adaptability and achieving successful mission completion.
- 11 November 2025
- Published by MDPI AG in Biomimetics
- Vol. 10 (11) , 760
Open AccessMulti-Strategy Improved POA for Global Optimization Problems and 3D UAV Path Planning
With the rapid development of smart manufacturing and the low-altitude economy, drone technology—as a vital component of next-generation intelligent equipment—has garnered significant attention from researchers. Path planning, one of the core challenges in drone technology advancement, directly impacts the efficiency and safety of drone mission execution. However, most existing drone path planning algorithms suffer from issues such as requiring extensive interactive information or being prone to getting stuck in local optima. This study introduces a multi-strategy enhanced Pelican Optimization Algorithm (MIPOA) tailored for UAV path planning. To improve the quality of the initial population, a hybrid initialization approach combining low-discrepancy sequences with heuristic refinement is developed. The low-discrepancy component promotes a more uniform distribution across the search space, while the heuristic mechanism enhances the fitness of selected individuals and reduces redundant exploration. Furthermore, a subgroup mean-guided updating strategy is designed to accelerate convergence toward the global optimum. To maintain exploration ability, a random reinitialization boundary mechanism is incorporated, effectively preventing premature convergence. To validate the algorithm’s performance, MIPOA is compared with eleven benchmark metaheuristics on the CEC2017 test suite, and statistical analyses confirm its superior optimization capability. Finally, MIPOA is applied to 3D UAV path planning under four threat scenarios in a realistic environment, demonstrating robust adaptability and achieving successful mission completion.
- Open Access
- 28 August 2025
- Published by MDPI AG in Biomimetics
- Vol. 10 (9) , 572
An Improved Bionic Artificial Lemming Algorithm for Global Optimization and Cloud Task-Scheduling Problems
The intelligent optimization algorithm has become a key tool in complex and intertwined engineering and science fields. However, with the increasing complexity of the problem and the rapid expansion of the data scale, the performance of the algorithm has been challenged unprecedentedly. The artificial lemming algorithm has gradually emerged because of its unique structural design and efficient optimization performance and has been widely recognized by academic circles. However, in the face of more complex and challenging optimization and scheduling problems, it also exposed some obvious shortcomings. For example, the dispersion of the initial individual set in the algorithm is low, which leads to the low accuracy of the optimal solution. In addition, the exploitation ability of the algorithm is relatively weak, which leads to a slow convergence speed. Fortunately, this paper proposes an improved artificial lemming algorithm. Based on the in-depth analysis of the original algorithm, aiming at addressing the shortcomings of the original algorithm, some innovative mechanisms are introduced. In order to verify the effectiveness of the improved algorithm, a large number of experiments are carried out through global optimization test problems. The experimental results show that the performance of the algorithm has been obviously improved, and the accuracy and convergence speed of the solution are obviously better than the original algorithm and some baseline algorithms. In addition, this paper also applies the improved artificial travel algorithm to the cloud scheduling problem. These experimental results further verify the feasibility and effectiveness of this method in practical application and provide strong support for its application in a wider range of fields.
- 28 August 2025
- Published by MDPI AG in Biomimetics
- Vol. 10 (9) , 572
Open AccessAn Improved Bionic Artificial Lemming Algorithm for Global Optimization and Cloud Task-Scheduling Problems
The intelligent optimization algorithm has become a key tool in complex and intertwined engineering and science fields. However, with the increasing complexity of the problem and the rapid expansion of the data scale, the performance of the algorithm has been challenged unprecedentedly. The artificial lemming algorithm has gradually emerged because of its unique structural design and efficient optimization performance and has been widely recognized by academic circles. However, in the face of more complex and challenging optimization and scheduling problems, it also exposed some obvious shortcomings. For example, the dispersion of the initial individual set in the algorithm is low, which leads to the low accuracy of the optimal solution. In addition, the exploitation ability of the algorithm is relatively weak, which leads to a slow convergence speed. Fortunately, this paper proposes an improved artificial lemming algorithm. Based on the in-depth analysis of the original algorithm, aiming at addressing the shortcomings of the original algorithm, some innovative mechanisms are introduced. In order to verify the effectiveness of the improved algorithm, a large number of experiments are carried out through global optimization test problems. The experimental results show that the performance of the algorithm has been obviously improved, and the accuracy and convergence speed of the solution are obviously better than the original algorithm and some baseline algorithms. In addition, this paper also applies the improved artificial travel algorithm to the cloud scheduling problem. These experimental results further verify the feasibility and effectiveness of this method in practical application and provide strong support for its application in a wider range of fields.
- Open Access
- 1 May 2025
- Published by MDPI AG in Biomimetics
- Vol. 10 (5) , 282
An Enhanced Human Evolutionary Optimization Algorithm for Global Optimization and Multi-Threshold Image Segmentation
Thresholding image segmentation aims to divide an image into a number of regions with different feature attributes in order to facilitate the extraction of image features in the context of image detection and pattern recognition. However, existing threshold image-segmentation methods suffer from the problem of easily falling into locally optimal thresholds, resulting in poor image segmentation. In order to improve the image-segmentation performance, this study proposes an enhanced Human Evolutionary Optimization Algorithm (HEOA), known as CLNBHEOA, which incorporates Otsu’s method as an objective function to significantly improve the image-segmentation performance. In the CLNBHEOA, firstly, population diversity is enhanced using the Chebyshev–Tent chaotic mapping refraction opposites-based learning strategy. Secondly, an adaptive learning strategy is proposed which combines differential learning and adaptive factors to improve the ability of the algorithm to jump out of the locally optimum threshold. In addition, a nonlinear control factor is proposed to better balance the global exploration phase and the local exploitation phase of the algorithm. Finally, a three-point guidance strategy based on Bernstein polynomials is proposed which enhances the local exploitation ability of the algorithm and effectively improves the efficiency of optimal threshold search. Subsequently, the optimization performance of the CLNBHEOA was evaluated on the CEC2017 benchmark functions. Experiments demonstrated that the CLNBHEOA outperformed the comparison algorithms by over 90%, exhibiting higher optimization performance and search efficiency. Finally, the CLNBHEOA was applied to solve six multi-threshold image-segmentation problems. The experimental results indicated that the CLNBHEOA achieved a winning rate of over 95% in terms of fitness function value, peak signal-to-noise ratio (PSNR), structural similarity (SSIM) and feature similarity (FSIM), suggesting that it can be considered a promising approach for multi-threshold image segmentation.
- 1 May 2025
- Published by MDPI AG in Biomimetics
- Vol. 10 (5) , 282
Open AccessAn Enhanced Human Evolutionary Optimization Algorithm for Global Optimization and Multi-Threshold Image Segmentation
Thresholding image segmentation aims to divide an image into a number of regions with different feature attributes in order to facilitate the extraction of image features in the context of image detection and pattern recognition. However, existing threshold image-segmentation methods suffer from the problem of easily falling into locally optimal thresholds, resulting in poor image segmentation. In order to improve the image-segmentation performance, this study proposes an enhanced Human Evolutionary Optimization Algorithm (HEOA), known as CLNBHEOA, which incorporates Otsu’s method as an objective function to significantly improve the image-segmentation performance. In the CLNBHEOA, firstly, population diversity is enhanced using the Chebyshev–Tent chaotic mapping refraction opposites-based learning strategy. Secondly, an adaptive learning strategy is proposed which combines differential learning and adaptive factors to improve the ability of the algorithm to jump out of the locally optimum threshold. In addition, a nonlinear control factor is proposed to better balance the global exploration phase and the local exploitation phase of the algorithm. Finally, a three-point guidance strategy based on Bernstein polynomials is proposed which enhances the local exploitation ability of the algorithm and effectively improves the efficiency of optimal threshold search. Subsequently, the optimization performance of the CLNBHEOA was evaluated on the CEC2017 benchmark functions. Experiments demonstrated that the CLNBHEOA outperformed the comparison algorithms by over 90%, exhibiting higher optimization performance and search efficiency. Finally, the CLNBHEOA was applied to solve six multi-threshold image-segmentation problems. The experimental results indicated that the CLNBHEOA achieved a winning rate of over 95% in terms of fitness function value, peak signal-to-noise ratio (PSNR), structural similarity (SSIM) and feature similarity (FSIM), suggesting that it can be considered a promising approach for multi-threshold image segmentation.
- Open Access
- 18 February 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (4) , 668
Multi-Strategy Improved Binary Secretarial Bird Optimization Algorithm for Feature Selection
With the rapid development of large model technology, data storage as well as collection is very important to improve the accuracy of model training, and Feature Selection (FS) methods can greatly eliminate redundant features in the data warehouse and improve the interpretability of the model, which makes it particularly important in the field of large model training. In order to better reduce redundant features in data warehouses, this paper proposes an enhanced Secretarial Bird Optimization Algorithm (SBOA), called BSFSBOA, by combining three learning strategies. First, for the problem of insufficient algorithmic population diversity in SBOA, the best-rand exploration strategy is proposed, which utilizes the randomness and optimality of random individuals as well as optimal individuals to effectively improve the population diversity of the algorithm. Second, to address the imbalance in the exploration/exploitation phase of SBOA, the segmented balance strategy is proposed to improve the balance by segmenting the individuals in the population, targeting individuals of different natures with different degrees of exploration and exploitation performance, and improving the quality of the FS subset when the algorithm is solved. Finally, for the problem of insufficient exploitation performance of SBOA, a four-role exploitation strategy is proposed, which strengthens the effective exploitation ability of the algorithm and enhances the classification accuracy of the FS subset by different degrees of guidance through the four natures of individuals in the population. Subsequently, the proposed BSFSBOA-based FS method is applied to solve 36 FS problems involving low, medium, and high dimensions, and the experimental results show that, compared to SBOA, BSFSBOA improves the performance of classification accuracy by more than 60%, also ranks first in feature subset size, obtains the least runtime, and confirms that the BSFSBOA-based FS method is a robust FS method with efficient solution performance, high stability, and high practicality.
- 18 February 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (4) , 668
Open AccessMulti-Strategy Improved Binary Secretarial Bird Optimization Algorithm for Feature Selection
With the rapid development of large model technology, data storage as well as collection is very important to improve the accuracy of model training, and Feature Selection (FS) methods can greatly eliminate redundant features in the data warehouse and improve the interpretability of the model, which makes it particularly important in the field of large model training. In order to better reduce redundant features in data warehouses, this paper proposes an enhanced Secretarial Bird Optimization Algorithm (SBOA), called BSFSBOA, by combining three learning strategies. First, for the problem of insufficient algorithmic population diversity in SBOA, the best-rand exploration strategy is proposed, which utilizes the randomness and optimality of random individuals as well as optimal individuals to effectively improve the population diversity of the algorithm. Second, to address the imbalance in the exploration/exploitation phase of SBOA, the segmented balance strategy is proposed to improve the balance by segmenting the individuals in the population, targeting individuals of different natures with different degrees of exploration and exploitation performance, and improving the quality of the FS subset when the algorithm is solved. Finally, for the problem of insufficient exploitation performance of SBOA, a four-role exploitation strategy is proposed, which strengthens the effective exploitation ability of the algorithm and enhances the classification accuracy of the FS subset by different degrees of guidance through the four natures of individuals in the population. Subsequently, the proposed BSFSBOA-based FS method is applied to solve 36 FS problems involving low, medium, and high dimensions, and the experimental results show that, compared to SBOA, BSFSBOA improves the performance of classification accuracy by more than 60%, also ranks first in feature subset size, obtains the least runtime, and confirms that the BSFSBOA-based FS method is a robust FS method with efficient solution performance, high stability, and high practicality.