Description: Snake proposed an adaptive algorithm, the initial envelope for each point on, in accordance with the Greedy algorithm in the energy formula of the neighborhood points of energy. If the neighborhood does not contain the target contour, the radius will be neighborhood increased, again the neighborhood of the points of energy, until the neighborhood of the contour points so far included. The algorithm only one iteration object contours can be obtained, but also increases the initial envelope radius of convergence, and can more effectively deal with convex edge of the case of high curvature. comparative experiments illustrate the effectiveness of this approach.
To Search:
File list (Check if you may need any files):
邻域自适应调整的Snake算法.pdf
Download