TY - JOUR
T1 - Fast greedy algorithm for active contours
AU - Lam, K. M.
AU - Yan, H.
PY - 1994/1/6
Y1 - 1994/1/6
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0028766231&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-0028766231&origin=recordpage
U2 - 10.1049/el:19940040
DO - 10.1049/el:19940040
M3 - 21_Publication in refereed journal
VL - 30
SP - 21
EP - 23
JO - Electronics Letters
JF - Electronics Letters
SN - 0013-5194
IS - 1
ER -