Hierarchical Adaptive Voxel-guided Sampling for Real-time Applications in Large-scale Point Clouds

• URL: http://arxiv.org/abs/2305.14306v1
• Date: Tue, 23 May 2023 17:45:49 GMT
• Title: Hierarchical Adaptive Voxel-guided Sampling for Real-time Applications in Large-scale Point Clouds
• Authors: Junyuan Ouyang and Xiao Liu and Haoyao Chen
• Abstract summary: We propose a hierarchical adaptive voxel-guided point sampler with linear complexity and high parallelization for real-time applications. Our method achieves competitive performance with the most powerful FPS, at an amazing speed that is more than 100 times faster. Our sampler can be easily integrated into existing models and achieves a 20$sim$80% reduction in runtime with minimal effort.
• Score: 6.094829692829813
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: While point-based neural architectures have demonstrated their efficacy, the time-consuming sampler currently prevents them from performing real-time reasoning on scene-level point clouds. Existing methods attempt to overcome this issue by using random sampling strategy instead of the commonly-adopted farthest point sampling~(FPS), but at the expense of lower performance. So the effectiveness/efficiency trade-off remains under-explored. In this paper, we reveal the key to high-quality sampling is ensuring an even spacing between points in the subset, which can be naturally obtained through a grid. Based on this insight, we propose a hierarchical adaptive voxel-guided point sampler with linear complexity and high parallelization for real-time applications. Extensive experiments on large-scale point cloud detection and segmentation tasks demonstrate that our method achieves competitive performance with the most powerful FPS, at an amazing speed that is more than 100 times faster. This breakthrough in efficiency addresses the bottleneck of the sampling step when handling scene-level point clouds. Furthermore, our sampler can be easily integrated into existing models and achieves a 20$\sim$80\% reduction in runtime with minimal effort. The code will be available at https://github.com/OuyangJunyuan/pointcloud-3d-detector-tensorrt

Related papers

• Curvature Informed Furthest Point Sampling [0.0]
  We introduce a reinforcement learning-based sampling algorithm that enhances furthest point sampling (FPS) Our approach ranks points by combining FPS-derived soft ranks with curvature scores computed by a deep neural network. We provide comprehensive ablation studies, with both qualitative and quantitative insights into the effect of each feature on performance.
  arXiv  Detail & Related papers  (2024-11-25T23:58:38Z)
• PLATYPUS: Progressive Local Surface Estimator for Arbitrary-Scale Point Cloud Upsampling [7.967279361937874]
  3D point clouds are increasingly vital for applications like autonomous driving and robotics. Point cloud upsampling is essential for improving density and uniformity. We introduce the Progressive Local Surface Estimator (PLSE), which more effectively captures local features in complex regions.
  arXiv  Detail & Related papers  (2024-11-01T07:56:56Z)
• HashPoint: Accelerated Point Searching and Sampling for Neural Rendering [9.418401219498223]
  Two typical approaches are employed: renderingization and ray tracing. The volumeization-based methods enable real-time rendering at the cost of increased memory and lower fidelity. In contrast, the ray-tracing-based methods yield superior quality but demand longer time. We solve this problem by our HashPoint method combining these two strategies.
  arXiv  Detail & Related papers  (2024-04-22T09:57:53Z)
• Grad-PU: Arbitrary-Scale Point Cloud Upsampling via Gradient Descent with Learned Distance Functions [77.32043242988738]
  We propose a new framework for accurate point cloud upsampling that supports arbitrary upsampling rates. Our method first interpolates the low-res point cloud according to a given upsampling rate.
  arXiv  Detail & Related papers  (2023-04-24T06:36:35Z)
• Attention-based Point Cloud Edge Sampling [0.0]
  Point cloud sampling is a less explored research topic for this data representation. This paper proposes a non-generative Attention-based Point cloud Edge Sampling method (APES) Both qualitative and quantitative experimental results show the superior performance of our sampling method on common benchmark tasks.
  arXiv  Detail & Related papers  (2023-02-28T15:36:17Z)
• BIMS-PU: Bi-Directional and Multi-Scale Point Cloud Upsampling [60.257912103351394]
  We develop a new point cloud upsampling pipeline called BIMS-PU. We decompose the up/downsampling procedure into several up/downsampling sub-steps by breaking the target sampling factor into smaller factors. We show that our method achieves superior results to state-of-the-art approaches.
  arXiv  Detail & Related papers  (2022-06-25T13:13:37Z)
• Self-Supervised Arbitrary-Scale Point Clouds Upsampling via Implicit Neural Representation [79.60988242843437]
  We propose a novel approach that achieves self-supervised and magnification-flexible point clouds upsampling simultaneously. Experimental results demonstrate that our self-supervised learning based scheme achieves competitive or even better performance than supervised learning based state-of-the-art methods.
  arXiv  Detail & Related papers  (2022-04-18T07:18:25Z)
• 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)
• PUFA-GAN: A Frequency-Aware Generative Adversarial Network for 3D Point Cloud Upsampling [56.463507980857216]
  We propose a generative adversarial network for point cloud upsampling. It can make the upsampled points evenly distributed on the underlying surface but also efficiently generate clean high frequency regions.
  arXiv  Detail & Related papers  (2022-03-02T07:47:46Z)
• 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)

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.