Transcription of SLIC Superpixels - kev-smith.com
{{id}} {{{paragraph}}}
slic Superpixels ?Radhakrishna Achanta, Appu Shaji, Kevin Smith, Aurelien Lucchi,Pascal Fua, and Sabine S usstrunkSchool of Computer and Communication Sciences (IC) Ecole Polytechnique F edrale de Lausanne (EPFL) are becoming increasingly popular for use incomputer vision applications. However, there are few algorithms thatoutput a desired number of regular, compact Superpixels with a low com-putational overhead. We introduce a novel algorithm that clusters pixelsin the combined five-dimensional color and image plane space to effi-ciently generate compact, nearly uniform Superpixels . The simplicity ofour approach makes it extremely easy to use a lone parameter specifiesthe number of Superpixels and the efficiency of the algorithm makes itvery practical. Experiments show that our approach produces superpix-els at a lower computational cost while achieving a segmentation qualityequal to or greater than four state-of-the-art methods, as measured byboundary recall and under-segmentation error.
SLIC Superpixels? Radhakrishna Achanta, Appu Shaji, Kevin Smith, Aurelien Lucchi, Pascal Fua, and Sabine Susstrunk School of Computer and Communication Sciences (IC)
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
{{id}} {{{paragraph}}}