Fast greedy algorithm for active contours

6 January 1994

journal article
Published by Institution of Engineering and Technology (IET) in Electronics Letters

Vol. 30 (1) , 21-23
https://doi.org/10.1049/el:19940040

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.

Keywords

FAST ITERATIVE METHOD
IMAGE CONTOUR DETECTION
COMPUTING TIME
ENERGY MINIMISATION
SNAKES
GREEDY ALGORITHM
SPLINES

This publication has 0 references indexed in Scilit: