Learned Gridification for Efficient Point Cloud Processing
Putri A. van der Linden, David W. Romero, Erik J. Bekkers

TL;DR
This paper introduces learnable gridification, transforming point clouds into regular grids to enable more scalable and efficient neural operations, achieving competitive results in point cloud tasks.
Contribution
It proposes a novel learnable gridification method that improves scalability of point cloud processing by converting irregular data into regular grids for neural networks.
Findings
Gridification improves scalability in memory and computation.
The method achieves competitive performance on point cloud tasks.
The approach is theoretically and empirically validated.
Abstract
Neural operations that rely on neighborhood information are much more expensive when deployed on point clouds than on grid data due to the irregular distances between points in a point cloud. In a grid, on the other hand, we can compute the kernel only once and reuse it for all query positions. As a result, operations that rely on neighborhood information scale much worse for point clouds than for grid data, specially for large inputs and large neighborhoods. In this work, we address the scalability issue of point cloud methods by tackling its root cause: the irregularity of the data. We propose learnable gridification as the first step in a point cloud processing pipeline to transform the point cloud into a compact, regular grid. Thanks to gridification, subsequent layers can use operations defined on regular grids, e.g., Conv3D, which scale much better than native point cloud…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topics3D Shape Modeling and Analysis · Computer Graphics and Visualization Techniques · 3D Surveying and Cultural Heritage
