Image partitioning into convex polygons - Inria - Institut national de recherche en sciences et technologies du numérique
Conference Papers Year : 2015

Image partitioning into convex polygons

Abstract

The over-segmentation of images into atomic regions has become a standard and powerful tool in Vision. Traditional superpixel methods, that operate at the pixel level, cannot directly capture the geometric information disseminated into the images. We propose an alternative to these methods by operating at the level of geometric shapes. Our algorithm partitions images into convex polygons. It presents several interesting properties in terms of geometric guarantees , region compactness and scalability. The overall strategy consists in building a Voronoi diagram that conforms to preliminarily detected line-segments, before homogenizing the partition by spatial point process distributed over the image gradient. Our method is particularly adapted to images with strong geometric signatures, typically man-made objects and environments. We show the potential of our approach with experiments on large-scale images and comparisons with state-of-the-art superpixel methods.
Fichier principal
Vignette du fichier
paper.pdf (9.48 Mo) Télécharger le fichier
Vignette du fichier
teaser.jpg (477.87 Ko) Télécharger le fichier
Vignette du fichier
teaser.png (2.22 Mo) Télécharger le fichier
Origin Files produced by the author(s)
Format Figure, Image
Origin Files produced by the author(s)
Format Figure, Image
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01140320 , version 1 (08-04-2015)

Identifiers

  • HAL Id : hal-01140320 , version 1

Cite

Liuyun Duan, Florent Lafarge. Image partitioning into convex polygons. IEEE conference on Computer Vision and Pattern Recognition (CVPR), Jun 2015, Boston, United States. ⟨hal-01140320⟩
462 View
2296 Download

Share

More