Image segmentation algorithm combining mean shift with minimum spanning tree

This paper presents an image segmentation algorithm combining mean-shift with the minimum spanning tree, in order to improve the operating efficiency of the classic mean shift. The algorithm first selects a smaller spatial bandwidth, and applies the mean shift to over-segment image at a faster speed. Then, we regard the over-segmentation region as the basic unit of subsequent procedure to construct a weighted region adjacency graph, and then use the minimum spanning tree algorithm to merge over-segmentation image. The experimental results verify that this algorithm, on the premise of ensuring the quality of image segmentation, substantially increases the speed of the classic mean shift segmentation algorithm.