PointMixup: Augmentation for Point Clouds

• URL: http://arxiv.org/abs/2008.06374v1
• Date: Fri, 14 Aug 2020 13:57:20 GMT
• Title: PointMixup: Augmentation for Point Clouds
• Authors: Yunlu Chen, Vincent Tao Hu, Efstratios Gavves, Thomas Mensink, Pascal Mettes, Pengwan Yang and Cees G.M. Snoek
• Abstract summary: We introduce PointMixup, a method that generates new examples through an optimal assignment of the path function between two point clouds. We show the potential of PointMixup for point cloud classification, especially when examples are scarce.
• Score: 65.61212404598524
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This paper introduces data augmentation for point clouds by interpolation between examples. Data augmentation by interpolation has shown to be a simple and effective approach in the image domain. Such a mixup is however not directly transferable to point clouds, as we do not have a one-to-one correspondence between the points of two different objects. In this paper, we define data augmentation between point clouds as a shortest path linear interpolation. To that end, we introduce PointMixup, an interpolation method that generates new examples through an optimal assignment of the path function between two point clouds. We prove that our PointMixup finds the shortest path between two point clouds and that the interpolation is assignment invariant and linear. With the definition of interpolation, PointMixup allows to introduce strong interpolation-based regularizers such as mixup and manifold mixup to the point cloud domain. Experimentally, we show the potential of PointMixup for point cloud classification, especially when examples are scarce, as well as increased robustness to noise and geometric transformations to points. The code for PointMixup and the experimental details are publicly available.

Related papers

• P2P-Bridge: Diffusion Bridges for 3D Point Cloud Denoising [81.92854168911704]
  We tackle the task of point cloud denoising through a novel framework that adapts Diffusion Schr"odinger bridges to points clouds. Experiments on object datasets show that P2P-Bridge achieves significant improvements over existing methods.
  arXiv  Detail & Related papers  (2024-08-29T08:00:07Z)
• PIVOT-Net: Heterogeneous Point-Voxel-Tree-based Framework for Point Cloud Compression [8.778300313732027]
  We propose a heterogeneous point cloud compression (PCC) framework. We unify typical point cloud representations -- point-based, voxel-based, and tree-based representations -- and their associated backbones. We augment the framework with a proposed context-aware upsampling for decoding and an enhanced voxel transformer for feature aggregation.
  arXiv  Detail & Related papers  (2024-02-11T16:57:08Z)
• Point2Point : A Framework for Efficient Deep Learning on Hilbert sorted Point Clouds with applications in Spatio-Temporal Occupancy Prediction [0.0]
  We propose a novel approach to representing point clouds as a locality preserving 1D ordering induced by the Hilbert space-filling curve. We also introduce Point2Point, a neural architecture that can effectively learn on Hilbert-sorted point clouds.
  arXiv  Detail & Related papers  (2023-06-28T15:30:08Z)
• HybridFusion: LiDAR and Vision Cross-Source Point Cloud Fusion [15.94976936555104]
  We propose a cross-source point cloud fusion algorithm called HybridFusion. It can register cross-source dense point clouds from different viewing angle in outdoor large scenes. The proposed approach is evaluated comprehensively through qualitative and quantitative experiments.
  arXiv  Detail & Related papers  (2023-04-10T10:54:54Z)
• PointPatchMix: Point Cloud Mixing with Patch Scoring [58.58535918705736]
  We propose PointPatchMix, which mixes point clouds at the patch level and generates content-based targets for mixed point clouds. Our approach preserves local features at the patch level, while the patch scoring module assigns targets based on the content-based significance score from a pre-trained teacher model. With Point-MAE as our baseline, our model surpasses previous methods by a significant margin, achieving 86.3% accuracy on ScanObjectNN and 94.1% accuracy on ModelNet40.
  arXiv  Detail & Related papers  (2023-03-12T14:49:42Z)
• Efficient Graph Field Integrators Meet Point Clouds [59.27295475120132]
  We present two new classes of algorithms for efficient field integration on graphs encoding point clouds. The first class, SeparatorFactorization(SF), leverages the bounded genus of point cloud mesh graphs, while the second class, RFDiffusion(RFD), uses popular epsilon-nearest-neighbor graph representations for point clouds.
  arXiv  Detail & Related papers  (2023-02-02T08:33:36Z)
• IDEA-Net: Dynamic 3D Point Cloud Interpolation via Deep Embedding Alignment [58.8330387551499]
  We formulate the problem as estimation of point-wise trajectories (i.e., smooth curves) We propose IDEA-Net, an end-to-end deep learning framework, which disentangles the problem under the assistance of the explicitly learned temporal consistency. We demonstrate the effectiveness of our method on various point cloud sequences and observe large improvement over state-of-the-art methods both quantitatively and visually.
  arXiv  Detail & Related papers  (2022-03-22T10:14:08Z)
• PCAM: Product of Cross-Attention Matrices for Rigid Registration of Point Clouds [79.99653758293277]
  PCAM is a neural network whose key element is a pointwise product of cross-attention matrices. We show that PCAM achieves state-of-the-art results among methods which, like us, solve steps (a) and (b) jointly via deepnets.
  arXiv  Detail & Related papers  (2021-10-04T09:23:27Z)
• PointManifoldCut: Point-wise Augmentation in the Manifold for Point Clouds [2.756263525080896]
  This paper proposes a mix-up augmentation approach, PointManifoldCut, which replaces the neural network embedded points. Experiments show that our proposed approach provides a competitive performance on point cloud classification and segmentation.
  arXiv  Detail & Related papers  (2021-09-15T14:31:42Z)
• DeepCLR: Correspondence-Less Architecture for Deep End-to-End Point Cloud Registration [12.471564670462344]
  This work addresses the problem of point cloud registration using deep neural networks. We propose an approach to predict the alignment between two point clouds with overlapping data content, but displaced origins. Our approach achieves state-of-the-art accuracy and the lowest run-time of the compared methods.
  arXiv  Detail & Related papers  (2020-07-22T08:20:57Z)

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.