Manifold SLIC: A Fast Method to Compute Content-Sensitive Superpixels

Citations Over TimeTop 10% of 2016 papers

Abstract

Superpixels are perceptually meaningful atomic regions that can effectively capture image features. Among various methods for computing uniform superpixels, simple linear iterative clustering (SLIC) is popular due to its simplicity and high performance. In this paper, we extend SLIC to compute content-sensitive superpixels, i.e., small superpixels in content-dense regions (e.g., with high intensity or color variation) and large superpixels in content-sparse regions. Rather than the conventional SLIC method that clusters pixels in ℝ 5 , we map the image I to a 2-dimensional manifold M ⊂ ℝ 5 , whose area elements are a good measure of the content density in I. We propose an efficient method to compute restricted centroidal Voronoi tessellation (RCVT) - a uniform tessellation - on M, which induces the content-sensitive superpixels in I. Unlike other algorithms that characterize content-sensitivity by geodesic distances, manifold SLIC tackles the problem by measuring areas of Voronoi cells on M, which can be computed at a very low cost. As a result, it runs 10 times faster than the state-of-the-art content-sensitive superpixels algorithm. We evaluate manifold SLIC and seven representative methods on the BSDS500 benchmark and observe that our method outperforms the existing methods.

Related Papers

• → Deletion in Abstract Voronoi Diagrams in Expected Linear Time(2018)3 cited
• GIS-based Approximation Algorithm for Constructing Voronoi Diagrams with General Generators(2004)
• → Deletion in abstract Voronoi diagrams in expected linear time and related problems(2018)1 cited
• → Voronoi model-building genetic algorithm(2005)
• → Grow in accessible directions, like Voronoi diagrams(2020)