资源分类
》 资源 》论文》Superpixels and Polygons using Simple Non-Iterative Clustering

Superpixels and Polygons using Simple Non-Iterative Clustering

2019-12-04 | |  48 |   37 |   0
Abstract We present an improved version of the Simple Linear Iterative Clustering (SLIC) superpixel segmentation. Unlike SLIC, our algorithm is non-iterative, enforces connectivity from the start, requires lesser memory, and is faster. Relying on the superpixel boundaries obtained using our algorithm, we also present a polygonal partitioning algorithm. We demonstrate that our superpixels as well as the polygonal partitioning are superior to the respective state-of-theart algorithms on quantitative benchmarks

上一篇：Superpixel-based Tracking-by-Segmentation using Markov Chains

下一篇：Surface Motion Capture Transfer with Gaussian Process Regression

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...