Revised C++ implementations of two popular superpixel algorithms, SEEDS and FH, which are shown to outperform the original implementations.
This article presents an implementation of Felzenszwalb and Huttenlocher’s [1] graph-based image segmentation algorithm. The implementation is compared to the original implementation by Felzenszwalb in terms of Boundary Recall, Undersegmentation Error and Explained Variation, as used for evaluating superpixel algorithms. In addition, qualitative results are provided. The implementation is publicly available on GitHub.
A comprehensive comparison and evaluation of 28 superpixel algorithms on 5 different datasets; published in CVIU and GCPR.
Running C++ projects on Travis CI may be challenging depending on the libraries used. Here I briefly describe how to run OpenCV and Google GLog on Travis CI.
Efficient C++ implementation for hierarchical graph-based image segmentation.
Efficient C++ implementation of iPiano, a proximal algorithm with inertial force for non-convex and non-smooth optimization; including applications to image segmentation.
There are many articles on preparing for coding interviews; this is my personal reading list for preparing for a Microsoft Interview (from a C++ perspective).
A comparison of several state-of-the-art superpixel algorithms using an extended version of the Berkeley Segmentation Benchmark.