APP-Net: Auxiliary-point-based Push and Pull Operations for Efficient Point Cloud Classification

• URL: http://arxiv.org/abs/2205.00847v1
• Date: Mon, 2 May 2022 12:21:11 GMT
• Title: APP-Net: Auxiliary-point-based Push and Pull Operations for Efficient Point Cloud Classification
• Authors: Tao Lu, Chunxu Liu, Youxin Chen, Gangshan Wu, Limin Wang
• Abstract summary: 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.
• Score: 48.230170172837084
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Point-cloud-based 3D classification task involves aggregating features from neighbor points. In previous works, each source point is often selected as a neighbor by multiple center points. Thus each source point has to participate in calculation multiple times with high memory consumption. Meanwhile, to pursue higher accuracy, these methods rely on a complex local aggregator to extract fine geometric representation, which slows down the network. To address these issues, we propose a new local aggregator of linear complexity, coined as APP. Specifically, we introduce an auxiliary container as an anchor to exchange features between the source point and the aggregating center. Each source point pushes its feature to only one auxiliary container, and each center point pulls features from only one auxiliary container. This avoids the re-computation of each source point. To facilitate the learning of the local structure, we use an online normal estimation module to provide the explainable geometric information to enhance our APP modeling capability. The constructed network is more efficient than all the previous baselines with a clear margin while only occupying a low memory. Experiments on both synthetic and real datasets verify that APP-Net reaches comparable accuracies with other networks. We will release the complete code to help others reproduce the APP-Net.

Related papers

• GSTran: Joint Geometric and Semantic Coherence for Point Cloud Segmentation [33.72549134362884]
  We propose GSTran, a novel transformer network tailored for the segmentation task. The proposed network mainly consists of two principal components: a local geometric transformer and a global semantic transformer. Experiments on ShapeNetPart and S3DIS benchmarks demonstrate the effectiveness of the proposed method.
  arXiv  Detail & Related papers  (2024-08-21T12:12:37Z)
• Active search and coverage using point-cloud reinforcement learning [50.741409008225766]
  This paper presents an end-to-end deep reinforcement learning solution for target search and coverage. We show that deep hierarchical feature learning works for RL and that by using farthest point sampling (FPS) we can reduce the amount of points. We also show that multi-head attention for point-clouds helps to learn the agent faster but converges to the same outcome.
  arXiv  Detail & Related papers  (2023-12-18T18:16:30Z)
• 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)
• Point Cloud Classification Using Content-based Transformer via Clustering in Feature Space [25.57569871876213]
  We propose a point content-based Transformer architecture, called PointConT for short. It exploits the locality of points in the feature space (content-based), which clusters the sampled points with similar features into the same class and computes the self-attention within each class. We also introduce an Inception feature aggregator for point cloud classification, which uses parallel structures to aggregate high-frequency and low-frequency information in each branch separately.
  arXiv  Detail & Related papers  (2023-03-08T14:11:05Z)
• SVNet: Where SO(3) Equivariance Meets Binarization on Point Cloud Representation [65.4396959244269]
  The paper tackles the challenge by designing a general framework to construct 3D learning architectures. The proposed approach can be applied to general backbones like PointNet and DGCNN. Experiments on ModelNet40, ShapeNet, and the real-world dataset ScanObjectNN, demonstrated that the method achieves a great trade-off between efficiency, rotation, and accuracy.
  arXiv  Detail & Related papers  (2022-09-13T12:12:19Z)
• 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)
• PAPooling: Graph-based Position Adaptive Aggregation of Local Geometry in Point Clouds [15.878533142927102]
  PaPooling explicitly models spatial relations among local points using a novel graph representation. It aggregates features in a position adaptive manner, enabling position-sensitive representation of aggregated features. It can significantly improve predictive accuracy, while with minimal extra computational overhead.
  arXiv  Detail & Related papers  (2021-11-28T07:26:55Z)
• 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)
• SALA: Soft Assignment Local Aggregation for Parameter Efficient 3D Semantic Segmentation [65.96170587706148]
  We focus on designing a point local aggregation function that yields parameter efficient networks for 3D point cloud semantic segmentation. We explore the idea of using learnable neighbor-to-grid soft assignment in grid-based aggregation functions.
  arXiv  Detail & Related papers  (2020-12-29T20:16:37Z)
• ODFNet: Using orientation distribution functions to characterize 3D point clouds [0.0]
  We leverage on point orientation distributions around a point in order to obtain an expressive local neighborhood representation for point clouds. New ODFNet model achieves state-of-the-art accuracy for object classification on ModelNet40 and ScanObjectNN datasets.
  arXiv  Detail & Related papers  (2020-12-08T19:54:20Z)

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.