［1］Kass M, Witkin A, Terzopoulos D. Snake, active contour models[A]. In: Proceedings of 1st International Conference on Computer Vision[C], London, 1987: 321～ 331.
[2]
［2］Amini A, Tehranic S. Using dynamic programming for minimizing the energy of active contour in the presence of hard constraints[A]. In: Proceedings of 2nd International Conference on Computer Vision [C], Los Alamitos, CA, USA 1988:95～99.
[3]
［4］Mirboseeini A R, Hong Yan. An optimally fast greedy algorithm for active contour[A]. In: Proceedings of IEEE International Symposium on Circuits and Systems [C], Hong Kong, China,1997:1189～1192.
［8］Renato O, Stehling Mario A, Nascimento, Alexandre X Falcao.An adaptive and efficient clustering-based approach for contentbased image retrieval in image databases [J]. IEEE Computer Society [ DB/OL ]. http: ∥computer. org/proceedings/ideas/1140/11400356abs. htm.
［3］Cobel L, Cohen I. A finite element method applied to new active contour models and 3D reconstruction from cross sections[A].In: Proceedings of 3rd International Conference on Computer Vision[C], Paris Ⅸ University, France, 1990:587～591.
[8]
［5］William D J, Shah M. A fast algorithm for active contours and curvature estimation[J]. Computer vision and graphics, Image processing: Image Understanding, 1992,55(1) :14～26.
