DualGenerator: Information Interaction-based Generative Network for Point Cloud Completion

• URL: http://arxiv.org/abs/2305.09132v2
• Date: Thu, 7 Dec 2023 09:33:38 GMT
• Title: DualGenerator: Information Interaction-based Generative Network for Point Cloud Completion
• Authors: Pengcheng Shi, Haozhe Cheng, Xu Han, Yiyang Zhou, Jihua Zhu
• Abstract summary: Point cloud completion estimates complete shapes from incomplete point clouds to obtain higher-quality point cloud data. Most existing methods only consider global object features, ignoring spatial and semantic information of adjacent points. We propose an information interaction-based generative network for point cloud completion.
• Score: 25.194587599472147
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Point cloud completion estimates complete shapes from incomplete point clouds to obtain higher-quality point cloud data. Most existing methods only consider global object features, ignoring spatial and semantic information of adjacent points. They cannot distinguish structural information well between different object parts, and the robustness of models is poor. To tackle these challenges, we propose an information interaction-based generative network for point cloud completion ($\mathbf{DualGenerator}$). It contains an adversarial generation path and a variational generation path, which interact with each other and share weights. DualGenerator introduces a local refinement module in generation paths, which captures general structures from partial inputs, and then refines shape details of the point cloud. It promotes completion in the unknown region and makes a distinction between different parts more obvious. Moreover, we design DGStyleGAN to improve the generation quality further. It promotes the robustness of this network combined with fusion analysis of dual-path completion results. Qualitative and quantitative evaluations demonstrate that our method is superior on MVP and Completion3D datasets. The performance will not degrade significantly after adding noise interference or sparse sampling.

Related papers

• P2M2-Net: Part-Aware Prompt-Guided Multimodal Point Cloud Completion [6.407066306127476]
  Inferring missing regions from severely occluded point clouds is highly challenging. We propose a novel prompt-guided point cloud completion framework, coined P2M2-Net. Given an input partial point cloud and a text prompt describing the part-aware information, our Transformer-based completion network can efficiently fuse the multimodal features.
  arXiv  Detail & Related papers  (2023-12-29T14:11:45Z)
• Patch-Wise Point Cloud Generation: A Divide-and-Conquer Approach [83.05340155068721]
  We devise a new 3d point cloud generation framework using a divide-and-conquer approach. All patch generators are based on learnable priors, which aim to capture the information of geometry primitives. Experimental results on a variety of object categories from the most popular point cloud dataset, ShapeNet, show the effectiveness of the proposed patch-wise point cloud generation.
  arXiv  Detail & Related papers  (2023-07-22T11:10:39Z)
• 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)
• 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)
• PoinTr: Diverse Point Cloud Completion with Geometry-Aware Transformers [81.71904691925428]
  We present a new method that reformulates point cloud completion as a set-to-set translation problem. We also design a new model, called PoinTr, that adopts a transformer encoder-decoder architecture for point cloud completion. Our method outperforms state-of-the-art methods by a large margin on both the new benchmarks and the existing ones.
  arXiv  Detail & Related papers  (2021-08-19T17:58:56Z)
• 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)
• 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)
• 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.