Energy-Based Residual Latent Transport for Unsupervised Point Cloud Completion

• URL: http://arxiv.org/abs/2211.06820v1
• Date: Sun, 13 Nov 2022 05:16:43 GMT
• Title: Energy-Based Residual Latent Transport for Unsupervised Point Cloud Completion
• Authors: Ruikai Cui, Shi Qiu, Saeed Anwar, Jing Zhang, Nick Barnes
• Abstract summary: 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.
• Score: 39.102570189978934
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Unsupervised point cloud completion aims to infer the whole geometry of a partial object observation without requiring partial-complete correspondence. Differing from existing deterministic approaches, we advocate generative modeling based unsupervised point cloud completion to explore the missing correspondence. Specifically, we propose a novel framework that performs completion by transforming a partial shape encoding into a complete one using a latent transport module, and it is designed as a latent-space energy-based model (EBM) in an encoder-decoder architecture, aiming to learn a probability distribution conditioned on the partial shape encoding. To train the latent code transport module and the encoder-decoder network jointly, we introduce a residual sampling strategy, where the residual captures the domain gap between partial and complete shape latent spaces. As a generative model-based framework, our method can produce uncertainty maps consistent with human perception, leading to explainable unsupervised point cloud completion. We experimentally show that the proposed method produces high-fidelity completion results, outperforming state-of-the-art models by a significant margin.

Related papers

• SPAC-Net: Rethinking Point Cloud Completion with Structural Prior [17.334882020068697]
  Point cloud completion aims to infer a complete shape from its partial observation. Many approaches utilize a pure encoderdecoder paradigm in which complete shape can be directly predicted by shape priors learned from partial scans. We propose a novel framework,termed SPAC-Net, that aims to rethink the completion task under the guidance of a new structural prior.
  arXiv  Detail & Related papers  (2024-11-22T16:54:17Z)
• Unsupervised Non-Rigid Point Cloud Matching through Large Vision Models [1.3030624795284795]
  We propose a learning-based framework for non-rigid point cloud matching. Key insight is to incorporate semantic features derived from large vision models (LVMs) Our framework effectively leverages the structural information contained in the semantic features to address ambiguities arise from self-similarities among local geometries.
  arXiv  Detail & Related papers  (2024-08-16T07:02:19Z)
• Self-supervised 3D Point Cloud Completion via Multi-view Adversarial Learning [61.14132533712537]
  We propose MAL-SPC, a framework that effectively leverages both object-level and category-specific geometric similarities to complete missing structures. Our MAL-SPC does not require any 3D complete supervision and only necessitates a single partial point cloud for each object.
  arXiv  Detail & Related papers  (2024-07-13T06:53:39Z)
• Complexity Matters: Rethinking the Latent Space for Generative Modeling [65.64763873078114]
  In generative modeling, numerous successful approaches leverage a low-dimensional latent space, e.g., Stable Diffusion. In this study, we aim to shed light on this under-explored topic by rethinking the latent space from the perspective of model complexity.
  arXiv  Detail & Related papers  (2023-07-17T07:12:29Z)
• 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)
• Learning a Structured Latent Space for Unsupervised Point Cloud Completion [48.79411151132766]
  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.
  arXiv  Detail & Related papers  (2022-03-29T13:58:44Z)
• Quasi-Balanced Self-Training on Noise-Aware Synthesis of Object Point Clouds for Closing Domain Gap [34.590531549797355]
  We propose an integrated scheme consisting of physically realistic synthesis of object point clouds via rendering stereo images via projection of speckle patterns onto CAD models. Experiment results can verify the effectiveness of our method as well as both of its modules for unsupervised domain adaptation on point cloud classification.
  arXiv  Detail & Related papers  (2022-03-08T03:44:49Z)
• Refinement of Predicted Missing Parts Enhance Point Cloud Completion [62.997667081978825]
  Point cloud completion is the task of predicting complete geometry from partial observations using a point set representation for a 3D shape. Previous approaches propose neural networks to directly estimate the whole point cloud through encoder-decoder models fed by the incomplete point set. This paper proposes an end-to-end neural network architecture that focuses on computing the missing geometry and merging the known input and the predicted point cloud.
  arXiv  Detail & Related papers  (2020-10-08T22:01:23Z)

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.