Unsupervised Point Cloud Completion through Unbalanced Optimal Transport

• URL: http://arxiv.org/abs/2410.02671v4
• Date: Thu, 29 May 2025 19:57:29 GMT
• Title: Unsupervised Point Cloud Completion through Unbalanced Optimal Transport
• Authors: Taekyung Lee, Jaemoo Choi, Jaewoong Choi, Myungjoo Kang,
• Abstract summary: We propose the textitUnbalanced Optimal Transport Map for Unpaired Point Cloud Completion (textbfUOT-UPC) model.<n>Our method employs a Neural OT model learning the UOT map using neural networks.<n>Our approach is especially robust under the class imbalance problem, which is frequently encountered in real-world unpaired point cloud completion scenarios.
• Score: 8.129163248035958
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Unpaired point cloud completion is crucial for real-world applications, where ground-truth data for complete point clouds are often unavailable. By learning a completion map from unpaired incomplete and complete point cloud data, this task avoids the reliance on paired datasets. In this paper, we propose the \textit{Unbalanced Optimal Transport Map for Unpaired Point Cloud Completion (\textbf{UOT-UPC})} model, which formulates the unpaired completion task as the (Unbalanced) Optimal Transport (OT) problem. Our method employs a Neural OT model learning the UOT map using neural networks. Our model is the first attempt to leverage UOT for unpaired point cloud completion, achieving competitive or superior performance on both single-category and multi-category benchmarks. In particular, our approach is especially robust under the class imbalance problem, which is frequently encountered in real-world unpaired point cloud completion scenarios. The code is available at https://github.com/LEETK99/UOT-UPC.

Related papers

• RefComp: A Reference-guided Unified Framework for Unpaired Point Cloud Completion [53.28542050638217]
  The unpaired point cloud completion task aims to complete a partial point cloud by using models trained with no ground truth. Existing unpaired point cloud completion methods are class-aware, i.e., a separate model is needed for each object class. We propose a novel unpaired point cloud completion framework, namely the Reference-guided Completion (RefComp) framework.
  arXiv  Detail & Related papers  (2025-04-18T16:40:16Z)
• 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)
• Point Cloud Pre-training with Diffusion Models [62.12279263217138]
  We propose a novel pre-training method called Point cloud Diffusion pre-training (PointDif) PointDif achieves substantial improvement across various real-world datasets for diverse downstream tasks such as classification, segmentation and detection.
  arXiv  Detail & Related papers  (2023-11-25T08:10:05Z)
• 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)
• Learnable Graph Matching: A Practical Paradigm for Data Association [74.28753343714858]
  We propose a general learnable graph matching method to address these issues. Our method achieves state-of-the-art performance on several MOT datasets. For image matching, our method outperforms state-of-the-art methods on a popular indoor dataset, ScanNet.
  arXiv  Detail & Related papers  (2023-03-27T17:39:00Z)
• Are All Point Clouds Suitable for Completion? Weakly Supervised Quality Evaluation Network for Point Cloud Completion [34.087139118297706]
  We propose a quality evaluation network to score the point clouds and help judge the quality of the point cloud. We verify our network using detection and flow estimation tasks on KITTI, a real-world dataset for autonomous driving.
  arXiv  Detail & Related papers  (2023-03-03T09:24:29Z)
• Reconstruction-Aware Prior Distillation for Semi-supervised Point Cloud Completion [10.649666758735663]
  Real-world sensors often produce incomplete, irregular, and noisy point clouds. This paper proposes RaPD, a novel semi-supervised point cloud completion method.
  arXiv  Detail & Related papers  (2022-04-20T02:14:20Z)
• Completing Partial Point Clouds with Outliers by Collaborative Completion and Segmentation [22.521376982725517]
  We propose an end-to-end network, named CS-Net, to complete the point clouds contaminated by noises or containing outliers. Our comprehensive experiments and comparisons against state-of-the-art completion methods demonstrate our superiority.
  arXiv  Detail & Related papers  (2022-03-18T07:31:41Z)
• A Conditional Point Diffusion-Refinement Paradigm for 3D Point Cloud Completion [69.32451612060214]
  Real-scanned 3D point clouds are often incomplete, and it is important to recover complete point clouds for downstream applications. Most existing point cloud completion methods use Chamfer Distance (CD) loss for training. We propose a novel Point Diffusion-Refinement (PDR) paradigm for point cloud completion.
  arXiv  Detail & Related papers  (2021-12-07T06:59:06Z)
• 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)
• Cascaded Refinement Network for Point Cloud Completion with Self-supervision [74.80746431691938]
  We introduce a two-branch network for shape completion. The first branch is a cascaded shape completion sub-network to synthesize complete objects. The second branch is an auto-encoder to reconstruct the original partial input.
  arXiv  Detail & Related papers  (2020-10-17T04:56:22Z)
• Point Cloud Completion by Learning Shape Priors [74.80746431691938]
  shape priors include geometric information in both complete and partial point clouds. We design a feature alignment strategy to learn the shape prior from complete points, and a coarse to fine strategy to incorporate partial prior in the fine stage. We achieve state-of-the-art performances on the point cloud completion task.
  arXiv  Detail & Related papers  (2020-08-02T04:00:32Z)
• 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)

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.