Publication

Superpixels and Polygons using Simple Non-Iterative Clustering

Radhakrishna Achanta
2017
Conference Papers

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-the-art algorithms on quantitative benchmarks.

Official source

https://infoscience.epfl.ch/entities/publication/cc4183ea-2c7d-43a9-9c55-917969fc596e

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Superpixels and Polygons using Simple Non-Iterative Clustering

Chat with Graph Search

Quadratic serendipity element shape functions on general planar polygons

Localizing Polygonal Objects in Man-Made Environments

Can One Hear the Shape of a Room: The 2–D Polygonal Case