Learning a Structured Latent Space for Unsupervised Point Cloud Completion

• URL: http://arxiv.org/abs/2203.15580v1
• Date: Tue, 29 Mar 2022 13:58:44 GMT
• Title: Learning a Structured Latent Space for Unsupervised Point Cloud Completion
• Authors: Yingjie Cai, Kwan-Yee Lin, Chao Zhang, Qiang Wang, Xiaogang Wang and Hongsheng Li
• Abstract summary: We propose a novel framework, which learns a unified and structured latent space that encoding both partial and complete point clouds. Our proposed method consistently outperforms state-of-the-art unsupervised methods on both synthetic ShapeNet and real-world KITTI, ScanNet, and Matterport3D datasets.
• Score: 48.79411151132766
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Unsupervised point cloud completion aims at estimating the corresponding complete point cloud of a partial point cloud in an unpaired manner. It is a crucial but challenging problem since there is no paired partial-complete supervision that can be exploited directly. In this work, we propose a novel framework, which learns a unified and structured latent space that encoding both partial and complete point clouds. Specifically, we map a series of related partial point clouds into multiple complete shape and occlusion code pairs and fuse the codes to obtain their representations in the unified latent space. To enforce the learning of such a structured latent space, the proposed method adopts a series of constraints including structured ranking regularization, latent code swapping constraint, and distribution supervision on the related partial point clouds. By establishing such a unified and structured latent space, better partial-complete geometry consistency and shape completion accuracy can be achieved. Extensive experiments show that our proposed method consistently outperforms state-of-the-art unsupervised methods on both synthetic ShapeNet and real-world KITTI, ScanNet, and Matterport3D datasets.

Related papers

• Zero-shot Point Cloud Completion Via 2D Priors [52.72867922938023]
  3D point cloud completion is designed to recover complete shapes from partially observed point clouds. We propose a zero-shot framework aimed at completing partially observed point clouds across any unseen categories.
  arXiv  Detail & Related papers  (2024-04-10T08:02:17Z)
• P2C: Self-Supervised Point Cloud Completion from Single Partial Clouds [44.02541315496045]
  Point cloud completion aims to recover the complete shape based on a partial observation. Existing methods require either complete point clouds or multiple partial observations of the same object for learning. We present Partial2Complete, the first self-supervised framework that completes point cloud objects.
  arXiv  Detail & Related papers  (2023-07-27T09:31:01Z)
• Variational Relational Point Completion Network for Robust 3D Classification [59.80993960827833]
  Vari point cloud completion methods tend to generate global shape skeletons hence lack fine local details. This paper proposes a variational framework, point Completion Network (VRCNet) with two appealing properties. VRCNet shows great generalizability and robustness on real-world point cloud scans.
  arXiv  Detail & Related papers  (2023-04-18T17:03:20Z)
• Energy-Based Residual Latent Transport for Unsupervised Point Cloud Completion [39.102570189978934]
  Unsupervised point cloud completion aims to infer the whole geometry of a partial object observation without requiring partial-complete correspondence. We propose a novel framework that performs completion by transforming a partial shape encoding into a complete one using a latent transport module. We experimentally show that the proposed method produces high-fidelity completion results, outperforming state-of-the-art models by a significant margin.
  arXiv  Detail & Related papers  (2022-11-13T05:16:43Z)
• Variational Relational Point Completion Network [41.98957577398084]
  Existing point cloud completion methods generate global shape skeletons and lack fine local details. This paper proposes Variational point Completion network (VRCNet) with two appealing properties. VRCNet shows greatizability and robustness on real-world point cloud scans.
  arXiv  Detail & Related papers  (2021-04-20T17:53:40Z)
• PMP-Net: Point Cloud Completion by Learning Multi-step Point Moving Paths [54.459879603473034]
  We design a novel neural network, named PMP-Net, to mimic the behavior of an earth mover. It moves each point of the incomplete input to complete the point cloud, where the total distance of point moving paths should be shortest. It learns a strict and unique correspondence on point-level, which can capture the detailed topology and structure relationships between the incomplete shape and the complete target.
  arXiv  Detail & Related papers  (2020-12-07T01:34:38Z)
• Point Set Voting for Partial Point Cloud Analysis [26.31029112502835]
  techniques for point cloud classification and segmentation have in recent years achieved incredible performance driven in part by leveraging large synthetic datasets. This paper proposes a general model for partial point clouds analysis wherein the latent feature encoding a complete point clouds is inferred by applying a local point set voting strategy.
  arXiv  Detail & Related papers  (2020-07-09T03:37:31Z)
• Point Cloud Completion by Skip-attention Network with Hierarchical Folding [61.59710288271434]
  We propose Skip-Attention Network (SA-Net) for 3D point cloud completion. First, we propose a skip-attention mechanism to effectively exploit the local structure details of incomplete point clouds. Second, in order to fully utilize the selected geometric information encoded by skip-attention mechanism at different resolutions, we propose a novel structure-preserving decoder.
  arXiv  Detail & Related papers  (2020-05-08T06:23:51Z)
• Cascaded Refinement Network for Point Cloud Completion [74.80746431691938]
  We propose a cascaded refinement network together with a coarse-to-fine strategy to synthesize the detailed object shapes. Considering the local details of partial input with the global shape information together, we can preserve the existing details in the incomplete point set. We also design a patch discriminator that guarantees every local area has the same pattern with the ground truth to learn the complicated point distribution.
  arXiv  Detail & Related papers  (2020-04-07T13:03:29Z)

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.