Point Cloud Completion by Skip-attention Network with Hierarchical Folding

• URL: http://arxiv.org/abs/2005.03871v2
• Date: Mon, 18 May 2020 14:10:05 GMT
• Title: Point Cloud Completion by Skip-attention Network with Hierarchical Folding
• Authors: Xin Wen, Tianyang Li, Zhizhong Han, Yu-Shen Liu
• Abstract summary: 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.
• Score: 61.59710288271434
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Point cloud completion aims to infer the complete geometries for missing regions of 3D objects from incomplete ones. Previous methods usually predict the complete point cloud based on the global shape representation extracted from the incomplete input. However, the global representation often suffers from the information loss of structure details on local regions of incomplete point cloud. To address this problem, we propose Skip-Attention Network (SA-Net) for 3D point cloud completion. Our main contributions lie in the following two-folds. First, we propose a skip-attention mechanism to effectively exploit the local structure details of incomplete point clouds during the inference of missing parts. The skip-attention mechanism selectively conveys geometric information from the local regions of incomplete point clouds for the generation of complete ones at different resolutions, where the skip-attention reveals the completion process in an interpretable way. 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 with hierarchical folding for complete shape generation. The hierarchical folding preserves the structure of complete point cloud generated in upper layer by progressively detailing the local regions, using the skip-attentioned geometry at the same resolution. We conduct comprehensive experiments on ShapeNet and KITTI datasets, which demonstrate that the proposed SA-Net outperforms the state-of-the-art point cloud completion methods.

Related papers

• Point Cloud Completion Guided by Prior Knowledge via Causal Inference [19.935868881427226]
  We propose a novel approach to point cloud completion task called Point-PC. Point-PC uses a memory network to retrieve shape priors and designs a causal inference model to filter missing shape information. Experimental results on the ShapeNet-55, PCN, and KITTI datasets demonstrate that Point-PC outperforms the state-of-the-art methods.
  arXiv  Detail & Related papers  (2023-05-28T16:33:35Z)
• 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)
• PointAttN: You Only Need Attention for Point Cloud Completion [89.88766317412052]
  Point cloud completion refers to completing 3D shapes from partial 3D point clouds. We propose a novel neural network for processing point cloud in a per-point manner to eliminate kNNs. The proposed framework, namely PointAttN, is simple, neat and effective, which can precisely capture the structural information of 3D shapes.
  arXiv  Detail & Related papers  (2022-03-16T09:20:01Z)
• Point cloud completion on structured feature map with feedback network [28.710494879042002]
  We propose FSNet, a feature structuring module that can adaptively aggregate point-wise features into a 2D structured feature map. A 2D convolutional neural network is adopted to decode feature maps from FSNet into a coarse and complete point cloud. A point cloud upsampling network is used to generate dense point cloud from the partial input and the coarse intermediate output.
  arXiv  Detail & Related papers  (2022-02-17T10:59:40Z)
• 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)
• 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)
• 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.