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

The fast recursive shortest spanning tree (FRSST) algorithm achieves image segmentation and edge detection in a running time of O(n) for an image of n pixels. The region-based mapping procedure and non-requirement of a sorting process makes FRSST algorithm faster than conventional algorithms. The memory requirements also decrease by 20% or more, specifically for large size images. FRSST utilizes a spanning subtree to extend the spanning tree and makes use of updating neighboring link weights.