An enhanced seagull algorithm for multi-threshold image segmentation based on Kapur entropy

Abstract

Abstract To address the shortcomings of the Seagull Optimization Algorithm (SOA), such as poor distribution of individuals’ positions and low population diversity leading to susceptibility to local optima after the collision avoidance phase, an Enhanced Seagull Algorithm (ESOA) is proposed. Firstly, a chaos-guided mechanism is utilized to replace the original individual positions after collision avoidance with the mean of individual optima and current positions, effectively improving the distribution of the population. Secondly, a circular-topology neighborhood structure with random weights is introduced, allowing interaction between the current individual’s position and the information from its two adjacent optimal positions, thereby improving population clustering and enhancing diversity. Thirdly, a dynamic lens mapping strategy is employed to direct the optimal seagull individuals toward their newly generated mapped points, enhancing their ability to avoid local optima. ESOA is applied to the problem of multi-threshold image segmentation based on Kapur entropy, and experimental results demonstrate its effectiveness in improving segmentation performance.