NICE: Superpixel Segmentation Using Non-Iterative Clustering with Efficiency

Superpixels intuitively over-segment an image into small compact regions with homogeneity. Owing to its outstanding performance on region description, superpixels have been widely used in various computer vision tasks as the substitution for pixels. Therefore, efficient algorithms for generating superpixels are still important for advanced visual tasks. In this work, two strategies are presented on conventional simple non-iterative clustering (SNIC) framework, aiming to improve the computational efficiency as well as segmentation performance. Firstly, inter-pixel correlation is introduced to eliminate the redundant inspection of neighboring elements. In addition, it strengthens the color identity in complicated texture regions, thus providing a desirable trade-off between runtime and accuracy. As a result, superpixel centroids are evolved more efficiently and accurately. For further accelerating the framework, a recursive batch processing strategy is proposed to eliminate unnecessary sorting operations. Therefore, a large number of neighboring elements can be assigned directly. Finally, the two strategies result in a novel synergetic non-iterative clustering with efficiency (NICE) method based on SNIC. Experimental results verify that it works 40% faster than conventional framework, while generating comparable superpixels for several quantitative metrics—sometimes even better.

[1]  Charless C. Fowlkes,et al.  Contour Detection and Hierarchical Image Segmentation , 2011, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  Zhengqin Li,et al.  Linear Spectral Clustering Superpixel , 2017, IEEE Transactions on Image Processing.

[3]  Huanxin Zou,et al.  A Likelihood-Based SLIC Superpixel Algorithm for SAR Images Using Generalized Gamma Distribution , 2016, Sensors.

[4]  Baolong Guo,et al.  A Two-Stage Gradient Ascent-Based Superpixel Framework for Adaptive Segmentation , 2019 .

[5]  Kang-Sun Choi,et al.  Subsampling-based acceleration of simple linear iterative clustering for superpixel segmentation , 2016, Comput. Vis. Image Underst..

[6]  Xiao Ma,et al.  Superpixel segmentation: A benchmark , 2017, Signal Process. Image Commun..

[7]  Wenbin Zou,et al.  Saliency Tree: A Novel Saliency Detection Framework , 2014, IEEE Transactions on Image Processing.

[8]  Amaury Lendasse,et al.  Parameter-free image segmentation with SLIC , 2018, Neurocomputing.

[9]  Pascal Fua,et al.  SLIC Superpixels Compared to State-of-the-Art Superpixel Methods , 2012, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[10]  Nicolas Papadakis,et al.  Robust superpixels using color and contour features along linear path , 2018, Comput. Vis. Image Underst..

[11]  Yong-Jin Liu,et al.  Intrinsic Manifold SLIC: A Simple and Efficient Method for Computing Content-Sensitive Superpixels , 2018, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[12]  Anlong Ming,et al.  Dynamic Random Walk for Superpixel Segmentation , 2020, IEEE Transactions on Image Processing.

[13]  Zheng Pei,et al.  PFS: Particle-Filter-Based Superpixel Segmentation , 2018, Symmetry.

[14]  Bastian Leibe,et al.  Superpixels: An evaluation of the state-of-the-art , 2016, Comput. Vis. Image Underst..

[15]  Qiang Du,et al.  Centroidal Voronoi Tessellations: Applications and Algorithms , 1999, SIAM Rev..