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.
| Original language | English |
|---|---|
| Pages (from-to) | 21-23 |
| Number of pages | 3 |
| Journal | Electronics Letters |
| Volume | 30 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 1 Jun 1994 |
| Externally published | Yes |
Keywords
- Image processing
- Segmentation
ASJC Scopus subject areas
- Electrical and Electronic Engineering