Fast greedy algorithm for active contours

Kin‐Man Lam, Hong Yan

Electronics Letters · 1994 · 84 citations · 0 references

Concepts

Abstract

The greedy algorithm is a fast iterative method for energy minimisation of snakes for image contour detection. In the Letter, an even faster algorithm is proposed. The new algorithm has the same performance as the conventional greedy algorithm, but reduces the computing time by 30% on average.