File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Domain Adaptation on Point Clouds via Geometry-Aware Implicits

TitleDomain Adaptation on Point Clouds via Geometry-Aware Implicits
Authors
KeywordsDatasets and evaluation
Machine learning
Self- & semi- & meta- & unsupervised learning
Transfer/low-shot/long-tail learning
Issue Date2022
Citation
Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2022, v. 2022-June, p. 7213-7222 How to Cite?
AbstractAs a popular geometric representation, point clouds have attracted much attention in 3D vision, leading to many applications in autonomous driving and robotics. One important yet unsolved issue for learning on point cloud is that point clouds of the same object can have significant geometric variations if generated using different procedures or captured using different sensors. These inconsistencies induce domain gaps such that neural networks trained on one domain may fail to generalize on others. A typical technique to reduce the domain gap is to perform adversarial training so that point clouds in the feature space can align. However, adversarial training is easy to fall into degenerated local minima, resulting in negative adaptation gains. Here we propose a simple yet effective method for unsupervised domain adaptation on point clouds by employing a self-supervised task of learning geometry-aware implicits, which plays two critical roles in one shot. First, the geometric information in the point clouds is preserved through the implicit representations for downstream tasks. More importantly, the domain-specific variations can be effectively learned away in the implicit space. We also propose an adaptive strategy to compute unsigned distance fields for arbitrary point clouds due to the lack of shape models in practice. When combined with a task loss, the proposed outperforms state-of-the-art unsupervised domain adaptation methods that rely on adversarial domain alignment and more complicated self-supervised tasks. Our method is evaluated on both PointDA-10 and GraspNet datasets. Code and data are available at: https://github.com/Jhonve/ImplicitPCDA.
Persistent Identifierhttp://hdl.handle.net/10722/325583
ISSN
2023 SCImago Journal Rankings: 10.331
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorShen, Yuefan-
dc.contributor.authorYang, Yanchao-
dc.contributor.authorYan, Mi-
dc.contributor.authorWang, He-
dc.contributor.authorZheng, Youyi-
dc.contributor.authorGuibas, Leonidas-
dc.date.accessioned2023-02-27T07:34:33Z-
dc.date.available2023-02-27T07:34:33Z-
dc.date.issued2022-
dc.identifier.citationProceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2022, v. 2022-June, p. 7213-7222-
dc.identifier.issn1063-6919-
dc.identifier.urihttp://hdl.handle.net/10722/325583-
dc.description.abstractAs a popular geometric representation, point clouds have attracted much attention in 3D vision, leading to many applications in autonomous driving and robotics. One important yet unsolved issue for learning on point cloud is that point clouds of the same object can have significant geometric variations if generated using different procedures or captured using different sensors. These inconsistencies induce domain gaps such that neural networks trained on one domain may fail to generalize on others. A typical technique to reduce the domain gap is to perform adversarial training so that point clouds in the feature space can align. However, adversarial training is easy to fall into degenerated local minima, resulting in negative adaptation gains. Here we propose a simple yet effective method for unsupervised domain adaptation on point clouds by employing a self-supervised task of learning geometry-aware implicits, which plays two critical roles in one shot. First, the geometric information in the point clouds is preserved through the implicit representations for downstream tasks. More importantly, the domain-specific variations can be effectively learned away in the implicit space. We also propose an adaptive strategy to compute unsigned distance fields for arbitrary point clouds due to the lack of shape models in practice. When combined with a task loss, the proposed outperforms state-of-the-art unsupervised domain adaptation methods that rely on adversarial domain alignment and more complicated self-supervised tasks. Our method is evaluated on both PointDA-10 and GraspNet datasets. Code and data are available at: https://github.com/Jhonve/ImplicitPCDA.-
dc.languageeng-
dc.relation.ispartofProceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition-
dc.subjectDatasets and evaluation-
dc.subjectMachine learning-
dc.subjectSelf- & semi- & meta- & unsupervised learning-
dc.subjectTransfer/low-shot/long-tail learning-
dc.titleDomain Adaptation on Point Clouds via Geometry-Aware Implicits-
dc.typeConference_Paper-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1109/CVPR52688.2022.00708-
dc.identifier.scopuseid_2-s2.0-85141795262-
dc.identifier.volume2022-June-
dc.identifier.spage7213-
dc.identifier.epage7222-
dc.identifier.isiWOS:000870759100006-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats