A fast recursive shortest spanning tree for image segmentation and edge detection

被引：41

作者：

Kwok, SH ^{[1
]}

Constantinides, AG ^{[1
]}

机构：

[1] UNIV LONDON IMPERIAL COLL SCI TECHNOL & MED,DEPT ELECT & ELECT ENGN,LONDON SW7 2BT,ENGLAND

来源：

IEEE TRANSACTIONS ON IMAGE PROCESSING | 1997年 / 6卷 / 02期

关键词：

D O I：

10.1109/83.551705

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

This correspondence presents a fast recursive shortest spanning tree algorithm for image segmentation and edge detection, The conventional algorithm requires a complexity of o(n(2)) for an image of rt pixels, while the complexity of our approach is bounded by O(n), which is a new lower bound for algorithms of this kind. The total memory requirement of our fast algorithm is 20% smaller.

引用

页码：328 / 332

页数：5