Achanta et al. proposed their superpixel algorithm "Simple Linear Iterative Clustering", short SLIC, in . The above paper compares SLIC to several superpixel algorithms with respect to Boundary Recall, Undersegmentation Error and runtime: Normalized Cuts , the approach proposed by Felzenswalb and Huttenlocher , Quick Shift , Watersheds  and Turbopixels .Superpixel segmentations generated by the original implementation of SLIC can be found in figure 1. Additionally, the VLFeat Library  provides an implementation of SLIC, see my article on running VLFeat's implementation of SLIC using C++ and CMake.
Update. Thorough evaluation of both implementations can be found in my bachelor thesis: Bachelor Thesis “Superpixel Segmentation Using Depth Information”.
What is your opinion on the summarized work? Or do you know related work that is of interest? Let me know your thoughts in the comments below or using the following platforms: