A FAST RECURSIVE SHORTEST SPANNING TREE FOR IMAGE SEGMENTATION AND EDGE-DETECTION

Authors
KWOK SH CONSTANTINIDES AG
Citation
Sh. Kwok et Ag. Constantinides, A FAST RECURSIVE SHORTEST SPANNING TREE FOR IMAGE SEGMENTATION AND EDGE-DETECTION, IEEE transactions on image processing, 6(2), 1997, pp. 328-332
Citations number
11
Categorie Soggetti
Computer Sciences, Special Topics","Engineering, Eletrical & Electronic","Computer Science Software Graphycs Programming","Computer Science Theory & Methods
Journal title
IEEE transactions on image processing → ACNP
ISSN journal
10577149
Volume
6
Issue
2
Year of publication
1997
Pages
328 - 332
Database
ISI
SICI code
1057-7149(1997)6:2<328:AFRSST>2.0.ZU;2-J
Abstract
This correspondence presents a fast recursive shortest spanning tree a lgorithm for image segmentation and edge detection, The conventional a lgorithm requires a complexity of o(n(2)) for an image of rt pixels, w hile 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.