FAST GREEDY ALGORITHM FOR ACTIVE CONTOURS

被引：50

作者：

LAM, KM

YAN, H

机构：

[1] Department of Electrical Engineering, Sydney University

来源：

ELECTRONICS LETTERS | 1994年 / 30卷 / 01期

关键词：

SEGMENTATION; IMAGE PROCESSING;

D O I：

10.1049/el:19940040

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

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.

引用

页码：21 / 23

页数：3