The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.11 - Nov. (2012 vol.34)
pp: 2274-2282
R. Achanta , Images & Visual Representation Group, Ecole Polytech. Fed. de Lausanne, Lausanne, Switzerland
A. Shaji , Images & Visual Representation Group, Ecole Polytech. Fed. de Lausanne, Lausanne, Switzerland
K. Smith , Zurich Light Microscopy Center, ETH Zurich, Zurich, Switzerland
A. Lucchi , Comput. Vision Lab., Polytech. Fed. de Lausanne, Lausanne, Switzerland
P. Fua , Comput. Vision Lab., Polytech. Fed. de Lausanne, Lausanne, Switzerland
Sabine Süsstrunk , Images & Visual Representation Group, Ecole Polytech. Fed. de Lausanne, Lausanne, Switzerland
ABSTRACT
Computer vision applications have come to rely increasingly on superpixels in recent years, but it is not always clear what constitutes a good superpixel algorithm. In an effort to understand the benefits and drawbacks of existing methods, we empirically compare five state-of-the-art superpixel algorithms for their ability to adhere to image boundaries, speed, memory efficiency, and their impact on segmentation performance. We then introduce a new superpixel algorithm, simple linear iterative clustering (SLIC), which adapts a k-means clustering approach to efficiently generate superpixels. Despite its simplicity, SLIC adheres to boundaries as well as or better than previous methods. At the same time, it is faster and more memory efficient, improves segmentation performance, and is straightforward to extend to supervoxel generation.
INDEX TERMS
Clustering algorithms, Image segmentation, Complexity theory, Image color analysis, Image edge detection, Measurement uncertainty, Approximation algorithms, k-means, Superpixels, segmentation, clustering
CITATION
R. Achanta, A. Shaji, K. Smith, A. Lucchi, P. Fua, Sabine Süsstrunk, "SLIC Superpixels Compared to State-of-the-Art Superpixel Methods", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.34, no. 11, pp. 2274-2282, Nov. 2012, doi:10.1109/TPAMI.2012.120
REFERENCES
[1] S. Avidan and A. Shamir, "Seam Carving for Content-Aware Image Resizing," ACM Trans. Graphics, vol. 26, no. 3, Article 10, 2007.
[2] A. Ayvaci and S. Soatto, "Motion Segmentation with Occlusions on the Superpixel Graph," Proc. Workshop Dynamical Vision, Oct. 2009.
[3] Y. Boykov and M. Jolly, "Interactive Graph Cuts for Optimal Boundary and Region Segmentation of Objects in N-D Images," Proc. IEEE Int'l Conf. Computer Vision, 2001.
[4] D. Comaniciu and P. Meer, "Mean Shift: A Robust Approach toward Feature Space Analysis," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 24, no. 5, pp. 603-619, May 2002.
[5] T. Cour, F. Benezit, and J. Shi, "Spectral Segmentation with Multiscale Graph Decomposition," Proc. IEEE Conf. Computer Vision and Pattern Recognition, 2005.
[6] C. Elkan, "Using the Triangle Inequality to Accelerate K-Means," Proc. Int'l Conf. Machine Learning, 2003.
[7] M. Everingham, L. Van Gool, C.K.I. Williams, J. Winn, and A. Zisserman, "The PASCAL Visual Object Classes Challenge," Int'l J. Computer Vision, vol. 88, no. 2, pp. 303-338, June 2010.
[8] P. Felzenszwalb and D. Huttenlocher, "Efficient Graph-Based Image Segmentation," Int'l J. Computer Vision, vol. 59, no. 2, pp. 167-181, Sept. 2004.
[9] B. Fulkerson, A. Vedaldi, and S. Soatto, "Class Segmentation and Object Localization with Superpixel Neighborhoods," Proc. IEEE Int'l Conf. Computer Vision, 2009.
[10] J.M. Gonfaus, X. Boix, J. Weijer, A. Bagdanov, J. Serrat, and J. Gonzalez, "Harmony Potentials for Joint Classification and Segmentation" Proc. IEEE Conf. Computer Vision and Pattern Recognition, 2010.
[11] S. Gould, J. Rodgers, D. Cohen, G. Elidan, and D. Koller, "Multi-Class Segmentation with Relative Location Prior," Int'l J. Computer Vision, vol. 80, no. 3, pp. 300-316, 2008.
[12] T. Kanungo, D.M. Mount, N.S. Netanyahu, C.D. Piatko, R. Silverman, and A.Y. Wu, "A Local Search Approximation Algorithm for K-Means Clustering," Proc. 18th Ann. Symp. Computational Geometry, pp. 10-18, 2002.
[13] A. Kumar, Y. Sabharwal, and S. Sen, "A Simple Linear Time (1+e)-Approximation Algorithm for K-Means Clustering in Any Dimensions," Proc. Ann. IEEE Symp. Foundations of Computer Science, pp. 454-462, 2004.
[14] V. Kwatra, A. Schodl, I. Essa, G. Turk, and A. Bobick, "Graphcut Textures: Image and Video Synthesis Using Graph Cuts," ACM Trans. Graphics, vol. 22, no. 3, pp. 277-286, July 2003.
[15] A. Levinshtein, A. Stere, K. Kutulakos, D. Fleet, S. Dickinson, and K. Siddiqi, "Turbopixels: Fast Superpixels Using Geometric Flows," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 31, no. 12, pp. 2290-2297, Dec. 2009.
[16] Y. Li, J. Sun, C.-K. Tang, and H.-Y. Shum, "Lazy Snapping," ACM Trans. Graphics, vol. 23, no. 3, pp. 303-308, 2004.
[17] S.P. Lloyd, "Least Squares Quantization in PCM," IEEE Trans. Information Theory, vol. 28, no. 2, pp. 129-137, Mar. 1982.
[18] A. Lucchi, K. Smith, R. Achanta, V. Lepetit, and P. Fua, "A Fully Automated Approach to Segmentation of Irregularly Shaped Cellular Structures in EM Images," Proc. Int'l Conf. Medical Image Computing and Computer Assisted Intervention, 2010.
[19] A. Lucchi, K. Smith, R. Achanta, G. Knott, and P. Fua, "Supervoxel-Based Segmentation of Mitochondria in EM Image Stacks with Learned Shape Features," IEEE Trans. Medical Imaging, vol. 30, no. 11, pp. 474-486, Feb. 2011.
[20] D. Martin, C. Fowlkes, D. Tal, and J. Malik, "A Database of Human Segmented Natural Images and Its Application to Evaluating Segmentation Algorithms and Measuring Ecological Statistics," Proc. IEEE Int'l Conf. Computer Vision, July 2001.
[21] A. Moore, S. Prince, J. Warrell, U. Mohammed, and G. Jones, "Superpixel Lattices," Proc. IEEE Conf. Computer Vision and Pattern Recognition, 2008.
[22] G. Mori, "Guiding Model Search Using Segmentation," Proc. IEEE Int'l Conf. Computer Vision, 2005.
[23] J. Shi and J. Malik, "Normalized Cuts and Image Segmentation," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 22, no. 8, pp. 888-905, Aug. 2000.
[24] J. Shotton, J. Winn, C. Rother, and A. Criminisi, "TextonBoost for Image Understanding: Multi-Class Object Recognition and Segmentation by Jointly Modeling Texture, Layout, and Context," Int'l J. Computer Vision, vol. 81, no. 1, pp. 2-23, Jan. 2009.
[25] A. Vedaldi and S. Soatto, "Quick Shift and Kernel Methods for Mode Seeking," Proc. European Conf. Computer Vision, 2008.
[26] O. Veksler, Y. Boykov, and P. Mehrani, "Superpixels and Supervoxels in an Energy Optimization Framework," Proc. European Conf. Computer Vision, 2010.
[27] O. Verevka and J.W. Buchanan, "Local K-Means Algorithm for Color Image Quantization," Proc. Graphics Interface, pp. 128-135, 1995.
[28] L. Vincent and P. Soille, "Watersheds in Digital Spaces: An Efficient Algorithm Based on Immersion Simulations," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 13, no. 6, pp. 583-598, June 1991.
[29] Y. Yang, S. Hallman, D. Ramanan, and C. Fawlkes, "Layered Object Detection for Multi-Class Segmentation," Proc. IEEE Conf. Computer Vision and Pattern Recognition, 2010.
[30] C.L. Zitnick and S.B. Kang, "Stereo for Image-Based Rendering Using Image Over-Segmentation," Int'l J. Computer Vision, vol. 75, pp. 49-65, Oct. 2007.
20 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool