A Learnable Self-supervised Task for Unsupervised Domain Adaptation on Point Clouds

• URL: http://arxiv.org/abs/2104.05164v1
• Date: Mon, 12 Apr 2021 02:30:16 GMT
• Title: A Learnable Self-supervised Task for Unsupervised Domain Adaptation on Point Clouds
• Authors: Xiaoyuan Luo, Shaolei Liu, Kexue Fu, Manning Wang, Zhijian Song
• Abstract summary: We propose a learnable self-supervised task and integrate it into a self-supervision-based point cloud UDA architecture. In the UDA architecture, an encoder is shared between the networks for the self-supervised task and the main task of point cloud classification or segmentation. Experiments on PointDA-10 and PointSegDA datasets show that the proposed method achieves new state-of-the-art performance on both classification and segmentation tasks of point cloud UDA.
• Score: 7.731213699116179
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Deep neural networks have achieved promising performance in supervised point cloud applications, but manual annotation is extremely expensive and time-consuming in supervised learning schemes. Unsupervised domain adaptation (UDA) addresses this problem by training a model with only labeled data in the source domain but making the model generalize well in the target domain. Existing studies show that self-supervised learning using both source and target domain data can help improve the adaptability of trained models, but they all rely on hand-crafted designs of the self-supervised tasks. In this paper, we propose a learnable self-supervised task and integrate it into a self-supervision-based point cloud UDA architecture. Specifically, we propose a learnable nonlinear transformation that transforms a part of a point cloud to generate abundant and complicated point clouds while retaining the original semantic information, and the proposed self-supervised task is to reconstruct the original point cloud from the transformed ones. In the UDA architecture, an encoder is shared between the networks for the self-supervised task and the main task of point cloud classification or segmentation, so that the encoder can be trained to extract features suitable for both the source and the target domain data. Experiments on PointDA-10 and PointSegDA datasets show that the proposed method achieves new state-of-the-art performance on both classification and segmentation tasks of point cloud UDA. Code will be made publicly available.

Related papers

• Weakly-supervised Contrastive Learning for Unsupervised Object Discovery [52.696041556640516]
  Unsupervised object discovery is promising due to its ability to discover objects in a generic manner. We design a semantic-guided self-supervised learning model to extract high-level semantic features from images. We introduce Principal Component Analysis (PCA) to localize object regions.
  arXiv  Detail & Related papers  (2023-07-07T04:03:48Z)
• Self-Distillation for Unsupervised 3D Domain Adaptation [15.660045080090711]
  We propose an Unsupervised Domain Adaptation (UDA) method for point cloud classification in 3D vision. In this work, we focus on obtaining a discriminative feature space for the target domain enforcing consistency between a point cloud and its augmented version. We propose a novel iterative self-training methodology that exploits Graph Neural Networks in the UDA context to refine pseudo-labels.
  arXiv  Detail & Related papers  (2022-10-15T08:37:02Z)
• Instance Relation Graph Guided Source-Free Domain Adaptive Object Detection [79.89082006155135]
  Unsupervised Domain Adaptation (UDA) is an effective approach to tackle the issue of domain shift. UDA methods try to align the source and target representations to improve the generalization on the target domain. The Source-Free Adaptation Domain (SFDA) setting aims to alleviate these concerns by adapting a source-trained model for the target domain without requiring access to the source data.
  arXiv  Detail & Related papers  (2022-03-29T17:50:43Z)
• Self-Supervised Point Cloud Representation Learning with Occlusion Auto-Encoder [63.77257588569852]
  We present 3D Occlusion Auto-Encoder (3D-OAE) for learning representations for point clouds. Our key idea is to randomly occlude some local patches of the input point cloud and establish the supervision via recovering the occluded patches. In contrast with previous methods, our 3D-OAE can remove a large proportion of patches and predict them only with a small number of visible patches.
  arXiv  Detail & Related papers  (2022-03-26T14:06:29Z)
• Upsampling Autoencoder for Self-Supervised Point Cloud Learning [11.19408173558718]
  We propose a self-supervised pretraining model for point cloud learning without human annotations. Upsampling operation encourages the network to capture both high-level semantic information and low-level geometric information of the point cloud. We find that our UAE outperforms previous state-of-the-art methods in shape classification, part segmentation and point cloud upsampling tasks.
  arXiv  Detail & Related papers  (2022-03-21T07:20:37Z)
• Shuffle Augmentation of Features from Unlabeled Data for Unsupervised Domain Adaptation [21.497019000131917]
  Unsupervised Domain Adaptation (UDA) is a branch of transfer learning where labels for target samples are unavailable. In this paper, we propose Shuffle Augmentation of Features (SAF) as a novel UDA framework. SAF learns from the target samples, adaptively distills class-aware target features, and implicitly guides the classifier to find comprehensive class borders.
  arXiv  Detail & Related papers  (2022-01-28T07:11:05Z)
• Self-Ensemling for 3D Point Cloud Domain Adaption [29.330315360307374]
  We propose an end-to-end self-ensembling network (SEN) for 3D point cloud domain adaption tasks. Our SEN resorts to the advantages of Mean Teacher and semi-supervised learning, and introduces a soft classification loss and a consistency loss. Our SEN outperforms the state-of-the-art methods on both classification and segmentation tasks.
  arXiv  Detail & Related papers  (2021-12-10T02:18:09Z)
• Unsupervised Representation Learning for 3D Point Cloud Data [66.92077180228634]
  We propose a simple yet effective approach for unsupervised point cloud learning. In particular, we identify a very useful transformation which generates a good contrastive version of an original point cloud. We conduct experiments on three downstream tasks which are 3D object classification, shape part segmentation and scene segmentation.
  arXiv  Detail & Related papers  (2021-10-13T10:52:45Z)
• Self-Supervised Few-Shot Learning on Point Clouds [18.528929583956725]
  Recently, deep neural networks operating on labeled point clouds have shown promising results on supervised learning tasks like classification and segmentation. We propose two novel self-supervised pre-training tasks that encode a hierarchical partitioning of the point clouds. We show that supervised methods pre-trained with our self-supervised learning method significantly improve the accuracy of state-of-the-art methods.
  arXiv  Detail & Related papers  (2020-09-29T17:32:44Z)
• Unsupervised Feedforward Feature (UFF) Learning for Point Cloud Classification and Segmentation [57.62713515497585]
  Unsupervised feedforward feature learning is proposed for joint classification and segmentation of 3D point clouds. The UFF method exploits statistical correlations of points in a point cloud set to learn shape and point features in a one-pass feedforward manner. It learns global shape features through the encoder and local point features through the encoder-decoder architecture.
  arXiv  Detail & Related papers  (2020-09-02T18:25:25Z)
• Do We Really Need to Access the Source Data? Source Hypothesis Transfer for Unsupervised Domain Adaptation [102.67010690592011]
  Unsupervised adaptationUDA (UDA) aims to leverage the knowledge learned from a labeled source dataset to solve similar tasks in a new unlabeled domain. Prior UDA methods typically require to access the source data when learning to adapt the model. This work tackles a practical setting where only a trained source model is available and how we can effectively utilize such a model without source data to solve UDA problems.
  arXiv  Detail & Related papers  (2020-02-20T03:13:58Z)

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.