Fast greedy algorithm for active contours

Kin Man Lam, Hong Yan

Research output: Journal article publicationJournal articleAcademic researchpeer-review

63 Citations (Scopus)


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.
Original languageEnglish
Pages (from-to)21-23
Number of pages3
JournalElectronics Letters
Issue number1
Publication statusPublished - 1 Jun 1994
Externally publishedYes


  • Image processing
  • Segmentation

ASJC Scopus subject areas

  • Electrical and Electronic Engineering


Dive into the research topics of 'Fast greedy algorithm for active contours'. Together they form a unique fingerprint.

Cite this