A comparison of several state-of-the-art superpixel algorithms using an extended version of the Berkeley Segmentation Benchmark.
There are several superpixel algorithms out there. One popular approach is called “Simple Linear Iterative Clustering” – short SLIC [1]. One implementation of SLIC is provided as part of the VLFeat library [2] which can be used from MatLab, but provides the C source code as well. This article shows how to use VLFeat’s implementation of SLIC from C++ using CMake.