An Efficient Plane Extraction Approach for Bundle Adjustment on LiDAR Point clouds

• URL: http://arxiv.org/abs/2305.00287v1
• Date: Sat, 29 Apr 2023 15:47:29 GMT
• Title: An Efficient Plane Extraction Approach for Bundle Adjustment on LiDAR Point clouds
• Authors: Zheng Liu and Fu Zhang
• Abstract summary: We propose a novel and efficient voxel-based approach for plane extraction that is specially designed to provide point association for LiDAR bundle adjustment. Our experimental results on HILTI demonstrate that our approach achieves the best precision and least time cost compared to other plane extraction methods.
• Score: 6.530864926156266
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Bundle adjustment (BA) on LiDAR point clouds has been extensively investigated in recent years due to its ability to optimize multiple poses together, resulting in high accuracy and global consistency for point cloud. However, the accuracy and speed of LiDAR bundle adjustment depend on the quality of plane extraction, which provides point association for LiDAR BA. In this study, we propose a novel and efficient voxel-based approach for plane extraction that is specially designed to provide point association for LiDAR bundle adjustment. To begin, we partition the space into multiple voxels of a fixed size and then split these root voxels based on whether the points are on the same plane, using an octree structure. We also design a novel plane determination method based on principle component analysis (PCA), which segments the points into four even quarters and compare their minimum eigenvalues with that of the initial point cloud. Finally, we adopt a plane merging method to prevent too many small planes from being in a single voxel, which can increase the optimization time required for BA. Our experimental results on HILTI demonstrate that our approach achieves the best precision and least time cost compared to other plane extraction methods.

Related papers

• Micro-Structures Graph-Based Point Cloud Registration for Balancing Efficiency and Accuracy [5.70403503863614]
  We propose a novel micro-structures graph-based global point cloud registration method. Our proposed method performs well on the 3DMatch and ETH datasets.
  arXiv  Detail & Related papers  (2024-10-29T08:36:23Z)
• SPARE: Symmetrized Point-to-Plane Distance for Robust Non-Rigid Registration [76.40993825836222]
  We propose SPARE, a novel formulation that utilizes a symmetrized point-to-plane distance for robust non-rigid registration. The proposed method greatly improves the accuracy of non-rigid registration problems and maintains relatively high solution efficiency.
  arXiv  Detail & Related papers  (2024-05-30T15:55:04Z)
• Point Cloud Classification via Deep Set Linearized Optimal Transport [51.99765487172328]
  We introduce Deep Set Linearized Optimal Transport, an algorithm designed for the efficient simultaneous embedding of point clouds into an $L2-$space. This embedding preserves specific low-dimensional structures within the Wasserstein space while constructing a classifier to distinguish between various classes of point clouds. We showcase the advantages of our algorithm over the standard deep set approach through experiments on a flow dataset with a limited number of labeled point clouds.
  arXiv  Detail & Related papers  (2024-01-02T23:26:33Z)
• Point Cloud Pre-training with Diffusion Models [62.12279263217138]
  We propose a novel pre-training method called Point cloud Diffusion pre-training (PointDif) PointDif achieves substantial improvement across various real-world datasets for diverse downstream tasks such as classification, segmentation and detection.
  arXiv  Detail & Related papers  (2023-11-25T08:10:05Z)
• Grad-PU: Arbitrary-Scale Point Cloud Upsampling via Gradient Descent with Learned Distance Functions [77.32043242988738]
  We propose a new framework for accurate point cloud upsampling that supports arbitrary upsampling rates. Our method first interpolates the low-res point cloud according to a given upsampling rate.
  arXiv  Detail & Related papers  (2023-04-24T06:36:35Z)
• VIP-SLAM: An Efficient Tightly-Coupled RGB-D Visual Inertial Planar SLAM [25.681256050571058]
  We propose a tightly-coupled SLAM system fused with RGB, Depth, IMU and structured plane information. We use homography constraints to eliminate the parameters of numerous plane points in the optimization. The global bundle adjustment is nearly 2 times faster than the sparse points based SLAM algorithm.
  arXiv  Detail & Related papers  (2022-07-04T01:45:24Z)
• On Enhancing Ground Surface Detection from Sparse Lidar Point Cloud [6.577622354490276]
  This paper proposes ground detection techniques applicable to much sparser point cloud captured by lidars with low beam resolution. The approach is based on the RANSAC scheme of plane fitting.
  arXiv  Detail & Related papers  (2021-05-25T03:58:18Z)
• Efficient LiDAR Odometry for Autonomous Driving [16.22522474028277]
  LiDAR odometry plays an important role in self-localization and mapping for autonomous navigation. Recent spherical range image-based method enjoys the merits of fast nearest neighbor search by spherical mapping. We propose a novel efficient LiDAR odometry approach by taking advantage of both non-ground spherical range image and bird's-eye-view map for ground points.
  arXiv  Detail & Related papers  (2021-04-22T06:05:09Z)
• Accurate and Robust Scale Recovery for Monocular Visual Odometry Based on Plane Geometry [7.169216737580712]
  We develop a lightweight scale recovery framework leveraging an accurate and robust estimation of the ground plane. Experiments on the KITTI dataset show that the proposed framework can achieve state-of-theart accuracy in terms of translation errors. Due to the light-weight design, our framework also demonstrates a high frequency of 20Hz on the dataset.
  arXiv  Detail & Related papers  (2021-01-15T07:21:24Z)
• FLOT: Scene Flow on Point Clouds Guided by Optimal Transport [82.86743909483312]
  We propose and study a method called FLOT that estimates scene flow on point clouds. Inspired by recent works on graph matching, we build a method to find these correspondences by borrowing tools from optimal transport. Our main finding is that FLOT can perform as well as the best existing methods on synthetic and real-world datasets.
  arXiv  Detail & Related papers  (2020-07-22T00:15:30Z)
• Reconfigurable Voxels: A New Representation for LiDAR-Based Point Clouds [76.52448276587707]
  We propose Reconfigurable Voxels, a new approach to constructing representations from 3D point clouds. Specifically, we devise a biased random walk scheme, which adaptively covers each neighborhood with a fixed number of voxels. We find that this approach effectively improves the stability of voxel features, especially for sparse regions.
  arXiv  Detail & Related papers  (2020-04-06T15:07:16Z)

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.