Learning a Task-specific Descriptor for Robust Matching of 3D Point Clouds

• URL: http://arxiv.org/abs/2210.14899v1
• Date: Wed, 26 Oct 2022 17:57:23 GMT
• Title: Learning a Task-specific Descriptor for Robust Matching of 3D Point Clouds
• Authors: Zhiyuan Zhang, Yuchao Dai, Bin Fan, Jiadai Sun, Mingyi He
• Abstract summary: We learn a robust task-specific feature descriptor to consistently describe the correct point correspondence under interference. Our method EDFNet develops from two aspects. First, we augment the matchability of correspondences by utilizing their repetitive local structure.
• Score: 40.81429160296275
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Existing learning-based point feature descriptors are usually task-agnostic, which pursue describing the individual 3D point clouds as accurate as possible. However, the matching task aims at describing the corresponding points consistently across different 3D point clouds. Therefore these too accurate features may play a counterproductive role due to the inconsistent point feature representations of correspondences caused by the unpredictable noise, partiality, deformation, \etc, in the local geometry. In this paper, we propose to learn a robust task-specific feature descriptor to consistently describe the correct point correspondence under interference. Born with an Encoder and a Dynamic Fusion module, our method EDFNet develops from two aspects. First, we augment the matchability of correspondences by utilizing their repetitive local structure. To this end, a special encoder is designed to exploit two input point clouds jointly for each point descriptor. It not only captures the local geometry of each point in the current point cloud by convolution, but also exploits the repetitive structure from paired point cloud by Transformer. Second, we propose a dynamical fusion module to jointly use different scale features. There is an inevitable struggle between robustness and discriminativeness of the single scale feature. Specifically, the small scale feature is robust since little interference exists in this small receptive field. But it is not sufficiently discriminative as there are many repetitive local structures within a point cloud. Thus the resultant descriptors will lead to many incorrect matches. In contrast, the large scale feature is more discriminative by integrating more neighborhood information. ...

Related papers

• Mini-PointNetPlus: a local feature descriptor in deep learning model for 3d environment perception [7.304195370862869]
  We propose a novel local feature descriptor, mini-PointNetPlus, as an alternative for plug-and-play to PointNet. Our basic idea is to separately project the data points to the individual features considered, each leading to a permutation invariant. Due to fully utilizing the features by the proposed descriptor, we demonstrate in experiment a considerable performance improvement for 3D perception.
  arXiv  Detail & Related papers  (2023-07-25T07:30:28Z)
• SE(3)-Equivariant Attention Networks for Shape Reconstruction in Function Space [50.14426188851305]
  We propose the first SE(3)-equivariant coordinate-based network for learning occupancy fields from point clouds. In contrast to previous shape reconstruction methods that align the input to a regular grid, we operate directly on the irregular, unoriented point cloud. We show that our method outperforms previous SO(3)-equivariant methods, as well as non-equivariant methods trained on SO(3)-augmented datasets.
  arXiv  Detail & Related papers  (2022-04-05T17:59:15Z)
• IDEA-Net: Dynamic 3D Point Cloud Interpolation via Deep Embedding Alignment [58.8330387551499]
  We formulate the problem as estimation of point-wise trajectories (i.e., smooth curves) We propose IDEA-Net, an end-to-end deep learning framework, which disentangles the problem under the assistance of the explicitly learned temporal consistency. We demonstrate the effectiveness of our method on various point cloud sequences and observe large improvement over state-of-the-art methods both quantitatively and visually.
  arXiv  Detail & Related papers  (2022-03-22T10:14:08Z)
• RIConv++: Effective Rotation Invariant Convolutions for 3D Point Clouds Deep Learning [32.18566879365623]
  3D point clouds deep learning is a promising field of research that allows a neural network to learn features of point clouds directly. We propose a simple yet effective convolution operator that enhances feature distinction by designing powerful rotation invariant features from the local regions. Our network architecture can capture both local and global context by simply tuning the neighborhood size in each convolution layer.
  arXiv  Detail & Related papers  (2022-02-26T08:32:44Z)
• Deep Confidence Guided Distance for 3D Partial Shape Registration [14.315501760755609]
  We present a novel non-iterative learnable method for partial-to-partial 3D shape registration. We present Confidence Guided Distance Network (CGD-net), where we fuse learnable similarity between point embeddings and spatial distance between point clouds.
  arXiv  Detail & Related papers  (2022-01-27T08:40:05Z)
• Dynamic Convolution for 3D Point Cloud Instance Segmentation [146.7971476424351]
  We propose an approach to instance segmentation from 3D point clouds based on dynamic convolution. We gather homogeneous points that have identical semantic categories and close votes for the geometric centroids. The proposed approach is proposal-free, and instead exploits a convolution process that adapts to the spatial and semantic characteristics of each instance.
  arXiv  Detail & Related papers  (2021-07-18T09:05:16Z)
• 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)
• Robust Kernel-based Feature Representation for 3D Point Cloud Analysis via Circular Graph Convolutional Network [2.42919716430661]
  We present a new local feature description method that is robust to rotation, density, and scale variations. To improve representations of the local descriptors, we propose a global aggregation method. Our method shows superior performances when compared to the state-of-the-art methods.
  arXiv  Detail & Related papers  (2020-12-22T18:02:57Z)
• Learning Geometry-Disentangled Representation for Complementary Understanding of 3D Object Point Cloud [50.56461318879761]
  We propose Geometry-Disentangled Attention Network (GDANet) for 3D image processing. GDANet disentangles point clouds into contour and flat part of 3D objects, respectively denoted by sharp and gentle variation components. Experiments on 3D object classification and segmentation benchmarks demonstrate that GDANet achieves the state-of-the-arts with fewer parameters.
  arXiv  Detail & Related papers  (2020-12-20T13:35:00Z)
• Deep Positional and Relational Feature Learning for Rotation-Invariant Point Cloud Analysis [107.9979381402172]
  We propose a rotation-invariant deep network for point clouds analysis. The network is hierarchical and relies on two modules: a positional feature embedding block and a relational feature embedding block. Experiments show state-of-the-art classification and segmentation performances on benchmark datasets.
  arXiv  Detail & Related papers  (2020-11-18T04:16:51Z)

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.