Analysis of Sampling Strategies for Implicit 3D Reconstruction

• URL: http://arxiv.org/abs/2304.03999v2
• Date: Tue, 11 Apr 2023 12:38:38 GMT
• Title: Analysis of Sampling Strategies for Implicit 3D Reconstruction
• Authors: Q. Liu, X. Yang
• Abstract summary: In the training process of the implicit 3D reconstruction network, the choice of spatial query points' sampling strategy affects the final performance of the model. In this work, we explored the relationship between sampling strategy and network final performance through classification analysis and experimental comparison. We also proposed two methods, linear sampling and distance mask, to improve the sampling strategy of query points, making it more general and robust.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In the training process of the implicit 3D reconstruction network, the choice of spatial query points' sampling strategy affects the final performance of the model. Different works have differences in the selection of sampling strategies, not only in the spatial distribution of query points but also in the order of magnitude difference in the density of query points. For how to select the sampling strategy of query points, current works are more akin to an enumerating operation to find the optimal solution, which seriously affects work efficiency. In this work, we explored the relationship between sampling strategy and network final performance through classification analysis and experimental comparison from three aspects: the relationship between network type and sampling strategy, the relationship between implicit function and sampling strategy, and the impact of sampling density on model performance. In addition, we also proposed two methods, linear sampling and distance mask, to improve the sampling strategy of query points, making it more general and robust.

Related papers

• Sampling Strategies for Efficient Training of Deep Learning Object Detection Algorithms [4.609829289649562]
  Two sampling strategies are investigated to enhance efficiency in training a deep learning object detection model.<n>The first strategy is uniform sampling which seeks to obtain samples evenly yet randomly through the state space of the object dynamics.<n>The second strategy of frame difference sampling is developed to explore the temporal redundancy among successive frames in a video.
  arXiv  Detail & Related papers  (2025-05-23T18:54:01Z)
• SAMBLE: Shape-Specific Point Cloud Sampling for an Optimal Trade-Off Between Local Detail and Global Uniformity [15.235115582773059]
  We propose a Sparse Attention Map and Bin-based Learning method (termed SAMBLE) to learn shape-specific sampling strategies for point cloud shapes. SAMBLE effectively improves balance between sampling edge points for local details and preserving uniformity in the global shape.
  arXiv  Detail & Related papers  (2025-04-28T08:42:24Z)
• CS-Net:Contribution-based Sampling Network for Point Cloud Simplification [50.55658910053004]
  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. We propose a contribution-based sampling network (CS-Net), where the sampling operation is formulated as a Top-k operation.
  arXiv  Detail & Related papers  (2025-01-18T14:56:09Z)
• Gradient and Uncertainty Enhanced Sequential Sampling for Global Fit [0.0]
  This paper proposes a new sampling strategy for global fit called Gradient and Uncertainty Enhanced Sequential Sampling (GUESS) We show that GUESS achieved on average the highest sample efficiency compared to other surrogate-based strategies on the tested examples.
  arXiv  Detail & Related papers  (2023-09-29T19:49:39Z)
• Thompson sampling for improved exploration in GFlowNets [75.89693358516944]
  Generative flow networks (GFlowNets) are amortized variational inference algorithms that treat sampling from a distribution over compositional objects as a sequential decision-making problem with a learnable action policy. We show in two domains that TS-GFN yields improved exploration and thus faster convergence to the target distribution than the off-policy exploration strategies used in past work.
  arXiv  Detail & Related papers  (2023-06-30T14:19:44Z)
• Calibrate and Debias Layer-wise Sampling for Graph Convolutional Networks [39.56471534442315]
  This paper revisits the approach from a matrix approximation perspective. We propose a new principle for constructing sampling probabilities and an efficient debiasing algorithm. Improvements are demonstrated by extensive analyses of estimation variance and experiments on common benchmarks.
  arXiv  Detail & Related papers  (2022-06-01T15:52:06Z)
• PointInst3D: Segmenting 3D Instances by Points [136.7261709896713]
  We propose a fully-convolutional 3D point cloud instance segmentation method that works in a per-point prediction fashion. We find the key to its success is assigning a suitable target to each sampled point. Our approach achieves promising results on both ScanNet and S3DIS benchmarks.
  arXiv  Detail & Related papers  (2022-04-25T02:41: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)
• Local policy search with Bayesian optimization [73.0364959221845]
  Reinforcement learning aims to find an optimal policy by interaction with an environment. Policy gradients for local search are often obtained from random perturbations. We develop an algorithm utilizing a probabilistic model of the objective function and its gradient.
  arXiv  Detail & Related papers  (2021-06-22T16:07:02Z)
• Federated Learning under Importance Sampling [49.17137296715029]
  We study the effect of importance sampling and devise schemes for sampling agents and data non-uniformly guided by a performance measure. We find that in schemes involving sampling without replacement, the performance of the resulting architecture is controlled by two factors related to data variability at each agent.
  arXiv  Detail & Related papers  (2020-12-14T10:08:55Z)
• DyCo3D: Robust Instance Segmentation of 3D Point Clouds through Dynamic Convolution [136.7261709896713]
  We propose a data-driven approach that generates the appropriate convolution kernels to apply in response to the nature of the instances. The proposed method achieves promising results on both ScanetNetV2 and S3DIS. It also improves inference speed by more than 25% over the current state-of-the-art.
  arXiv  Detail & Related papers  (2020-11-26T14:56:57Z)
• Exploratory Landscape Analysis is Strongly Sensitive to the Sampling Strategy [8.246980996934347]
  In black-box optimization, where an explicit problem representation is not available, the feature values need to be approximated from a small number of sample points. In this work, we analyze how the sampling method and the sample size influence the quality of the feature value approximations.
  arXiv  Detail & Related papers  (2020-06-19T13:45:13Z)

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.