Kinetic partitioning into polygons. Our algorithm de- composes an image (left) into a partition of convex polygons. (right). While superpixel-based methods ...

We propose a kinetic approach that brings more flexibility on polygon shape and size. The key idea consists in progressively extending pre-detected line- ...

In our analysis, each image is partitioned into a number of non-overlapping, spatial regions. Each spatial region is viewed as a Region of Interest (ROI). A ...

To partition an image into polygons that capture the geometric structures contained in man-made environments. KIPPI : KInetic Polygonal Partitioning of Images.

This work proposes a kinetic approach that brings more flexibility on polygon shape and size and demonstrates that output partitions both contain less ...

Kinetic partitioning into polygons. Our algorithm de- composes an image (left) into a partition of convex polygons. (right). While superpixel-based methods ...

Our experiments demonstrate that output partitions both contain less polygons and better capture geometric structures than those delivered by existing methods.

KIPPI: KInetic Polygonal Partitioning of Images ... Recent works showed that floating polygons can be an interesting alternative to traditional superpixels, ...

This document provides instructions for running the executable Kippi.exe, which comes as supplementary material for the paper "KIPPI : KInetic Polygonal ...