Optimization of Bayesian algorithms for multi-threshold image segmentation

The Bayesian optimization algorithm uses Bayesian networks as the probability model of its solution space. Although the research on this algorithm has steadily developed, there are still some problems in its application process, such as excessive computational complexity. To solve various problems in Bayesian algorithm, reduce its computational complexity, and enable it to better achieve image segmentation. The study chooses to improve the Bayesian algorithm on the basis of immune algorithm, and solves the problem of computational complexity by reducing the number of Bayesian network construction times, thereby improving the individual fitness of the population. Through simulation experiments, it has been shown that the average number of times the improved Bayesian algorithm reaches the optimal value is 30, which is higher than the traditional algorithm's 20 times. Its excellent optimization ability searches for the optimal threshold to complete image segmentation. The improved Bayesian optimization algorithm based on immune algorithm can effectively reduce computational complexity, shorten computational time, and improve convergence. And applying Bayesian algorithm to image segmentation has broadened the application field of the algorithm and found new exploration directions for image segmentation.