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

S H Kwok; A G Constantinides

doi:10.1109/83.551705

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

IEEE Trans Image Process. 1997;6(2):328-32. doi: 10.1109/83.551705.

Authors

S H Kwok¹, A G Constantinides

Affiliation

¹ Dept. of Electron. Eng., Hong Kong Polytech., Kowloon.

PMID: 18282927
DOI: 10.1109/83.551705

Abstract

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 n 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.