CenterPoly: real-time instance segmentation using bounding polygons

• URL: http://arxiv.org/abs/2108.08923v1
• Date: Thu, 19 Aug 2021 21:31:30 GMT
• Title: CenterPoly: real-time instance segmentation using bounding polygons
• Authors: Hughes Perreault, Guillaume-Alexandre Bilodeau, Nicolas Saunier and Maguelonne H\'eritier
• Abstract summary: We present a novel method, called CenterPoly, for real-time instance segmentation using bounding polygons. We apply it to detect road users in dense urban environments, making it suitable for applications in intelligent transportation systems like automated vehicles. Most of the network parameters are shared by the network heads, making it fast and lightweight enough to run at real-time speed.
• Score: 11.365829102707014
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present a novel method, called CenterPoly, for real-time instance segmentation using bounding polygons. We apply it to detect road users in dense urban environments, making it suitable for applications in intelligent transportation systems like automated vehicles. CenterPoly detects objects by their center keypoint while predicting a fixed number of polygon vertices for each object, thus performing detection and segmentation in parallel. Most of the network parameters are shared by the network heads, making it fast and lightweight enough to run at real-time speed. To properly convert mask ground-truth to polygon ground-truth, we designed a vertex selection strategy to facilitate the learning of the polygons. Additionally, to better segment overlapping objects in dense urban scenes, we also train a relative depth branch to determine which instances are closer and which are further, using available weak annotations. We propose several models with different backbones to show the possible speed / accuracy trade-offs. The models were trained and evaluated on Cityscapes, KITTI and IDD and the results are reported on their public benchmark, which are state-of-the-art at real-time speeds. Code is available at https://github.com/hu64/CenterPoly

Related papers

• KP-RED: Exploiting Semantic Keypoints for Joint 3D Shape Retrieval and Deformation [87.23575166061413]
  KP-RED is a unified KeyPoint-driven REtrieval and Deformation framework. It takes object scans as input and jointly retrieves and deforms the most geometrically similar CAD models.
  arXiv  Detail & Related papers  (2024-03-15T08:44:56Z)
• Progressive Evolution from Single-Point to Polygon for Scene Text [79.29097971932529]
  We introduce Point2Polygon, which can efficiently transform single-points into compact polygons. Our method uses a coarse-to-fine process, starting with creating anchor points based on recognition confidence, then vertically and horizontally refining the polygon. In training detectors with polygons generated by our method, we attained 86% of the accuracy relative to training with ground truth (GT); 3) Additionally, the proposed Point2Polygon can be seamlessly integrated to empower single-point spotters to generate polygons.
  arXiv  Detail & Related papers  (2023-12-21T12:08:27Z)
• Real-time instance segmentation with polygons using an Intersection-over-Union loss [13.020122353444497]
  We improve over CenterPoly by enhancing the classical regression L1 loss with a novel region-based loss and a novel order loss. Experiments show that using a combination of a regression loss and a region-based loss allows significant improvements on the Cityscapes and IDD test set.
  arXiv  Detail & Related papers  (2023-05-09T14:43:38Z)
• DPPD: Deformable Polar Polygon Object Detection [3.9236649268347765]
  We develop a novel Deformable Polar Polygon Object Detection method (DPPD) to detect objects in polygon shapes. DPPD has been demonstrated successfully in various object detection tasks for autonomous driving.
  arXiv  Detail & Related papers  (2023-04-05T06:43:41Z)
• POCO: Point Convolution for Surface Reconstruction [92.22371813519003]
  Implicit neural networks have been successfully used for surface reconstruction from point clouds. Many of them face scalability issues as they encode the isosurface function of a whole object or scene into a single latent vector. We propose to use point cloud convolutions and compute latent vectors at each input point.
  arXiv  Detail & Related papers  (2022-01-05T21:26:18Z)
• PolyWorld: Polygonal Building Extraction with Graph Neural Networks in Satellite Images [10.661430927191205]
  This paper introduces PolyWorld, a neural network that directly extracts building vertices from an image and connects them correctly to create precise polygons. PolyWorld significantly outperforms the state-of-the-art in building polygonization.
  arXiv  Detail & Related papers  (2021-11-30T15:23:17Z)
• Theoretical and Empirical Analysis of a Fast Algorithm for Extracting Polygons from Signed Distance Bounds [0.0]
  We introduce and investigate anally fast method for transforming signed distance bounds into polygon meshes. We provide theoretical and experimental evidence that this approach is of the $O(N2log N)$ computational complexity for a polygonization grid with $N3$ cells. Given its speed, implementation simplicity and portability, we argue that it could prove useful during the modelling stage as well as in shape compression for storage.
  arXiv  Detail & Related papers  (2021-11-10T16:31:27Z)
• PolyTrack: Tracking with Bounding Polygons [11.365829102707014]
  Polytrack detects objects by producing heatmaps of their center keypoint. rough segmentation is done by computing a bounding polygon over each instance instead of the traditional bounding box. We trained and evaluated PolyTrack on the MOTS and KITTIMOTS datasets.
  arXiv  Detail & Related papers  (2021-11-02T14:05:41Z)
• PolyNet: Polynomial Neural Network for 3D Shape Recognition with PolyShape Representation [51.147664305955495]
  3D shape representation and its processing have substantial effects on 3D shape recognition. We propose a deep neural network-based method (PolyNet) and a specific polygon representation (PolyShape) Our experiments demonstrate the strength and the advantages of PolyNet on both 3D shape classification and retrieval tasks.
  arXiv  Detail & Related papers  (2021-10-15T06:45:59Z)
• Polygonal Point Set Tracking [50.445151155209246]
  We propose a novel learning-based polygonal point set tracking method. Our goal is to track corresponding points on the target contour. We present visual-effects applications of our method on part distortion and text mapping.
  arXiv  Detail & Related papers  (2021-05-30T17:12:36Z)
• Segment as Points for Efficient Online Multi-Object Tracking and Segmentation [66.03023110058464]
  We propose a highly effective method for learning instance embeddings based on segments by converting the compact image representation to un-ordered 2D point cloud representation. Our method generates a new tracking-by-points paradigm where discriminative instance embeddings are learned from randomly selected points rather than images. The resulting online MOTS framework, named PointTrack, surpasses all the state-of-the-art methods by large margins.
  arXiv  Detail & Related papers  (2020-07-03T08:29:35Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.