Fast greedy algorithm for active contours
Research output: Journal Publications and Reviews (RGC: 21, 22, 62) › 21_Publication in refereed journal › peer-review
|Journal / Publication||Electronics Letters|
|Publication status||Published - 6 Jan 1994|
|Link to Scopus||https://www.scopus.com/record/display.uri?eid=2-s2.0-0028766231&origin=recordpage|
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.