SLIC Superpixels Compared to State-of-the-Art Superpixel Methods
Achanta, R. and Shaji, A. and Smith, K. and Lucchi, A. and Fua, P. and Süsstrunk, S.

SLIC Superpixels Comparedto State-of-the-Art Superpixel Methods.pdf 4.25MB
Type: Paper

Bibtex:
@ARTICLE{6205760,
author={Achanta, R. and Shaji, A. and Smith, K. and Lucchi, A. and Fua, P. and Süsstrunk, S.},
journal={Pattern Analysis and Machine Intelligence, IEEE Transactions on},
title={SLIC Superpixels Compared to State-of-the-Art Superpixel Methods},
year={2012},
volume={34},
number={11},
pages={2274-2282},
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.},
keywords={computer vision;image segmentation;iterative methods;pattern clustering;SLIC superpixels;computer vision;image boundary;k-means clustering approach;memory efficiency;segmentation performance;simple linear iterative clustering;superpixel generation;supervoxel generation;Approximation algorithms;Clustering algorithms;Complexity theory;Image color analysis;Image edge detection;Image segmentation;Measurement uncertainty;Superpixels;clustering;k-means;segmentation;Algorithms;Image Enhancement;Image Interpretation, Computer-Assisted;Pattern Recognition, Automated;Reproducibility of Results;Sensitivity and Specificity;Signal Processing, Computer-Assisted},
doi={10.1109/TPAMI.2012.120},
ISSN={0162-8828},
month={Nov},}


Send Feedback Start
   0.000007
DB Connect
   0.000503
Lookup hash in DB
   0.000433
Get torrent details
   0.000134
Get torrent details, finished
   0.000223
Get authors
   0.000037
Parse bibtex
   0.000075
Write header
   0.000224
get stars
   0.000139
home tab
   0.000207
render right panel
   0.000012
render ads
   0.000572
fetch current hosters
   0.000450
Done