Arbitrary Point Cloud Upsampling with Spherical Mixture of Gaussians

• URL: http://arxiv.org/abs/2208.05274v1
• Date: Wed, 10 Aug 2022 11:10:16 GMT
• Title: Arbitrary Point Cloud Upsampling with Spherical Mixture of Gaussians
• Authors: Anthony Dell'Eva, Marco Orsingher, Massimo Bertozzi
• Abstract summary: APU-SMOG is a Transformer-based model for Arbitrary Point cloud Upsampling (APU) APU-SMOG outperforms state-of-the-art fixed-ratio methods.
• Score: 1.2375561840897737
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Generating dense point clouds from sparse raw data benefits downstream 3D understanding tasks, but existing models are limited to a fixed upsampling ratio or to a short range of integer values. In this paper, we present APU-SMOG, a Transformer-based model for Arbitrary Point cloud Upsampling (APU). The sparse input is firstly mapped to a Spherical Mixture of Gaussians (SMOG) distribution, from which an arbitrary number of points can be sampled. Then, these samples are fed as queries to the Transformer decoder, which maps them back to the target surface. Extensive qualitative and quantitative evaluations show that APU-SMOG outperforms state-of-the-art fixed-ratio methods, while effectively enabling upsampling with any scaling factor, including non-integer values, with a single trained model. The code will be made available.

Related papers

• iPUNet:Iterative Cross Field Guided Point Cloud Upsampling [20.925921503694894]
  Point clouds acquired by 3D scanning devices are often sparse, noisy, and non-uniform, causing a loss of geometric features. We present a learning-based point upsampling method, iPUNet, which generates dense and uniform points at arbitrary ratios. We demonstrate that iPUNet is robust to handle noisy and non-uniformly distributed inputs, and outperforms state-of-the-art point cloud upsampling methods.
  arXiv  Detail & Related papers  (2023-10-13T13:24:37Z)
• 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)
• Joint Geometry and Attribute Upsampling of Point Clouds Using Frequency-Selective Models with Overlapped Support [4.211128681972148]
  We propose Frequency-Selective Upsampling (FSU), an upsampling scheme that upsamples geometry and attribute information of point clouds jointly. We show best performances for our proposed FSU in terms of point-to-plane error and plane-to-plane angular similarity.
  arXiv  Detail & Related papers  (2023-01-27T10:20:06Z)
• 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)
• Overlap-guided Gaussian Mixture Models for Point Cloud Registration [61.250516170418784]
  Probabilistic 3D point cloud registration methods have shown competitive performance in overcoming noise, outliers, and density variations. This paper proposes a novel overlap-guided probabilistic registration approach that computes the optimal transformation from matched Gaussian Mixture Model (GMM) parameters.
  arXiv  Detail & Related papers  (2022-10-17T08:02:33Z)
• 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)
• PU-EVA: An Edge Vector based Approximation Solution for Flexible-scale Point Cloud Upsampling [4.418205951027186]
  Upsampling sparse, noisy and nonuniform point clouds is a challenging task. A novel design of Edge Vector based Approximation for Flexible-scale Point clouds Upsampling (PU-EVA) is proposed. The EVA upsampling decouples the upsampling scales with network architecture, achieving the flexible upsampling rates in one-time training.
  arXiv  Detail & Related papers  (2022-04-22T15:14:05Z)
• 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)
• PU-Flow: a Point Cloud Upsampling Networkwith Normalizing Flows [58.96306192736593]
  We present PU-Flow, which incorporates normalizing flows and feature techniques to produce dense points uniformly distributed on the underlying surface. Specifically, we formulate the upsampling process as point in a latent space, where the weights are adaptively learned from local geometric context. We show that our method outperforms state-of-the-art deep learning-based approaches in terms of reconstruction quality, proximity-to-surface accuracy, and computation efficiency.
  arXiv  Detail & Related papers  (2021-07-13T07:45:48Z)
• Oops I Took A Gradient: Scalable Sampling for Discrete Distributions [53.3142984019796]
  We show that this approach outperforms generic samplers in a number of difficult settings. We also demonstrate the use of our improved sampler for training deep energy-based models on high dimensional discrete data.
  arXiv  Detail & Related papers  (2021-02-08T20:08:50Z)

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.