Recursive Shortest Spanning Tree Algorithms for Image Segmentation

Image segmentation has an important role in image processing and the speed of the segmentation algorithm may become a drawback for some applications. This study analyzes the run time performances of some variations of the recursive shortest spanning tree algorithm (RSST) and proposes simple but effective modifications on these algorithms to improve their speeds. In addition, the effect of link weight cost function on the run time performance and the segmentation quality is examined. For further improvement in the run time performance of the fastest sequential method, a distributed RSST algorithm is also proposed and evaluated