Justlookup: One Millisecond Deep Feature Extraction for Point Clouds By Lookup Tables
Not on the map. Why?
Abstract (arXiv)
Deep models are capable of fitting complex high dimensional functions while usually yielding large computation load. There is no way to speed up the inference process by classical lookup tables due to the high-dimensional input and limited memory size. Recently, a novel architecture (PointNet) for point clouds has demonstrated that it is possible to obtain a complicated deep function from a set of 3-variable functions. In this paper, we exploit this property and apply a lookup table to encode these 3-variable functions. This method ensures that the inference time is only determined by the memory access no matter how complicated the deep function is. We conduct extensive experiments on ModelNet and ShapeNet datasets and demonstrate that we can complete the inference process in 1.5 ms on an Intel i7-8700 CPU (single core mode), 32x speedup over the PointNet architecture without any performance degradation.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 14 Aug 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 2; 2023: 1; 2024: 0; 2025: 1.
4 papers.
- 2022PointSCNet: Point Cloud Structure and Correlation Learning Based on Space Filling Curve-Guided Samplingcited by 4
- 2023Decodable and Sample Invariant Continuous Object Encodercited by 2
- 2025Generating Adversarial Point Clouds Using Diffusion Modelcited by 1
- 2022Shrinking unit: a Graph Convolution-Based Unit for CNN-like 3D Point Cloud Feature Extractorscited by 0
- 2025Generating Adversarial Point Clouds Using Diffusion Model25 Jul 2025
- 2023Decodable and Sample Invariant Continuous Object Encoder31 Oct 2023
- 2022Shrinking unit: a Graph Convolution-Based Unit for CNN-like 3D Point Cloud Feature Extractors26 Sep 2022
- 2022PointSCNet: Point Cloud Structure and Correlation Learning Based on Space Filling Curve-Guided Sampling21 Feb 2022