PointGL: A Simple Global-Local Framework for Efficient Point Cloud Analysis

• URL: http://arxiv.org/abs/2401.11650v1
• Date: Mon, 22 Jan 2024 02:05:33 GMT
• Title: PointGL: A Simple Global-Local Framework for Efficient Point Cloud Analysis
• Authors: Jianan Li, Jie Wang, Tingfa Xu
• Abstract summary: We introduce a novel, uncomplicated yet potent architecture known as PointGL to facilitate efficient point cloud analysis. The fusion of one-time point embedding and parameter-free graph pooling contributes to PointGL's defining attributes of minimized model complexity and heightened efficiency. Our PointGL attains state-of-the-art accuracy on the ScanObjectNN dataset while exhibiting a runtime that is more than 5 times faster and utilizing only approximately 4% of the FLOPs and 30% of the parameters compared to the recent PointMLP model.
• Score: 19.163081544030547
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Efficient analysis of point clouds holds paramount significance in real-world 3D applications. Currently, prevailing point-based models adhere to the PointNet++ methodology, which involves embedding and abstracting point features within a sequence of spatially overlapping local point sets, resulting in noticeable computational redundancy. Drawing inspiration from the streamlined paradigm of pixel embedding followed by regional pooling in Convolutional Neural Networks (CNNs), we introduce a novel, uncomplicated yet potent architecture known as PointGL, crafted to facilitate efficient point cloud analysis. PointGL employs a hierarchical process of feature acquisition through two recursive steps. First, the Global Point Embedding leverages straightforward residual Multilayer Perceptrons (MLPs) to effectuate feature embedding for each individual point. Second, the novel Local Graph Pooling technique characterizes point-to-point relationships and abstracts regional representations through succinct local graphs. The harmonious fusion of one-time point embedding and parameter-free graph pooling contributes to PointGL's defining attributes of minimized model complexity and heightened efficiency. Our PointGL attains state-of-the-art accuracy on the ScanObjectNN dataset while exhibiting a runtime that is more than 5 times faster and utilizing only approximately 4% of the FLOPs and 30% of the parameters compared to the recent PointMLP model. The code for PointGL is available at https://github.com/Roywangj/PointGL.

Related papers

• Point Deformable Network with Enhanced Normal Embedding for Point Cloud Analysis [59.12922158979068]
  Recently-based methods have shown strong performance in point cloud analysis. Simple architectures are able to learn geometric features in local point groups yet fail to model long-range dependencies directly. We propose Point Deformable Network (PDNet) to capture long-range relations with strong representation ability.
  arXiv  Detail & Related papers  (2023-12-20T14:52:07Z)
• Flattening-Net: Deep Regular 2D Representation for 3D Point Cloud Analysis [66.49788145564004]
  We present an unsupervised deep neural architecture called Flattening-Net to represent irregular 3D point clouds of arbitrary geometry and topology. Our methods perform favorably against the current state-of-the-art competitors.
  arXiv  Detail & Related papers  (2022-12-17T15:05:25Z)
• PointNorm: Dual Normalization is All You Need for Point Cloud Analysis [0.7971699294672281]
  We introduce a novel DualNorm module after the sampling-grouping operation to effectively and efficiently address the irregularity issue. The DualNorm module consists of Point Normalization, which normalizes the grouped points to the sampled points, and Reverse Point Normalization, which normalizes the sampled points to the grouped points.
  arXiv  Detail & Related papers  (2022-07-13T16:24:47Z)
• Rethinking Network Design and Local Geometry in Point Cloud: A Simple Residual MLP Framework [55.40001810884942]
  We introduce a pure residual network, called PointMLP, which integrates no sophisticated local geometrical extractors but still performs very competitively. On the real-world ScanObjectNN dataset, our method even surpasses the prior best method by 3.3% accuracy. Compared to most recent CurveNet, PointMLP trains 2x faster, tests 7x faster, and is more accurate on ModelNet40 benchmark.
  arXiv  Detail & Related papers  (2022-02-15T01:39:07Z)
• 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)
• Efficient 3D Point Cloud Feature Learning for Large-Scale Place Recognition [21.818744369503197]
  We develop an efficient point cloud learning network ( EPC-Net) to form a global descriptor for visual place recognition. Our proposed method can achieve state-of-the-art performance with lower parameters, FLOPs, and runtime per frame.
  arXiv  Detail & Related papers  (2021-01-07T05:15:31Z)
• PC-RGNN: Point Cloud Completion and Graph Neural Network for 3D Object Detection [57.49788100647103]
  LiDAR-based 3D object detection is an important task for autonomous driving. Current approaches suffer from sparse and partial point clouds of distant and occluded objects. In this paper, we propose a novel two-stage approach, namely PC-RGNN, dealing with such challenges by two specific solutions.
  arXiv  Detail & Related papers  (2020-12-18T18:06:43Z)
• 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)
• Local Grid Rendering Networks for 3D Object Detection in Point Clouds [98.02655863113154]
  CNNs are powerful but it would be computationally costly to directly apply convolutions on point data after voxelizing the entire point clouds to a dense regular 3D grid. We propose a novel and principled Local Grid Rendering (LGR) operation to render the small neighborhood of a subset of input points into a low-resolution 3D grid independently. We validate LGR-Net for 3D object detection on the challenging ScanNet and SUN RGB-D datasets.
  arXiv  Detail & Related papers  (2020-07-04T13:57:43Z)

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.