Title :
A fast recursive shortest spanning tree for image segmentation and edge detection
Author :
Kwok, S.H. ; Constantinides, A.G.
Author_Institution :
Dept. of Electron. Eng., Hong Kong Polytech., Kowloon, Hong Kong
fDate :
2/1/1997 12:00:00 AM
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
Keywords :
computational complexity; edge detection; image segmentation; trees (mathematics); complexity; edge detection; fast recursive shortest spanning tree; image segmentation; total memory requirement; Biomedical imaging; Flowcharts; Image coding; Image color analysis; Image edge detection; Image segmentation; Pixel; Robot vision systems; Sorting; Video coding;
Journal_Title :
Image Processing, IEEE Transactions on
