Loading...
Please wait, while we are loading the content...
Similar Documents
Correspondence a fast recursive shortest spanning tree for image segmentation and edge detection.
| Content Provider | CiteSeerX |
|---|---|
| Author | Kwok, S. H. Constantinides, A. G. |
| Abstract | Abstract—This correspondence presents a fast recursive shortest span-ning tree algorithm for image segmentation and edge detection. The conventional algorithm requires a complexity of 0(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. I. |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Edge Detection Image Segmentation Fast Recursive Shortest Spanning Tree Conventional Algorithm Fast Algorithm Span-ning Tree Algorithm Total Memory Requirement |
| Content Type | Text |
