SnowflakeNet: Point Cloud Completion by Snowflake Point Deconvolution with Skip-Transformer

• URL: http://arxiv.org/abs/2108.04444v1
• Date: Tue, 10 Aug 2021 04:33:37 GMT
• Title: SnowflakeNet: Point Cloud Completion by Snowflake Point Deconvolution with Skip-Transformer
• Authors: Peng Xiang, Xin Wen, Yu-Shen Liu, Yan-Pei Cao, Pengfei Wan, Wen Zheng, Zhizhong Han
• Abstract summary: We propose SnowflakeNet with Snowflake Point Deconvolution (SPD) to generate the complete point clouds. SPD learns point splitting patterns which can fit local regions the best. Our experimental results outperform the state-of-the-art point cloud completion methods under widely used benchmarks.
• Score: 54.45987960347304
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Point cloud completion aims to predict a complete shape in high accuracy from its partial observation. However, previous methods usually suffered from discrete nature of point cloud and unstructured prediction of points in local regions, which makes it hard to reveal fine local geometric details on the complete shape. To resolve this issue, we propose SnowflakeNet with Snowflake Point Deconvolution (SPD) to generate the complete point clouds. The SnowflakeNet models the generation of complete point clouds as the snowflake-like growth of points in 3D space, where the child points are progressively generated by splitting their parent points after each SPD. Our insight of revealing detailed geometry is to introduce skip-transformer in SPD to learn point splitting patterns which can fit local regions the best. Skip-transformer leverages attention mechanism to summarize the splitting patterns used in the previous SPD layer to produce the splitting in the current SPD layer. The locally compact and structured point cloud generated by SPD is able to precisely capture the structure characteristic of 3D shape in local patches, which enables the network to predict highly detailed geometries, such as smooth regions, sharp edges and corners. Our experimental results outperform the state-of-the-art point cloud completion methods under widely used benchmarks. Code will be available at https://github.com/AllenXiangX/SnowflakeNet.

Related papers

• 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)
• PMP-Net++: Point Cloud Completion by Transformer-Enhanced Multi-step Point Moving Paths [60.32185890237936]
  We design a novel neural network, named PMP-Net++, to mimic behavior of an earth mover. It moves each point of incomplete input to obtain a complete point cloud, where total distance of point moving paths (PMPs) should be the shortest. The network learns a strict and unique correspondence on point-level, and thus improves quality of predicted complete shape.
  arXiv  Detail & Related papers  (2022-02-19T03:00:40Z)
• Snowflake Point Deconvolution for Point Cloud Completion and Generation with Skip-Transformer [60.32185890237936]
  We propose SnowflakeNet with Snowflake Point Deconvolution (SPD) to generate the complete point clouds. SPD models the generation of complete point clouds as the snowflake-like growth of points, where the child points are progressively generated by splitting their parent points after each SPD. Our insight of revealing detailed geometry is to introduce skip-transformer in SPD to learn point splitting patterns which can fit local regions the best.
  arXiv  Detail & Related papers  (2022-02-18T17:09:49Z)
• CarveNet: Carving Point-Block for Complex 3D Shape Completion [27.65423395944538]
  3D point cloud completion heavily relies on the accurate understanding of the complex 3D shapes. We propose a new network architecture, i.e., CarveNet, to complete complex 3D point clouds. On datasets, CarveNet successfully outperforms the state-of-the-art methods.
  arXiv  Detail & Related papers  (2021-07-28T16:07:20Z)
• 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)
• 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)
• PF-Net: Point Fractal Network for 3D Point Cloud Completion [6.504317278066694]
  Point Fractal Network (PF-Net) is a novel learning-based approach for precise and high-fidelity point cloud completion. PF-Net preserves the spatial arrangements of the incomplete point cloud and can figure out the detailed geometrical structure of the missing region(s) in the prediction. Our experiments demonstrate the effectiveness of our method for several challenging point cloud completion tasks.
  arXiv  Detail & Related papers  (2020-03-01T05:40:21Z)

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.