Attention-based Point Cloud Edge Sampling
- URL: http://arxiv.org/abs/2302.14673v2
- Date: Sun, 26 Mar 2023 14:32:23 GMT
- Title: Attention-based Point Cloud Edge Sampling
- Authors: Chengzhi Wu, Junwei Zheng, Julius Pfrommer, J\"urgen Beyerer
- Abstract summary: 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.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Point cloud sampling is a less explored research topic for this data
representation. The most commonly used sampling methods are still classical
random sampling and farthest point sampling. With the development of neural
networks, various methods have been proposed to sample point clouds in a
task-based learning manner. However, these methods are mostly generative-based,
rather than selecting points directly using mathematical statistics. Inspired
by the Canny edge detection algorithm for images and with the help of the
attention mechanism, this paper proposes a non-generative Attention-based Point
cloud Edge Sampling method (APES), which captures salient points in the point
cloud outline. Both qualitative and quantitative experimental results show the
superior performance of our sampling method on common benchmark tasks.
Related papers
- Arbitrary-Scale Point Cloud Upsampling by Voxel-Based Network with
Latent Geometric-Consistent Learning [52.825441454264585]
We propose an arbitrary-scale Point cloud Upsampling framework using Voxel-based Network (textbfPU-VoxelNet)
Thanks to the completeness and regularity inherited from the voxel representation, voxel-based networks are capable of providing predefined grid space to approximate 3D surface.
A density-guided grid resampling method is developed to generate high-fidelity points while effectively avoiding sampling outliers.
arXiv Detail & Related papers (2024-03-08T07:31:14Z) - Hierarchical Adaptive Voxel-guided Sampling for Real-time Applications
in Large-scale Point Clouds [6.094829692829813]
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.
arXiv Detail & Related papers (2023-05-23T17:45:49Z) - AU-PD: An Arbitrary-size and Uniform Downsampling Framework for Point
Clouds [6.786701761788659]
We introduce the AU-PD, a novel task-aware sampling framework that directly downsamples point cloud to any smaller size.
We refine the pre-sampled set to make it task-aware, driven by downstream task losses.
With the attention mechanism and proper training scheme, the framework learns to adaptively refine the pre-sampled set of different sizes.
arXiv Detail & Related papers (2022-11-02T13:37:16Z) - APSNet: Attention Based Point Cloud Sampling [0.7734726150561088]
We develop an attention-based point cloud sampling network (APSNet) to tackle this problem.
Both supervised learning and knowledge distillation-based self-supervised learning of APSNet are proposed.
Experiments demonstrate the superior performance of APSNet against state-of-the-arts in various downstream tasks.
arXiv Detail & Related papers (2022-10-11T17:30:46Z) - 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) - 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) - Beyond Farthest Point Sampling in Point-Wise Analysis [52.218037492342546]
We propose a novel data-driven sampler learning strategy for point-wise analysis tasks.
We learn sampling and downstream applications jointly.
Our experiments show that jointly learning of the sampler and task brings remarkable improvement over previous baseline methods.
arXiv Detail & Related papers (2021-07-09T08:08:44Z) - 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) - Rethinking Sampling in 3D Point Cloud Generative Adversarial Networks [82.72642388129843]
We show that sampling-insensitive discriminators produce shape point clouds with point clustering artifacts while sampling-oversensitive discriminators fail to guide valid shape generation.
We propose the concept of sampling spectrum to depict the different sampling sensitivities of discriminators.
We discover a middle-point sampling-aware baseline discriminator, PointNet-Mix, which improves all existing point cloud generators by a large margin on sampling-related metrics.
arXiv Detail & Related papers (2020-06-12T09:29:24Z)
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.