Revisiting Point Cloud Shape Classification with a Simple and Effective Baseline

• URL: http://arxiv.org/abs/2106.05304v1
• Date: Wed, 9 Jun 2021 18:01:11 GMT
• Title: Revisiting Point Cloud Shape Classification with a Simple and Effective Baseline
• Authors: Ankit Goyal, Hei Law, Bowei Liu, Alejandro Newell, Jia Deng
• Abstract summary: We find that auxiliary factors like different evaluation schemes, data augmentation strategies, and loss functions make a large difference in performance. A projection-based method, which we refer to as SimpleView, performs surprisingly well. It achieves on par or better results than sophisticated state-of-the-art methods on ModelNet40 while being half the size of PointNet++.
• Score: 111.3236030935478
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Processing point cloud data is an important component of many real-world systems. As such, a wide variety of point-based approaches have been proposed, reporting steady benchmark improvements over time. We study the key ingredients of this progress and uncover two critical results. First, we find that auxiliary factors like different evaluation schemes, data augmentation strategies, and loss functions, which are independent of the model architecture, make a large difference in performance. The differences are large enough that they obscure the effect of architecture. When these factors are controlled for, PointNet++, a relatively older network, performs competitively with recent methods. Second, a very simple projection-based method, which we refer to as SimpleView, performs surprisingly well. It achieves on par or better results than sophisticated state-of-the-art methods on ModelNet40 while being half the size of PointNet++. It also outperforms state-of-the-art methods on ScanObjectNN, a real-world point cloud benchmark, and demonstrates better cross-dataset generalization. Code is available at https://github.com/princeton-vl/SimpleView.

Related papers

• Inferring Neural Signed Distance Functions by Overfitting on Single Noisy Point Clouds through Finetuning Data-Driven based Priors [53.6277160912059]
  We propose a method to promote pros of data-driven based and overfitting-based methods for better generalization, faster inference, and higher accuracy in learning neural SDFs. We introduce a novel statistical reasoning algorithm in local regions which is able to finetune data-driven based priors without signed distance supervision, clean point cloud, or point normals.
  arXiv  Detail & Related papers  (2024-10-25T16:48:44Z)
• GPr-Net: Geometric Prototypical Network for Point Cloud Few-Shot Learning [2.4366811507669115]
  GPr-Net is a lightweight and computationally efficient geometric network that captures the prototypical topology of point clouds. We show that GPr-Net outperforms state-of-the-art methods in few-shot learning on point clouds.
  arXiv  Detail & Related papers  (2023-04-12T17:32:18Z)
• PointNeXt: Revisiting PointNet++ with Improved Training and Scaling Strategies [85.14697849950392]
  We revisit the classical PointNet++ through a systematic study of model training and scaling strategies. We propose a set of improved training strategies that significantly improve PointNet++ performance. We introduce an inverted residual bottleneck design and separables into PointNet++ to enable efficient and effective model scaling.
  arXiv  Detail & Related papers  (2022-06-09T17:59:54Z)
• 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)
• Unsupervised Representation Learning for 3D Point Cloud Data [66.92077180228634]
  We propose a simple yet effective approach for unsupervised point cloud learning. In particular, we identify a very useful transformation which generates a good contrastive version of an original point cloud. We conduct experiments on three downstream tasks which are 3D object classification, shape part segmentation and scene segmentation.
  arXiv  Detail & Related papers  (2021-10-13T10:52:45Z)
• Point Transformer for Shape Classification and Retrieval of 3D and ALS Roof PointClouds [3.3744638598036123]
  This paper proposes a fully attentional model - em Point Transformer, for deriving a rich point cloud representation. The model's shape classification and retrieval performance are evaluated on a large-scale urban dataset - RoofN3D and a standard benchmark dataset ModelNet40. The proposed method outperforms other state-of-the-art models in the RoofN3D dataset, gives competitive results in the ModelNet40 benchmark, and showcases high robustness to various unseen point corruptions.
  arXiv  Detail & Related papers  (2020-11-08T08:11:02Z)
• Knowledge Graph Embedding with Atrous Convolution and Residual Learning [4.582412257655891]
  We propose a simple but effective atrous convolution based knowledge graph embedding method. It effectively increases feature interactions by using atrous convolutions. It addresses the original information forgotten issue and vanishing/exploding gradient issue.
  arXiv  Detail & Related papers  (2020-10-23T00:57:23Z)
• PointHop++: A Lightweight Learning Model on Point Sets for 3D Classification [55.887502438160304]
  The PointHop method was recently proposed by Zhang et al. for 3D point cloud classification with unsupervised feature extraction. We improve the PointHop method furthermore in two aspects: 1) reducing its model complexity in terms of the model parameter number and 2) ordering discriminant features automatically based on the cross-entropy criterion. With experiments conducted on the ModelNet40 benchmark dataset, we show that the PointHop++ method performs on par with deep neural network (DNN) solutions and surpasses other unsupervised feature extraction methods.
  arXiv  Detail & Related papers  (2020-02-09T04:49: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.