LAKe-Net: Topology-Aware Point Cloud Completion by Localizing Aligned Keypoints

• URL: http://arxiv.org/abs/2203.16771v1
• Date: Thu, 31 Mar 2022 03:14:48 GMT
• Title: LAKe-Net: Topology-Aware Point Cloud Completion by Localizing Aligned Keypoints
• Authors: Junshu Tang, Zhijun Gong, Ran Yi, Yuan Xie, Lizhuang Ma
• Abstract summary: 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.
• Score: 35.82520172874995
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Point cloud completion aims at completing geometric and topological shapes from a partial observation. However, some topology of the original shape is missing, existing methods directly predict the location of complete points, without predicting structured and topological information of the complete shape, which leads to inferior performance. To better tackle the missing topology part, we propose LAKe-Net, a novel topology-aware point cloud completion model by localizing aligned keypoints, with a novel Keypoints-Skeleton-Shape prediction manner. Specifically, our method completes missing topology using three steps: 1) Aligned Keypoint Localization. An asymmetric keypoint locator, including an unsupervised multi-scale keypoint detector and a complete keypoint generator, is proposed for localizing aligned keypoints from complete and partial point clouds. We theoretically prove that the detector can capture aligned keypoints for objects within a sub-category. 2) Surface-skeleton Generation. A new type of skeleton, named Surface-skeleton, is generated from keypoints based on geometric priors to fully represent the topological information captured from keypoints and better recover the local details. 3) Shape Refinement. We design a refinement subnet where multi-scale surface-skeletons are fed into each recursive skeleton-assisted refinement module to assist the completion process. Experimental results show that our method achieves the state-of-the-art performance on point cloud completion.

Related papers

• Flattening-Net: Deep Regular 2D Representation for 3D Point Cloud Analysis [66.49788145564004]
  We present an unsupervised deep neural architecture called Flattening-Net to represent irregular 3D point clouds of arbitrary geometry and topology. Our methods perform favorably against the current state-of-the-art competitors.
  arXiv  Detail & Related papers  (2022-12-17T15:05:25Z)
• 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)
• Point2Skeleton: Learning Skeletal Representations from Point Clouds [36.62519847312199]
  We introduce Point2Skeleton, an unsupervised method to learn skeletal representations from point clouds. We first predict a set of skeletal points by learning a geometric transformation, and then analyze the connectivity of the skeletal points to form skeletal mesh structures.
  arXiv  Detail & Related papers  (2020-12-01T03:04:09Z)
• Skeleton-bridged Point Completion: From Global Inference to Local Adjustment [48.2757171993437]
  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.
  arXiv  Detail & Related papers  (2020-10-14T22:49:30Z)
• 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)
• 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)
• SK-Net: Deep Learning on Point Cloud via End-to-end Discovery of Spatial Keypoints [7.223394571022494]
  This paper presents an end-to-end framework, SK-Net, to jointly optimize the inference of spatial keypoint with the learning of feature representation of a point cloud. Our proposed method performs better than or comparable with the state-of-the-art approaches in point cloud tasks.
  arXiv  Detail & Related papers  (2020-03-31T08:15:40Z)

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.