The existing greedy snake algorithm (GSA) suffers from some problems, such as three forces are unbalance and the extracting contour on concave region is unsatisfactory. This paper presents an algorithm, called balanced greedy snake algorithm (BGSA), for solving objective contour extraction problem. BGSA is compose of continuity force, curvature force and image force, which is similar to the origin GSA. Whereas, BGSA improved the computing rule of GSA to balance the influence of above three forces. Especially, BGSA can process the image with concave region well. The results of experiment show that BGSA is efficient and outperform the existing GSA.
Greedy snake algorithm Concave region Objective contour extraction Balanced
This is a preview of subscription content, log in to check access.
This work is supported by the National Natural Science Foundation of China (Grant No. 71301078), the Natural Science Foundation of Education Bureau of Jiangsu Province (Grant No. 16KJB520049) and the Natural Science Foundation of Huaian City (Grant No. HAB201709).