DocumentCode
1021164
Title
Fast greedy algorithm for active contours
Author
Lam, Kin-Man ; Yan, Heng-Chao
Author_Institution
Dept. of Electr. Eng., Sydney Univ., NSW
Volume
30
Issue
1
fYear
1994
fDate
1/6/1994 12:00:00 AM
Firstpage
21
Lastpage
23
Abstract
The greedy algorithm is a fast iterative method for energy minimisation of snakes for image contour detection. 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
image segmentation; iterative methods; splines (mathematics); computing time; energy minimisation; fast iterative method; greedy algorithm; image contour detection; snakes; splines;
fLanguage
English
Journal_Title
Electronics Letters
Publisher
iet
ISSN
0013-5194
Type
jour
DOI
10.1049/el:19940040
Filename
260576
Link To Document