［2］Amini A, Tehrani S, Weymouth E. Using dynamic programming for minimizing the active contours in the presence of hard constraints [A]. In: Proceedings, Second International Conference on Computer Vision[C], New York, 1988: 95～99.
［6］Joines J, Houck C. On the use of non stationary penalty functions to solve constrained optimization problems with genetic algorithms [A]. In..IEEE International Symposium Evolutionary Computation[C], Orlando, FL, USA, 1994:579～584.
[4]
［7］Michalewicz Z. Genetic algorithms+data structures=evolution programs, AI Series[M], New York, Springer-Verlag, 1994.
[5]
［3］William D, Shah M. A fast algorithm for active contour and curvature estimation [J]. Computer Vision Graphics, Image Process, 1992,10(55): 14～26.
[6]
［5］Bersini H, Renders B. Hybridizing genetic algorithms with hillclimbing methods for global optimization: Two possible ways[A]. In.. IEEE International Symposium Evolutionary Computation[C]. Orlando, FL, USA, 1994..312～317.
[7]
［1］Kass M, Winkin A, Terzopoulos D. Snakes: Active contour models[A]. In:Proceedings of First International Conference On Computer Vision[C], London, 1987: 259～269.
