Approximating shapes in images with low-complexity polygons - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2020

Approximating shapes in images with low-complexity polygons

Muxingzi Li
  • Function : Author
  • PersonId : 1058547
Florent Lafarge
  • Function : Author
  • PersonId : 833647


We present an algorithm for extracting and vectorizing objects in images with polygons. Departing from a polygonal partition that oversegments an image into convex cells, the algorithm refines the geometry of the partition while labeling its cells by a semantic class. The result is a set of polygons, each capturing an object in the image. The quality of a configuration is measured by an energy that accounts for both the fidelity to input data and the complexity of the output polygons. To efficiently explore the configuration space, we perform splitting and merging operations in tandem on the cells of the polygonal partition. The exploration mechanism is controlled by a priority queue that sorts the operations most likely to decrease the energy. We show the potential of our algorithm on different types of scenes, from organic shapes to man-made objects through floor maps, and demonstrate its efficiency compared to existing vectorization methods.
Fichier principal
Vignette du fichier
CVPR2020_Mu.pdf (18.67 Mo) Télécharger le fichier
Vignette du fichier
building_extraction.jpg (2.71 Mo) Télécharger le fichier
building_extraction.png (8.95 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Format : Figure, Image

Dates and versions

hal-02526028 , version 1 (31-03-2020)


  • HAL Id : hal-02526028 , version 1


Muxingzi Li, Florent Lafarge, Renaud Marlet. Approximating shapes in images with low-complexity polygons. CVPR 2020 - IEEE Conference on Computer Vision and Pattern Recognition, Jun 2020, Seattle / Virtual, United States. ⟨hal-02526028⟩
457 View
574 Download


Gmail Facebook X LinkedIn More