LoGDesc: Local geometric features aggregation for robust point cloud registration

• URL: http://arxiv.org/abs/2410.02420v1
• Date: Thu, 3 Oct 2024 12:11:22 GMT
• Title: LoGDesc: Local geometric features aggregation for robust point cloud registration
• Authors: Karim Slimani, Brahim Tamadazte, Catherine Achard,
• Abstract summary: This paper introduces a new hybrid descriptor for 3D point matching and point cloud registration. It combines local geometrical properties and learning-based feature propagation for each point's neighborhood structure description.
• Score: 4.888434990566421
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This paper introduces a new hybrid descriptor for 3D point matching and point cloud registration, combining local geometrical properties and learning-based feature propagation for each point's neighborhood structure description. The proposed architecture first extracts prior geometrical information by computing each point's planarity, anisotropy, and omnivariance using a Principal Components Analysis (PCA). This prior information is completed by a descriptor based on the normal vectors estimated thanks to constructing a neighborhood based on triangles. The final geometrical descriptor is propagated between the points using local graph convolutions and attention mechanisms. The new feature extractor is evaluated on ModelNet40, Bunny Stanford dataset, KITTI and MVP (Multi-View Partial)-RG for point cloud registration and shows interesting results, particularly on noisy and low overlapping point clouds.

Related papers

• Open-Vocabulary Octree-Graph for 3D Scene Understanding [54.11828083068082]
  Octree-Graph is a novel scene representation for open-vocabulary 3D scene understanding. An adaptive-octree structure is developed that stores semantics and depicts the occupancy of an object adjustably according to its shape.
  arXiv  Detail & Related papers  (2024-11-25T10:14:10Z)
• Deep Semantic Graph Matching for Large-scale Outdoor Point Clouds Registration [22.308070598885532]
  We treat the point cloud registration problem as a semantic instance matching and registration task. We propose a deep semantic graph matching method (DeepSGM) for large-scale outdoor point cloud registration. Experimental results conducted on the KITTI Odometry dataset demonstrate that the proposed method improves the registration performance.
  arXiv  Detail & Related papers  (2023-08-10T03:07:28Z)
• 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)
• PAPooling: Graph-based Position Adaptive Aggregation of Local Geometry in Point Clouds [15.878533142927102]
  PaPooling explicitly models spatial relations among local points using a novel graph representation. It aggregates features in a position adaptive manner, enabling position-sensitive representation of aggregated features. It can significantly improve predictive accuracy, while with minimal extra computational overhead.
  arXiv  Detail & Related papers  (2021-11-28T07:26:55Z)
• SnowflakeNet: Point Cloud Completion by Snowflake Point Deconvolution with Skip-Transformer [54.45987960347304]
  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.
  arXiv  Detail & Related papers  (2021-08-10T04:33:37Z)
• 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)
• ABD-Net: Attention Based Decomposition Network for 3D Point Cloud Decomposition [1.3999481573773074]
  We propose Attention Based Decomposition Network (ABD-Net) for point cloud decomposition. We show improved performance of 3D object classification using attention features based on primitive shapes in point clouds.
  arXiv  Detail & Related papers  (2021-07-09T08:39:30Z)
• 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)
• ODFNet: Using orientation distribution functions to characterize 3D point clouds [0.0]
  We leverage on point orientation distributions around a point in order to obtain an expressive local neighborhood representation for point clouds. New ODFNet model achieves state-of-the-art accuracy for object classification on ModelNet40 and ScanObjectNN datasets.
  arXiv  Detail & Related papers  (2020-12-08T19:54: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)
• 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)

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.