Fast simple linear iterative clustering for superpixel segmentation

In this paper, a fast implementation of simple linear iterative clustering is presented. By exploiting spatial redundancy within natural images, we successfully reduce the number of distance calculation. It is confirmed that the proposed method runs about two times faster than the conventional method with almost same segmentation results.