Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Lie, W.N.: Automatic target segmentation by locally adaptive image thresholding. IEEE Trans. Image Process. 4(7), 1036–1041 (1995)
McInernery, T., Terzopolous, D.: Deformable models in medical image analysis: a survey. Med. Image Anal. 1(2), 91–108 (1996)
Jain, A.K., Smith, S.P., Backer, E.: Segmentation of muscle cell pictures: a preliminary study. IEEE Trans. Pattern Anal. Mach. Intell. 2(3), 232–242 (1980)
Fok, Y.L., Chan, J.C.K., Chin, R.T.: Automated analysis of nerve cell images using active contour models. IEEE Trans. Med. Image 15(3), 353–368 (1996)
Ginneken, B., Frangi, A.F., Staal, J.J.: Active shape model segmentation with optimal features. IEEE Trans. Med. Image 21(8), 924–933 (2002)
Kass, M., Witkin, A., Terzopoulos, D.: Snakes: active contour models. Int. J. Comput. Vis. 1(4), 321–331 (1987)
Williams, D.J., Shah, M.: A fast algorithm for active contours and curvature estimation. Comput. Vis. Graph. Image Process. 55, 14–26 (1992)
Lam, K.M., Yan, H.: Fast algorithm for locating head boundaries. J. Electron. Image 3(4), 352–359 (1994)
Mustafa, S., Lam, K.M., Yan, H.: A faster converging snake algorithm to locate object boundaries. IEEE Trans. Image Process. 15(5), 1182–1191 (2013)
Acknowledgement
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).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Cheng, L., Zheng, L., Wang, H., Song, Y., Gao, J. (2020). A New Balanced Greedy Snake Algorithm. In: Liu, Q., Mısır, M., Wang, X., Liu, W. (eds) The 8th International Conference on Computer Engineering and Networks (CENet2018). CENet2018 2018. Advances in Intelligent Systems and Computing, vol 905. Springer, Cham. https://doi.org/10.1007/978-3-030-14680-1_62
Download citation
DOI: https://doi.org/10.1007/978-3-030-14680-1_62
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-14679-5
Online ISBN: 978-3-030-14680-1
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)