TL;DR
This paper provides a comprehensive evaluation and ranking of 28 state-of-the-art superpixel algorithms, offering insights into their performance, robustness, and suitability for various applications, thereby aiding researchers in selecting appropriate methods.
Contribution
It introduces a unified benchmark for superpixel algorithms, including parameter optimization, connectivity enforcement, and extended metrics for fair comparison and ranking.
Findings
Extended metrics enable performance comparison independent of superpixel count.
The benchmark reveals new top-performing algorithms and insights into robustness and runtime.
Publicly available implementations facilitate practical adoption and further research.
Abstract
Superpixels group perceptually similar pixels to create visually meaningful entities while heavily reducing the number of primitives for subsequent processing steps. As of these properties, superpixel algorithms have received much attention since their naming in 2003. By today, publicly available superpixel algorithms have turned into standard tools in low-level vision. As such, and due to their quick adoption in a wide range of applications, appropriate benchmarks are crucial for algorithm selection and comparison. Until now, the rapidly growing number of algorithms as well as varying experimental setups hindered the development of a unifying benchmark. We present a comprehensive evaluation of 28 state-of-the-art superpixel algorithms utilizing a benchmark focussing on fair comparison and designed to provide new insights relevant for applications. To this end, we explicitly discuss…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
