Access Restriction

Author Kwok, S. H. ♦ Constantinides, A. G.
Source CiteSeerX
Content type Text
File Format PDF
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Edge Detection ♦ Image Segmentation ♦ Fast Recursive Shortest Spanning Tree ♦ Conventional Algorithm ♦ Fast Algorithm ♦ Span-ning Tree Algorithm ♦ Total Memory Requirement
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.
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research
Education Level UG and PG ♦ Career/Technical Study