A method of controlling snakes that combines speed, flexibility, and simplicity is presented. It is compared to the original variational calculus method of M. Kass et al. (1987) and the dynamic programming method developed by A.A. Amini et al. (1988) and found to be comparable in final results, while being faster than dynamic programming and more stable and flexible for including hard constraints than the variational calculus approach. The introduction of the concept of curvature highlights the problem of how to approximate curvature when a curve is represented by a set of discrete points. The advantages and disadvantages of a number of different approximations of curvature are pointed out.<>


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A fast algorithm for active contours


    Contributors:
    Williams, D.J. (author) / Shah, M. (author)


    Publication date :

    1990-01-01


    Size :

    318681 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Fast Active Contours for Sampling

    Hernandez, Jorge / Prieto, Flavio / Redarce, Tanneguy | IEEE | 2006


    Gradient vector flow fast geodesic active contours

    Paragios, N. / Mellina-Gottardo, O. / Ramesh, V. | IEEE | 2001


    Gradient Vector Flow Fast Geodesic Active Contours

    Paragios, N. / Mellina-Gotardo, O. / Ramesh, V. et al. | British Library Conference Proceedings | 2001



    A Fast Multigrid Implicit Algorithm for the Evolution of Geodesic Active Contours

    Papandreou, G. / Maragos, P. / IEEE Computer Society | British Library Conference Proceedings | 2004