Unsupervised Partial Point Set Registration via Joint Shape Completion and Registration

• URL: http://arxiv.org/abs/2009.05290v1
• Date: Fri, 11 Sep 2020 08:50:53 GMT
• Title: Unsupervised Partial Point Set Registration via Joint Shape Completion and Registration
• Authors: Xiang Li, Lingjing Wang, Yi Fang
• Abstract summary: We propose a self-supervised method for partial point set registration. We use a shape completion network to bridge the performance gaps between partial point set registration and full point set registration. Experiments on the ModelNet40 dataset demonstrate the effectiveness of our model for partial point set registration.
• Score: 15.900382629390297
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We propose a self-supervised method for partial point set registration. While recent proposed learning-based methods have achieved impressive registration performance on the full shape observations, these methods mostly suffer from performance degradation when dealing with partial shapes. To bridge the performance gaps between partial point set registration with full point set registration, we proposed to incorporate a shape completion network to benefit the registration process. To achieve this, we design a latent code for each pair of shapes, which can be regarded as a geometric encoding of the target shape. By doing so, our model does need an explicit feature embedding network to learn the feature encodings. More importantly, both our shape completion network and the point set registration network take the shared latent codes as input, which are optimized along with the parameters of two decoder networks in the training process. Therefore, the point set registration process can thus benefit from the joint optimization process of latent codes, which are enforced to represent the information of full shape instead of partial ones. In the inference stage, we fix the network parameter and optimize the latent codes to get the optimal shape completion and registration results. Our proposed method is pure unsupervised and does not need any ground truth supervision. Experiments on the ModelNet40 dataset demonstrate the effectiveness of our model for partial point set registration.

Related papers

• DBDNet:Partial-to-Partial Point Cloud Registration with Dual Branches Decoupling [15.382633946370978]
  We propose an effective registration method with dual branches decoupling for partial-to-partial registration, dubbed as DBDNet. We present an overlap predictor that benefits from explicit feature interaction, which is achieved by the powerful attention mechanism to accurately predict pointwise masks. We design a multi-resolution feature extraction network to capture both local and global patterns thus enhancing both overlap prediction and registration module.
  arXiv  Detail & Related papers  (2023-10-18T06:09:12Z)
• Point Set Self-Embedding [63.23565826873297]
  This work presents an innovative method for point set self-embedding, that encodes structural information of a dense point set into its sparser version in a visual but imperceptible form. The self-embedded point set can function as the ordinary downsampled one and be visualized efficiently on mobile devices. We can leverage the self-embedded information to fully restore the original point set for detailed analysis on remote servers.
  arXiv  Detail & Related papers  (2022-02-28T07:03:33Z)
• UPDesc: Unsupervised Point Descriptor Learning for Robust Registration [54.95201961399334]
  UPDesc is an unsupervised method to learn point descriptors for robust point cloud registration. We show that our learned descriptors yield superior performance over existing unsupervised methods.
  arXiv  Detail & Related papers  (2021-08-05T17:11:08Z)
• Point Cloud Registration using Representative Overlapping Points [10.843159482657303]
  We propose ROPNet, a new deep learning model using Representative Overlapping Points with discriminative features for registration. Specifically, we propose a context-guided module which uses an encoder to extract global features for predicting point overlap score. Experiments over ModelNet40 using noisy and partially overlapping point clouds show that the proposed method outperforms traditional and learning-based methods.
  arXiv  Detail & Related papers  (2021-07-06T12:52:22Z)
• An Adaptive Framework for Learning Unsupervised Depth Completion [59.17364202590475]
  We present a method to infer a dense depth map from a color image and associated sparse depth measurements. We show that regularization and co-visibility are related via the fitness of the model to data and can be unified into a single framework.
  arXiv  Detail & Related papers  (2021-06-06T02:27:55Z)
• Consistent Two-Flow Network for Tele-Registration of Point Clouds [74.51029406361997]
  We present a learning-based technique that allows registration between point clouds, presented in arbitrary poses, and having little or even no overlap. Our technique is based on a novel neural network design that learns a prior of a class of shapes and can complete a partial shape. We show that, compared with each separate flow, this two-flow training leads to robust and reliable tele-registration.
  arXiv  Detail & Related papers  (2021-06-01T09:03:21Z)
• Cascaded Feature Warping Network for Unsupervised Medical Image Registration [11.052668687673998]
  We pre-sent a cascaded feature warping network to perform the coarse-to-fine registration. A shared-weights encoder network is adopted to generate the feature pyramids for the unaligned images. The results show that our method outperforms the state-of-the-art methods.
  arXiv  Detail & Related papers  (2021-03-15T08:50:06Z)
• SPU-Net: Self-Supervised Point Cloud Upsampling by Coarse-to-Fine Reconstruction with Self-Projection Optimization [52.20602782690776]
  It is expensive and tedious to obtain large scale paired sparse-canned point sets for training from real scanned sparse data. We propose a self-supervised point cloud upsampling network, named SPU-Net, to capture the inherent upsampling patterns of points lying on the underlying object surface. We conduct various experiments on both synthetic and real-scanned datasets, and the results demonstrate that we achieve comparable performance to the state-of-the-art supervised methods.
  arXiv  Detail & Related papers  (2020-12-08T14:14:09Z)
• 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)
• Deep-3DAligner: Unsupervised 3D Point Set Registration Network With Optimizable Latent Vector [15.900382629390297]
  We propose to develop a novel model that integrates the optimization to learning, aiming to address the technical challenges in 3D registration. In addition to the deep transformation decoding network, our framework introduce an optimizable deep underlineSpatial underlineCorrelation underlineRepresentation.
  arXiv  Detail & Related papers  (2020-09-29T22:44:38Z)

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.