Graph-Based Supervoxel Computation from Iterative Spanning Forest.

Supervoxel segmentation leads to major improvements in video analysis since it generates simpler but meaningful primitives (i.e., supervoxels). Thanks to the flexibility of the Iterative Spanning Forest (ISF) framework and recent strategies introduced by the Dynamic Iterative Spanning Forest (DISF) for superpixel computation, we propose a new graph-based method for supervoxel generation by using iterative spanning forest framework, so-called ISF2SVX, based on a pipeline composed by four stages: (a) graph creation; (b) seed oversampling; (c) IFT-based superpixel delineation; and (d) seed set reduction. Moreover, experimental results show that ISF2SVX is capable of effectively describing the video’s color variation through its supervoxels, while being competitive for the remaining metrics considered.