Journal
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
Volume 34, Issue 11, Pages 2274-2281Publisher
IEEE COMPUTER SOC
DOI: 10.1109/TPAMI.2012.120
Keywords
Superpixels; segmentation; clustering; k-means
Funding
- National Competence Center in Research on Mobile Information and Communication Systems (NCCR-MICS)
- Swiss National Science Foundation [5005-67322]
- EU ERC project MicroNano
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available