Fast greedy algorithm for active contours

Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review

64 Scopus Citations
Scopus Metrics
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

Link(s)

DOI

DOI
Check@CityULib
Link to Scopus https://www.scopus.com/record/display.uri?eid=2-s2.0-0028766231&origin=recordpage
Permanent Link https://scholars.cityu.edu.hk/en/publications/publication(3af8905c-0a3c-4d63-97a8-f9ed755140e5).html

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.

Fingerprint

Publication fingerprints text

100
Active Contour Engineering
100
Greedy Algorithm Engineering
33
Computing Time Engineering
33
Fast Algorithm Engineering
33
Energy Minimisation Engineering
33
Iterative Method Mathematics
Full Fingerprint ›

Citation Format(s)

[ RIS ] [ BibTeX ]
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 - Publication in refereed journal › peer-review