Skeleton-bridged Point Completion: From Global Inference to Local Adjustment

• URL: http://arxiv.org/abs/2010.07428v1
• Date: Wed, 14 Oct 2020 22:49:30 GMT
• Title: Skeleton-bridged Point Completion: From Global Inference to Local Adjustment
• Authors: Yinyu Nie, Yiqun Lin, Xiaoguang Han, Shihui Guo, Jian Chang, Shuguang Cui, Jian Jun Zhang
• Abstract summary: We propose a skeleton-bridged point completion network (SK-PCN) for shape completion. Given a partial scan, our method first predicts its 3D skeleton to obtain the global structure. We decouple the shape completion into structure estimation and surface reconstruction, which eases the learning difficulty.
• Score: 48.2757171993437
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Point completion refers to complete the missing geometries of objects from partial point clouds. Existing works usually estimate the missing shape by decoding a latent feature encoded from the input points. However, real-world objects are usually with diverse topologies and surface details, which a latent feature may fail to represent to recover a clean and complete surface. To this end, we propose a skeleton-bridged point completion network (SK-PCN) for shape completion. Given a partial scan, our method first predicts its 3D skeleton to obtain the global structure, and completes the surface by learning displacements from skeletal points. We decouple the shape completion into structure estimation and surface reconstruction, which eases the learning difficulty and benefits our method to obtain on-surface details. Besides, considering the missing features during encoding input points, SK-PCN adopts a local adjustment strategy that merges the input point cloud to our predictions for surface refinement. Comparing with previous methods, our skeleton-bridged manner better supports point normal estimation to obtain the full surface mesh beyond point clouds. The qualitative and quantitative experiments on both point cloud and mesh completion show that our approach outperforms the existing methods on various object categories.

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)
• LAKe-Net: Topology-Aware Point Cloud Completion by Localizing Aligned Keypoints [35.82520172874995]
  LAKe-Net is a novel point cloud completion model by localizing aligned keypoints. A new type of skeleton, named Surface-skeleton, is generated from keypoints based on geometric priors. Experimental results show that our method achieves the state-of-the-art performance on point cloud completion.
  arXiv  Detail & Related papers  (2022-03-31T03:14:48Z)
• Voxel-based Network for Shape Completion by Leveraging Edge Generation [76.23436070605348]
  We develop a voxel-based network for point cloud completion by leveraging edge generation (VE-PCN) We first embed point clouds into regular voxel grids, and then generate complete objects with the help of the hallucinated shape edges. This decoupled architecture together with a multi-scale grid feature learning is able to generate more realistic on-surface details.
  arXiv  Detail & Related papers  (2021-08-23T05:10:29Z)
• ME-PCN: Point Completion Conditioned on Mask Emptiness [50.414383063838336]
  Main-stream methods predict missing shapes by decoding a global feature learned from the input point cloud. We present ME-PCN, a point completion network that leverages emptiness' in 3D shape space.
  arXiv  Detail & Related papers  (2021-08-18T15:02:27Z)
• 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)
• RfD-Net: Point Scene Understanding by Semantic Instance Reconstruction [19.535169371240073]
  We introduce RfD-Net that jointly detects and reconstructs dense object surfaces directly from point clouds. We decouple the instance reconstruction into global object localization and local shape prediction. Our approach consistently outperforms the state-of-the-arts and improves over 11 of mesh IoU in object reconstruction.
  arXiv  Detail & Related papers  (2020-11-30T12:58:05Z)
• 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.