mlsanityData to 7 Oct 2026

PolyR-CNN: R-CNN for end-to-end polygonal building outline extraction

arXiv 2407.14912 ↗First posted 20 Jul 2024cs.CVcited by 6

Not on the map. Why?

Abstract (arXiv)

Polygonal building outline extraction has been a research focus in recent years. Most existing methods have addressed this challenging task by decomposing it into several subtasks and employing carefully designed architectures. Despite their accuracy, such pipelines often introduce inefficiencies during training and inference. This paper presents an end-to-end framework, denoted as PolyR-CNN, which offers an efficient and fully integrated approach to predict vectorized building polygons and bounding boxes directly from remotely sensed images. Notably, PolyR-CNN leverages solely the features of the Region of Interest (RoI) for the prediction, thereby mitigating the necessity for complex designs. Furthermore, we propose a novel scheme with PolyR-CNN to extract detailed outline information from polygon vertex coordinates, termed vertex proposal feature, to guide the RoI features to predict more regular buildings. PolyR-CNN demonstrates the capacity to deal with buildings with holes through a simple post-processing method on the Inria dataset. Comprehensive experiments conducted on the CrowdAI dataset show that PolyR-CNN achieves competitive accuracy compared to state-of-the-art methods while significantly improving computational efficiency, i.e., achieving 79.2 Average Precision (AP), exhibiting a 15.9 AP gain and operating 2.5 times faster and four times lighter than the well-established end-to-end method PolyWorld. Replacing the backbone with a simple ResNet-50, PolyR-CNN maintains a 71.1 AP while running four times faster than PolyWorld.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 25 of its 41 references that are in the map. First posted on arXiv 20 Jul 2024.

Builds on

25 of 41 references.

References · 25

  1. 2017Attention Is All You Needcited by 59,932
  2. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  3. 2014Microsoft COCO: Common Objects in Contextcited by 17,498
  4. 2021Swin Transformer: Hierarchical Vision Transformer using Shifted Windowscited by 12,082
  5. 2015Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networkscited by 9,617
  6. 2020End-to-End Object Detection with Transformerscited by 7,384
  7. 2017Mask R-CNNcited by 7,259
  8. 2016Feature Pyramid Networks for Object Detectioncited by 5,021
  9. 2016Gaussian Error Linear Units (GELUs)cited by 3,431
  10. 2020Deformable DETR: Deformable Transformers for End-to-End Object Detectioncited by 3,410
  11. 2015Fast R-CNNcited by 2,930
  12. 2016Aggregated Residual Transformations for Deep Neural Networkscited by 2,540
13 more
  1. 2013Rich feature hierarchies for accurate object detection and semantic segmentationcited by 2,160
  2. 2019Generalized Intersection over Union: A Metric and A Loss for Bounding Box Regressioncited by 1,361
  3. 2020Sparse R-CNN: End-to-End Object Detection with Learnable Proposalscited by 494
  4. 2021Boundary IoU: Improving Object-Centric Image Segmentation Evaluationcited by 186
  5. 2018Efficient Interactive Annotation of Segmentation Datasets with Polygon-RNN++cited by 119
  6. 2017Annotating Object Instances with a Polygon-RNNcited by 88
  7. 2018Topological Map Extraction from Overhead Imagescited by 58
  8. 2021PolyWorld: Polygonal Building Extraction with Graph Neural Networks in Satellite Imagescited by 42
  9. 2020Convolutional Recurrent Network for Road Boundary Extractioncited by 33
  10. 2020Machine-learned Regularization and Polygonization of Building Segmentation Maskscited by 22
  11. 2022Accurate Polygonal Mapping of Buildings in Satellite Imagerycited by 7
  12. 2020Regularization of Building Boundaries in Satellite Images using Adversarial and Regularized Lossescited by 4
  13. 2022PolyBuilding: Polygon Transformer for End-to-End Building Extractioncited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 3; 2026: 3.

6 papers.