Fast greedy algorithm for active contours

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

63 Scopus Citations
View graph of relations

Author(s)

Detail(s)

Original languageEnglish
Pages (from-to)21-23
Journal / PublicationElectronics Letters
Volume30
Issue number1
Publication statusPublished - 6 Jan 1994
Externally publishedYes

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.

Citation Format(s)

Fast greedy algorithm for active contours. / Lam, K. M.; Yan, H.

In: Electronics Letters, Vol. 30, No. 1, 06.01.1994, p. 21-23.

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review