MVP-Net: Multiple View Pointwise Semantic Segmentation of Large-Scale Point Clouds

• URL: http://arxiv.org/abs/2201.12769v1
• Date: Sun, 30 Jan 2022 09:43:00 GMT
• Title: MVP-Net: Multiple View Pointwise Semantic Segmentation of Large-Scale Point Clouds
• Authors: Chuanyu Luo, Xiaohan Li, Nuo Cheng, Han Li, Shengguang Lei, Pu Li
• Abstract summary: In this paper, we propose an end-to-end neural architecture, Multiple View Pointwise Net, MVP-Net, to efficiently infer large-scale outdoor point cloud without KNN or complex pre/postprocessing. Numerical experiments show that the proposed MVP-Net is 11 times faster than the most efficient pointwise semantic segmentation method RandLA-Net.
• Score: 13.260488842875649
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Semantic segmentation of 3D point cloud is an essential task for autonomous driving environment perception. The pipeline of most pointwise point cloud semantic segmentation methods includes points sampling, neighbor searching, feature aggregation, and classification. Neighbor searching method like K-nearest neighbors algorithm, KNN, has been widely applied. However, the complexity of KNN is always a bottleneck of efficiency. In this paper, we propose an end-to-end neural architecture, Multiple View Pointwise Net, MVP-Net, to efficiently and directly infer large-scale outdoor point cloud without KNN or any complex pre/postprocessing. Instead, assumption-based sorting and multi-rotation of point cloud methods are introduced to point feature aggregation and receptive field expanding. Numerical experiments show that the proposed MVP-Net is 11 times faster than the most efficient pointwise semantic segmentation method RandLA-Net and achieves the same accuracy on the large-scale benchmark SemanticKITTI dataset.

Related papers

• PointeNet: A Lightweight Framework for Effective and Efficient Point Cloud Analysis [28.54939134635978]
  PointeNet is a network designed specifically for point cloud analysis. Our method demonstrates flexibility by seamlessly integrating with a classification/segmentation head or embedding into off-the-shelf 3D object detection networks. Experiments on object-level datasets, including ModelNet40, ScanObjectNN, ShapeNet KITTI, and the scene-level dataset KITTI, demonstrate the superior performance of PointeNet over state-of-the-art methods in point cloud analysis.
  arXiv  Detail & Related papers  (2023-12-20T03:34:48Z)
• Dynamic Clustering Transformer Network for Point Cloud Segmentation [23.149220817575195]
  We propose a novel 3D point cloud representation network, called Dynamic Clustering Transformer Network (DCTNet) It has an encoder-decoder architecture, allowing for both local and global feature learning. Our method was evaluated on an object-based dataset (ShapeNet), an urban navigation dataset (Toronto-3D), and a multispectral LiDAR dataset.
  arXiv  Detail & Related papers  (2023-05-30T01:11:05Z)
• FEC: Fast Euclidean Clustering for Point Cloud Segmentation [9.347963580679162]
  We present a fast solution to point cloud instance segmentation with small computational demands. We propose a novel fast Euclidean clustering (FEC) algorithm which applies a pointwise scheme over the clusterwise scheme used in existing works.
  arXiv  Detail & Related papers  (2022-08-16T11:30:48Z)
• CloudAttention: Efficient Multi-Scale Attention Scheme For 3D Point Cloud Learning [81.85951026033787]
  We set transformers in this work and incorporate them into a hierarchical framework for shape classification and part and scene segmentation. We also compute efficient and dynamic global cross attentions by leveraging sampling and grouping at each iteration. The proposed hierarchical model achieves state-of-the-art shape classification in mean accuracy and yields results on par with the previous segmentation methods.
  arXiv  Detail & Related papers  (2022-07-31T21:39:15Z)
• APP-Net: Auxiliary-point-based Push and Pull Operations for Efficient Point Cloud Classification [48.230170172837084]
  Point-cloud-based 3D classification task involves aggregating features from neighbor points. To address these issues, we propose a new local aggregator of linear complexity, coined as APP. We use an online normal estimation module to provide the explainable geometric information to enhance our APP modeling capability.
  arXiv  Detail & Related papers  (2022-05-02T12:21:11Z)
• Stratified Transformer for 3D Point Cloud Segmentation [89.9698499437732]
  Stratified Transformer is able to capture long-range contexts and demonstrates strong generalization ability and high performance. To combat the challenges posed by irregular point arrangements, we propose first-layer point embedding to aggregate local information. Experiments demonstrate the effectiveness and superiority of our method on S3DIS, ScanNetv2 and ShapeNetPart datasets.
  arXiv  Detail & Related papers  (2022-03-28T05:35:16Z)
• GSIP: Green Semantic Segmentation of Large-Scale Indoor Point Clouds [64.86292006892093]
  GSIP (Green of Indoor Point clouds) is an efficient solution to semantic segmentation of large-scale indoor scene point clouds. GSIP has two novel components: 1) a room-style data pre-processing method that selects a proper subset of points for further processing, and 2) a new feature extractor which is extended from PointHop. Experiments show that GSIP outperforms PointNet in segmentation performance for the S3DIS dataset.
  arXiv  Detail & Related papers  (2021-09-24T09:26:53Z)
• Learning point embedding for 3D data processing [2.12121796606941]
  Current point-based methods are essentially spatial relationship processing networks. Our architecture, PE-Net, learns the representation of point clouds in high-dimensional space. Experiments show that PE-Net achieves the state-of-the-art performance in multiple challenging datasets.
  arXiv  Detail & Related papers  (2021-07-19T00:25:28Z)
• Learning Semantic Segmentation of Large-Scale Point Clouds with Random Sampling [52.464516118826765]
  We introduce RandLA-Net, an efficient and lightweight neural architecture to infer per-point semantics for large-scale point clouds. The key to our approach is to use random point sampling instead of more complex point selection approaches. Our RandLA-Net can process 1 million points in a single pass up to 200x faster than existing approaches.
  arXiv  Detail & Related papers  (2021-07-06T05:08:34Z)
• PointFlow: Flowing Semantics Through Points for Aerial Image Segmentation [96.76882806139251]
  We propose a point-wise affinity propagation module based on the Feature Pyramid Network (FPN) framework, named PointFlow. Rather than dense affinity learning, a sparse affinity map is generated upon selected points between the adjacent features. Experimental results on three different aerial segmentation datasets suggest that the proposed method is more effective and efficient than state-of-the-art general semantic segmentation methods.
  arXiv  Detail & Related papers  (2021-03-11T09:42:32Z)

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.