An Effective Encoding Method Based on Local Information for 3D Point Cloud Classification

Yanan Song, Liang Gao, Xinyu Li, Quan-Ke PanIEEE Access 2019 · DOI

Introduction

3D point clouds, represented as sets of $(x, y, z)$ coordinates, are the primary data format for LiDAR and depth sensors. However, their unordered and irregular nature presents significant challenges for deep learning. While early architectures like PointNet successfully addressed the permutation invariance of point clouds, they often failed to capture local geometric structures because they processed points independently before global aggregation. Subsequent models like PointNet++ introduced hierarchical structures to capture local context, but at the cost of increased computational complexity and architectural density.

This paper proposes a shift from model-centric complexity to data-centric enrichment. By encoding local geometric relationships directly into a point's feature vector using a physics-inspired "point gravitation" formula, the researchers demonstrate that state-of-the-art classification results can be achieved using a significantly simplified neural network architecture.

Methodology

The proposed method involves a two-step preprocessing pipeline designed to transform raw coordinates into context-aware feature vectors before they reach the classification network.

Figure 1: The overall pipeline of the proposed method, showing the transition from raw point clouds to encoded features and finally to a simplified classification network.

For every point in the cloud, the system identifies its local context using a $k$-Nearest Neighbor ($k$NN) algorithm. This step defines the local sphere of influence for each point, ensuring that subsequent calculations are grounded in the immediate geometric neighborhood.

2. Point Gravitation Encoding

To quantify the influence of these neighbors, the authors draw inspiration from Newton’s Law of Universal Gravitation. In physics, gravitational force is inversely proportional to the square of the distance. The authors adapted this principle into a "Point Gravitation" formula:

$$g_v = \frac{1}{(x + 1)^2}$$

where $x$ represents the Euclidean distance between the query point and its neighbor. This formula produces a normalized value between 0 and 1, effectively mapping the density and proximity of the local neighborhood into a numerical feature.

Figure 2: Detailed structure of the $(3 + k)$-dimensional feature vector, combining original spatial coordinates with calculated point gravitation values.

The resulting feature vector for each point is a $(3 + k)$-dimensional array consisting of the original $(x, y, z)$ coordinates followed by $k$ gravitation values. This enriched data is then processed by a "Basic PointNet"—a streamlined version of the original architecture that omits complex spatial transformation networks (T-Nets) and additional regularization layers, relying instead on the inherent spatial information provided by the encoding.

Experimental Evaluation

The method was rigorously tested on the ModelNet40 benchmark, which contains 12,311 CAD models across 40 categories. Each model was downsampled to 1,024 points for consistency.

Key Results

  • Accuracy: The proposed encoding method achieved an overall accuracy of 89.5%. This performance surpasses the standard PointNet (89.2%) and significantly outperforms voxel-based approaches like VoxNet (85.9%) and mesh-based methods like 3DShapeNets (84.7%).
  • Neighborhood Sensitivity: Experiments revealed that $k=6$ or $k=8$ neighbors provided the optimal balance of context. Smaller values of $k$ provided insufficient local information, while larger values (e.g., $k=10$) led to "feature blurring," which degraded classification accuracy.
  • Efficiency: By moving the geometric intelligence to the data representation stage, the authors were able to discard T-Net modules. This resulted in a model with fewer parameters and lower space complexity compared to standard PointNet implementations.

Discussion and Conclusion

The primary contribution of this work is the demonstration that physics-inspired data encoding can serve as an effective proxy for complex hierarchical network layers. By using the inverse-square law to represent spatial influence, the model naturally emphasizes fine-grained local details where they matter most.

Despite its success, the method currently relies on a manually set hyperparameter $k$. Future research will focus on automating $k$ selection using evolutionary algorithms to adapt to varying point cloud densities. Additionally, the team aims to refine the encoding to better distinguish between objects with similar global silhouettes but different local textures, such as wardrobes and bookshelves.

Summary updated

BibTeX
@article{song2019effective,
  author = {Yanan Song and Liang Gao and Xinyu Li and Quan-Ke Pan},
  title = {{An Effective Encoding Method Based on Local Information for 3D Point Cloud Classification}},
  journal = {IEEE Access},
  year = {2019},
  doi = {10.1109/access.2019.2905595},
}
Figure