Skip to Main content Skip to Navigation
Conference papers

Approximating shapes in images with low-complexity polygons

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [39 references]  Display  Hide  Download


https://hal.inria.fr/hal-02526028
Contributor : Florent Lafarge <>
Submitted on : Tuesday, March 31, 2020 - 12:08:28 PM
Last modification on : Saturday, June 19, 2021 - 4:08:52 AM

Identifiers

  • HAL Id : hal-02526028, version 1

Citation

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⟩

Share

Metrics

Record views

487

Files downloads

2407