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

共 11 条

[1]

ALATAN AA, 1992, TECHNICAL REPORT VER

[2] SEGMENTED-IMAGE CODING - PERFORMANCE COMPARISON WITH THE DISCRETE COSINE TRANSFORM [J].

BIGGAR, MJ ;

MORRIS, OJ ;

CONSTANTINIDES, AG .

IEE PROCEEDINGS-F RADAR AND SIGNAL PROCESSING, 1988, 135 (02) :121-132

[3] VIDEO CODING BY SEGMENTING MOTION VECTORS AND FRAME DIFFERENCES [J].

CHAE, SB ;

KIM, JS ;

PARK, RH .

OPTICAL ENGINEERING, 1993, 32 (04) :870-876

[4] EFFICIENT REGION-BASED MOTION ESTIMATION AND SYMMETRY ORIENTED SEGMENTATION FOR IMAGE SEQUENCE CODING [J].

CICCONI, P ;

NICOLAS, H .

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, 1994, 4 (03) :357-364

[5]

Gilge M., 1989, Signal Processing: Image Communication, V1, P153, DOI 10.1016/0923-5965(89)90007-6

[6]

MORRIS OJ, 1986, IEE PROC-F, V133, P146, DOI 10.1049/ip-f-1.1986.0025

[7]

MORRIS OJ, 1987, P 11 C

[8]

MORRIS OJ, P ICASSP 88, V1, P1108

[9]

MORRIS OJ, 1987, INT C DIG SIGN PROC

[10] SEGMENTED CODING OF DIGITAL IMAGE SEQUENCES [J].

SORYANI, M ;

CLARKE, RJ .

IEE PROCEEDINGS-I COMMUNICATIONS SPEECH AND VISION, 1992, 139 (02) :212-218

← 1 2 →