Journal
INTERNATIONAL JOURNAL OF COMPUTER VISION
Volume 111, Issue 3, Pages 298-314Publisher
SPRINGER
DOI: 10.1007/s11263-014-0744-2
Keywords
Superpixels; Segmentation; over-segmentation; hill-climbing; clustering; histograms
Categories
Funding
- European Commission [FP7 ICT 248873, FP7 ICT 248314]
Ask authors/readers for more resources
Superpixel algorithms aim to over-segment the image by grouping pixels that belong to the same object. Many state-of-the-art superpixel algorithms rely on minimizing objective functions to enforce color homogeneity. The optimization is accomplished by sophisticated methods that progressively build the superpixels, typically by adding cuts or growing superpixels. As a result, they are computationally too expensive for real-time applications. We introduce a new approach based on a simple hill-climbing optimization. Starting from an initial superpixel partitioning, it continuously refines the superpixels by modifying the boundaries. We define a robust and fast to evaluate energy function, based on enforcing color similarity between the boundaries and the superpixel color histogram. In a series of experiments, we show that we achieve an excellent compromise between accuracy and efficiency. We are able to achieve a performance comparable to the state-of-the-art, but in real-time on a single Intel i7 CPU at 2.8 GHz.
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