Joint Data and Feature Augmentation for Self-Supervised Representation Learning on Point Clouds

• URL: http://arxiv.org/abs/2211.01184v1
• Date: Wed, 2 Nov 2022 14:58:03 GMT
• Title: Joint Data and Feature Augmentation for Self-Supervised Representation Learning on Point Clouds
• Authors: Zhuheng Lu, Yuewei Dai, Weiqing Li, Zhiyong Su
• Abstract summary: We propose a fusion contrastive learning framework to combine data augmentations in Euclidean space and feature augmentations in feature space. We conduct extensive object classification experiments and object part segmentation experiments to validate the transferability of the proposed framework. Experimental results demonstrate that the proposed framework is effective to learn the point cloud representation in a self-supervised manner.
• Score: 4.723757543677507
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: To deal with the exhausting annotations, self-supervised representation learning from unlabeled point clouds has drawn much attention, especially centered on augmentation-based contrastive methods. However, specific augmentations hardly produce sufficient transferability to high-level tasks on different datasets. Besides, augmentations on point clouds may also change underlying semantics. To address the issues, we propose a simple but efficient augmentation fusion contrastive learning framework to combine data augmentations in Euclidean space and feature augmentations in feature space. In particular, we propose a data augmentation method based on sampling and graph generation. Meanwhile, we design a data augmentation network to enable a correspondence of representations by maximizing consistency between augmented graph pairs. We further design a feature augmentation network that encourages the model to learn representations invariant to the perturbations using an encoder perturbation. We comprehensively conduct extensive object classification experiments and object part segmentation experiments to validate the transferability of the proposed framework. Experimental results demonstrate that the proposed framework is effective to learn the point cloud representation in a self-supervised manner, and yields state-of-the-art results in the community. The source code is publicly available at: https://zhiyongsu.github.io/Project/AFSRL.html.

Related papers

• PointMoment:Mixed-Moment-based Self-Supervised Representation Learning for 3D Point Clouds [11.980787751027872]
  We propose PointMoment, a novel framework for point cloud self-supervised representation learning. Our framework does not require any special techniques such as asymmetric network architectures, gradient stopping, etc.
  arXiv  Detail & Related papers  (2023-12-06T08:49:55Z)
• ScribbleGen: Generative Data Augmentation Improves Scribble-supervised Semantic Segmentation [10.225021032417589]
  We propose ScribbleGen, a generative data augmentation method for scribble-supervised semantic segmentation. We leverage a ControlNet diffusion model conditioned on semantic scribbles to produce high-quality training data. We show that our framework significantly improves segmentation performance on small datasets, even surpassing fully-supervised segmentation.
  arXiv  Detail & Related papers  (2023-11-28T13:44:33Z)
• Learning-Based Biharmonic Augmentation for Point Cloud Classification [79.13962913099378]
  Biharmonic Augmentation (BA) is a novel and efficient data augmentation technique. BA diversifies point cloud data by imposing smooth non-rigid deformations on existing 3D structures. We present AdvTune, an advanced online augmentation system that integrates adversarial training.
  arXiv  Detail & Related papers  (2023-11-10T14:04:49Z)
• CONVERT:Contrastive Graph Clustering with Reliable Augmentation [110.46658439733106]
  We propose a novel CONtrastiVe Graph ClustEring network with Reliable AugmenTation (CONVERT) In our method, the data augmentations are processed by the proposed reversible perturb-recover network. To further guarantee the reliability of semantics, a novel semantic loss is presented to constrain the network.
  arXiv  Detail & Related papers  (2023-08-17T13:07:09Z)
• Data Augmentation-free Unsupervised Learning for 3D Point Cloud Understanding [61.30276576646909]
  We propose an augmentation-free unsupervised approach for point clouds to learn transferable point-level features via soft clustering, named SoftClu. We exploit the affiliation of points to their clusters as a proxy to enable self-training through a pseudo-label prediction task.
  arXiv  Detail & Related papers  (2022-10-06T10:18:16Z)
• MetAug: Contrastive Learning via Meta Feature Augmentation [28.708395209321846]
  We argue that contrastive learning heavily relies on informative features, or "hard" (positive or negative) features. The key challenge toward exploring such features is that the source multi-view data is generated by applying random data augmentations. We propose to directly augment the features in latent space, thereby learning discriminative representations without a large amount of input data.
  arXiv  Detail & Related papers  (2022-03-10T02:35:39Z)
• Adversarial Feature Augmentation and Normalization for Visual Recognition [109.6834687220478]
  Recent advances in computer vision take advantage of adversarial data augmentation to ameliorate the generalization ability of classification models. Here, we present an effective and efficient alternative that advocates adversarial augmentation on intermediate feature embeddings. We validate the proposed approach across diverse visual recognition tasks with representative backbone networks.
  arXiv  Detail & Related papers  (2021-03-22T20:36:34Z)
• Context Decoupling Augmentation for Weakly Supervised Semantic Segmentation [53.49821324597837]
  Weakly supervised semantic segmentation is a challenging problem that has been deeply studied in recent years. We present a Context Decoupling Augmentation ( CDA) method to change the inherent context in which the objects appear. To validate the effectiveness of the proposed method, extensive experiments on PASCAL VOC 2012 dataset with several alternative network architectures demonstrate that CDA can boost various popular WSSS methods to the new state-of-the-art by a large margin.
  arXiv  Detail & Related papers  (2021-03-02T15:05:09Z)
• Robust Optimization as Data Augmentation for Large-scale Graphs [117.2376815614148]
  We propose FLAG (Free Large-scale Adversarial Augmentation on Graphs), which iteratively augments node features with gradient-based adversarial perturbations during training. FLAG is a general-purpose approach for graph data, which universally works in node classification, link prediction, and graph classification tasks.
  arXiv  Detail & Related papers  (2020-10-19T21:51:47Z)

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.