LiDAR Point--to--point Correspondences for Rigorous Registration of Kinematic Scanning in Dynamic Networks

• URL: http://arxiv.org/abs/2201.00596v1
• Date: Mon, 3 Jan 2022 11:53:55 GMT
• Title: LiDAR Point--to--point Correspondences for Rigorous Registration of Kinematic Scanning in Dynamic Networks
• Authors: Aur\'elien Brun, Davide Antonio Cucci and Jan Skaloud
• Abstract summary: We propose a novel trajectory adjustment procedure to improve the registration of LiDAR point clouds. We describe the method for selecting correspondences and how they are inserted into the Dynamic Network as new observation models. We then describe the experiments conducted to evaluate the performance of the proposed framework in practical airborne laser scanning scenarios with low-cost MEMS inertial sensors.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: With the objective of improving the registration of LiDAR point clouds produced by kinematic scanning systems, we propose a novel trajectory adjustment procedure that leverages on the automated extraction of selected reliable 3D point--to--point correspondences between overlapping point clouds and their joint integration (adjustment) together with all raw inertial and GNSS observations. This is performed in a tightly coupled fashion using a Dynamic Network approach that results in an optimally compensated trajectory through modeling of errors at the sensor, rather than the trajectory, level. The 3D correspondences are formulated as static conditions within this network and the registered point cloud is generated with higher accuracy utilizing the corrected trajectory and possibly other parameters determined within the adjustment. We first describe the method for selecting correspondences and how they are inserted into the Dynamic Network as new observation models. We then describe the experiments conducted to evaluate the performance of the proposed framework in practical airborne laser scanning scenarios with low-cost MEMS inertial sensors. In the conducted experiments, the method proposed to establish 3D correspondences is effective in determining point--to--point matches across a wide range of geometries such as trees, buildings and cars. Our results demonstrate that the method improves the point cloud registration accuracy, that is otherwise strongly affected by errors in the determined platform attitude or position (in nominal and emulated GNSS outage conditions), and possibly determine unknown boresight angles using only a fraction of the total number of 3D correspondences that are established.

Related papers

• 3D Equivariant Pose Regression via Direct Wigner-D Harmonics Prediction [50.07071392673984]
  Existing methods learn 3D rotations parametrized in the spatial domain using angles or quaternions. We propose a frequency-domain approach that directly predicts Wigner-D coefficients for 3D rotation regression. Our method achieves state-of-the-art results on benchmarks such as ModelNet10-SO(3) and PASCAL3D+.
  arXiv  Detail & Related papers  (2024-11-01T12:50:38Z)
• DM3D: Distortion-Minimized Weight Pruning for Lossless 3D Object Detection [42.07920565812081]
  We propose a novel post-training weight pruning scheme for 3D object detection. It determines redundant parameters in the pretrained model that lead to minimal distortion in both locality and confidence. This framework aims to minimize detection distortion of network output to maximally maintain detection precision.
  arXiv  Detail & Related papers  (2024-07-02T09:33:32Z)
• Unleash the Potential of 3D Point Cloud Modeling with A Calibrated Local Geometry-driven Distance Metric [62.365983810610985]
  We propose a novel distance metric called Calibrated Local Geometry Distance (CLGD) CLGD computes the difference between the underlying 3D surfaces calibrated and induced by a set of reference points. As a generic metric, CLGD has the potential to advance 3D point cloud modeling.
  arXiv  Detail & Related papers  (2023-06-01T11:16:20Z)
• GraphReg: Dynamical Point Cloud Registration with Geometry-aware Graph Signal Processing [0.0]
  This study presents a high-accuracy, efficient, and physically induced method for 3D point cloud registration. We explore geometry aware rigid-body dynamics to regulate the particle (point) motion, which results in more precise and robust registration. Results demonstrate that our proposed method outperforms state-of-the-art approaches in terms of accuracy and is more suitable for registering large-scale point clouds.
  arXiv  Detail & Related papers  (2023-02-02T14:06:46Z)
• 3DMODT: Attention-Guided Affinities for Joint Detection & Tracking in 3D Point Clouds [95.54285993019843]
  We propose a method for joint detection and tracking of multiple objects in 3D point clouds. Our model exploits temporal information employing multiple frames to detect objects and track them in a single network.
  arXiv  Detail & Related papers  (2022-11-01T20:59:38Z)
• Dual Adaptive Transformations for Weakly Supervised Point Cloud Segmentation [78.6612285236938]
  We propose a novel DAT (textbfDual textbfAdaptive textbfTransformations) model for weakly supervised point cloud segmentation. We evaluate our proposed DAT model with two popular backbones on the large-scale S3DIS and ScanNet-V2 datasets.
  arXiv  Detail & Related papers  (2022-07-19T05:43:14Z)
• COTReg:Coupled Optimal Transport based Point Cloud Registration [28.730827908402286]
  This paper proposes a learning framework COTReg to predict correspondences of 3D point cloud registration. We transform the two matchings into a Wasserstein distance-based and a Gromov-Wasserstein distance-based optimizations. Our correspondence prediction pipeline can be easily integrated into either learning-based features like FCGF or traditional descriptors like FPFH.
  arXiv  Detail & Related papers  (2021-12-29T03:20:18Z)
• SCTN: Sparse Convolution-Transformer Network for Scene Flow Estimation [71.2856098776959]
  Estimating 3D motions for point clouds is challenging, since a point cloud is unordered and its density is significantly non-uniform. We propose a novel architecture named Sparse Convolution-Transformer Network (SCTN) that equips the sparse convolution with the transformer. We show that the learned relation-based contextual information is rich and helpful for matching corresponding points, benefiting scene flow estimation.
  arXiv  Detail & Related papers  (2021-05-10T15:16:14Z)
• SCPM-Net: An Anchor-free 3D Lung Nodule Detection Network using Sphere Representation and Center Points Matching [47.79483848496141]
  We propose a 3D sphere representation-based center-points matching detection network (SCPM-Net) It is anchor-free and automatically predicts the position, radius, and offset of nodules without the manual design of nodule/anchor parameters. We show that our proposed SCPM-Net framework achieves superior performance compared with existing used anchor-based and anchor-free methods for lung nodule detection.
  arXiv  Detail & Related papers  (2021-04-12T05:51:29Z)
• ACSC: Automatic Calibration for Non-repetitive Scanning Solid-State LiDAR and Camera Systems [11.787271829250805]
  Solid-State LiDAR (SSL) enables low-cost and efficient obtainment of 3D point clouds from the environment. We propose a fully automatic calibration method for the non-repetitive scanning SSL and camera systems. We evaluate the proposed method on different types of LiDAR and camera sensor combinations in real conditions.
  arXiv  Detail & Related papers  (2020-11-17T09:11:28Z)
• Spatiotemporal Camera-LiDAR Calibration: A Targetless and Structureless Approach [32.15405927679048]
  We propose a targetless and structureless camera-DAR calibration method. Our method combines a closed-form solution with a structureless bundle where the coarse-to-fine approach does not require an initial adjustment on the temporal parameters. We demonstrate the accuracy and robustness of the proposed method through both simulation and real data experiments.
  arXiv  Detail & Related papers  (2020-01-17T07:25:59Z)

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.