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

Authors:
S. H. Kwok;A. G. Constantinides
Affiliations:
Dept. of Electron. Eng., Hong Kong Polytech., Kowloon;-
Venue:
IEEE Transactions on Image Processing
Year:
1997

Citing 0
Cited 6

Geometric Analysis of Particle Motion in a Vector Image Field

Journal of Mathematical Imaging and Vision
Scene-based event detection for baseball videos

Journal of Visual Communication and Image Representation
A spatially aware generative model for image classification, topic discovery and segmentation

ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
Region merging techniques using information theory statistical measures

IEEE Transactions on Image Processing
Multiview depth coding based on combined color/depth segmentation

Journal of Visual Communication and Image Representation
A survey of graph theoretical approaches to image segmentation

Pattern Recognition

Quantified Score

Hi-index	0.01

Visualization

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(n2) 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