The cookie-related information is fully under our control. These cookies are not used for any purpose other than those described here. Unibo policy
We consider the problem of splitting an image into a small number of convex polygons with vertices at subpixel resolution. Edges of resulting superpixels can have any direction and should adhere well to object boundaries. We introduce a Convex Constrained Mesh that accepts any straight line segments (or a straight-line graph based on a topological persistence) and outputs a complete mesh of convex polygons without small angles and with approximation guarantees for the given lines.
This presentation is part of Minisymposium “MS16 - Topological Image Analysis: Methods, Algorithms, Applications (3 parts)”
organized by: Patrizio Frosini (University of Bologna) , Massimo Ferri (University of Bologna) , Claudia Landi (University of Modena and Reggio Emilia) .