mlsanityData to 7 Oct 2026

CS-Net:Contribution-based Sampling Network for Point Cloud Simplification

arXiv 2501.10789 ↗First posted 18 Jan 2025cs.CVcited by 3

Not on the map. Why?

Abstract (arXiv)

Point cloud sampling plays a crucial role in reducing computation costs and storage requirements for various vision tasks. Traditional sampling methods, such as farthest point sampling, lack task-specific information and, as a result, cannot guarantee optimal performance in specific applications. Learning-based methods train a network to sample the point cloud for the targeted downstream task. However, they do not guarantee that the sampled points are the most relevant ones. Moreover, they may result in duplicate sampled points, which requires completion of the sampled point cloud through post-processing techniques. To address these limitations, we propose a contribution-based sampling network (CS-Net), where the sampling operation is formulated as a Top-k operation. To ensure that the network can be trained in an end-to-end way using gradient descent algorithms, we use a differentiable approximation to the Top-k operation via entropy regularization of an optimal transport problem. Our network consists of a feature embedding module, a cascade attention module, and a contribution scoring module. The feature embedding module includes a specifically designed spatial pooling layer to reduce parameters while preserving important features. The cascade attention module combines the outputs of three skip connected offset attention layers to emphasize the attractive features and suppress less important ones. The contribution scoring module generates a contribution score for each point and guides the sampling process to prioritize the most important ones. Experiments on the ModelNet40 and PU147 showed that CS-Net achieved state-of-the-art performance in two semantic-based downstream tasks (classification and registration) and two reconstruction-based tasks (compression and surface reconstruction).

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 22 of its 44 references that are in the map. First posted on arXiv 18 Jan 2025.

Builds on

22 of 44 references.

References · 22

  1. 2017Attention Is All You Needcited by 59,932
  2. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  3. 2016PointNet: Deep Learning on Point Sets for 3D Classification and Segmentationcited by 5,223
  4. 2017PointNet++: Deep Hierarchical Feature Learning on Point Sets in a Metric Spacecited by 4,384
  5. 2018CBAM: Convolutional Block Attention Modulecited by 2,463
  6. 2020PCT: Point cloud transformercited by 730
  7. 2019RandLA-Net: Efficient Semantic Segmentation of Large-Scale Point Cloudscited by 584
  8. 2020Voxel R-CNN: Towards High Performance Voxel-based 3D Object Detectioncited by 409
  9. 2019PU-GAN: a Point Cloud Upsampling Adversarial Networkcited by 162
  10. 2016Go-ICP: A Globally Optimal Solution to 3D ICP Point-Set Registrationcited by 159
  11. 2019Modeling Point Clouds with Self-Attention and Gumbel Subset Samplingcited by 151
  12. 2019Differentiable Ranks and Sorting using Optimal Transportcited by 113
10 more
  1. 2019SampleNet: Differentiable Point Cloud Samplingcited by 74
  2. 2020A Rotation-Invariant Framework for Deep Point Cloud Analysiscited by 62
  3. 2021Imperceptible Transfer Attack and Defense on 3D Point Cloud Classificationcited by 36
  4. 2020Deep Magnification-Flexible Upsampling over 3D Point Cloudscited by 27
  5. 2023Compositional Semantic Mix for Domain Adaptation in Point Cloud Segmentationcited by 20
  6. 2022PUFA-GAN: A Frequency-Aware Generative Adversarial Network for 3D Point Cloud Upsamplingcited by 18
  7. 2020Differentiable Top-k Operator with Optimal Transportcited by 17
  8. 2021PU-Flow: a Point Cloud Upsampling Network with Normalizing Flowscited by 17
  9. 2021PnP-3D: A Plug-and-Play for 3D Point Cloudscited by 10
  10. 2021Revisiting Point Cloud Simplification: A Learnable Feature Preserving Approachcited by 9

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 2; 2026: 1.

3 papers.