Image partitioning into convex polygons

Liuyun Duan 1 Florent Lafarge 1
1 TITANE - Geometric Modeling of 3D Environments
CRISAM - Inria Sophia Antipolis - Méditerranée
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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [32 references]  Display  Hide  Download


https://hal.inria.fr/hal-01140320
Contributor : Florent Lafarge <>
Submitted on : Wednesday, April 8, 2015 - 1:28:39 PM
Last modification on : Friday, July 20, 2018 - 10:12:05 AM
Long-term archiving on : Thursday, July 9, 2015 - 10:41:27 AM

Files

paper.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01140320, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

562

Files downloads

3313