By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
S. H. Kwok ; Dept. of Electron. Eng., Hong Kong Polytech., Kowloon, Hong Kong ; A. G. Constantinides

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

Published in:

IEEE Transactions on Image Processing  (Volume:6 ,  Issue: 2 )