L-PR: Exploiting LiDAR Fiducial Marker for Unordered Low Overlap Multiview Point Cloud Registration
- URL: http://arxiv.org/abs/2406.03298v1
- Date: Wed, 5 Jun 2024 14:08:13 GMT
- Title: L-PR: Exploiting LiDAR Fiducial Marker for Unordered Low Overlap Multiview Point Cloud Registration
- Authors: Yibo Liu, Jinjun Shan, Amaldev Haridevan, Shuo Zhang, Kejian Lin,
- Abstract summary: This paper introduces a novel framework named L-PR, designed to register unordered low overlap point clouds.
We refer to them as LiDAR fiducial markers, but they are the same as the popular AprilTag and ArUco markers.
We conduct qualitative and quantitative experiments to demonstrate that the proposed method exhibits superiority over competitors in four aspects.
- Score: 4.880213050259736
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Point cloud registration is a prerequisite for many applications in computer vision and robotics. Most existing methods focus on pairwise registration of two point clouds with high overlap. Although there have been some methods for low overlap cases, they struggle in degraded scenarios. This paper introduces a novel framework named L-PR, designed to register unordered low overlap multiview point clouds leveraging LiDAR fiducial markers. We refer to them as LiDAR fiducial markers, but they are the same as the popular AprilTag and ArUco markers, thin sheets of paper that do not affect the 3D geometry of the environment. We first propose an improved adaptive threshold marker detection method to provide robust detection results when the viewpoints among point clouds change dramatically. Then, we formulate the unordered multiview point cloud registration problem as a maximum a-posteriori (MAP) problem and develop a framework consisting of two levels of graphs to address it. The first-level graph, constructed as a weighted graph, is designed to efficiently and optimally infer initial values of scan poses from the unordered set. The second-level graph is constructed as a factor graph. By globally optimizing the variables on the graph, including scan poses, marker poses, and marker corner positions, we tackle the MAP problem. We conduct qualitative and quantitative experiments to demonstrate that the proposed method exhibits superiority over competitors in four aspects: registration accuracy, instance reconstruction quality, localization accuracy, and robustness to the degraded scene. To benefit the community, we open-source our method and dataset at https://github.com/yorklyb/LiDAR-SFM.
Related papers
- Deep Manifold Graph Auto-Encoder for Attributed Graph Embedding [51.75091298017941]
This paper proposes a novel Deep Manifold (Variational) Graph Auto-Encoder (DMVGAE/DMGAE) for attributed graph data.
The proposed method surpasses state-of-the-art baseline algorithms by a significant margin on different downstream tasks across popular datasets.
arXiv Detail & Related papers (2024-01-12T17:57:07Z) - Pyramid Semantic Graph-based Global Point Cloud Registration with Low
Overlap [27.362946585463824]
Global point cloud registration is essential in many robotics tasks like loop closing and relocalization.
Unfortunately, the registration often suffers from the low overlap between point clouds.
In this paper, we propose a robust framework to address the problem of point registration with low overlap.
arXiv Detail & Related papers (2023-07-22T16:05:23Z) - Robust Multiview Point Cloud Registration with Reliable Pose Graph
Initialization and History Reweighting [63.95845583460312]
We present a new method for the multiview registration of point cloud.
Our method achieves 11% higher registration recall on the 3DMatch dataset and 13% lower registration errors on the ScanNet dataset.
arXiv Detail & Related papers (2023-04-02T06:43:40Z) - Large-scale Point Cloud Registration Based on Graph Matching
Optimization [30.92028761652611]
We propose a underlineGraph underlineMatching underlineOptimization based underlineNetwork.
The proposed method has been evaluated on the 3DMatch/3DLoMatch benchmarks and the KITTI benchmark.
arXiv Detail & Related papers (2023-02-12T03:29:35Z) - Robust Point Cloud Registration Framework Based on Deep Graph
Matching(TPAMI Version) [13.286247750893681]
3D point cloud registration is a fundamental problem in computer vision and robotics.
We propose a novel deep graph matching-based framework for point cloud registration.
arXiv Detail & Related papers (2022-11-09T06:05:25Z) - MAPLE: Masked Pseudo-Labeling autoEncoder for Semi-supervised Point
Cloud Action Recognition [160.49403075559158]
We propose a Masked Pseudo-Labeling autoEncoder (textbfMAPLE) framework for point cloud action recognition.
In particular, we design a novel and efficient textbfDecoupled textbfspatial-textbftemporal TranstextbfFormer (textbfDestFormer) as the backbone of MAPLE.
MAPLE achieves superior results on three public benchmarks and outperforms the state-of-the-art method by 8.08% accuracy on the MSR-Action3
arXiv Detail & Related papers (2022-09-01T12:32:40Z) - DeepI2P: Image-to-Point Cloud Registration via Deep Classification [71.3121124994105]
DeepI2P is a novel approach for cross-modality registration between an image and a point cloud.
Our method estimates the relative rigid transformation between the coordinate frames of the camera and Lidar.
We circumvent the difficulty by converting the registration problem into a classification and inverse camera projection optimization problem.
arXiv Detail & Related papers (2021-04-08T04:27:32Z) - Robust Point Cloud Registration Framework Based on Deep Graph Matching [5.865029600972316]
3D point cloud registration is a fundamental problem in computer vision and robotics.
We propose a novel deep graph matchingbased framework for point cloud registration.
arXiv Detail & Related papers (2021-03-07T04:20:29Z) - Heuristic Semi-Supervised Learning for Graph Generation Inspired by
Electoral College [80.67842220664231]
We propose a novel pre-processing technique, namely ELectoral COllege (ELCO), which automatically expands new nodes and edges to refine the label similarity within a dense subgraph.
In all setups tested, our method boosts the average score of base models by a large margin of 4.7 points, as well as consistently outperforms the state-of-the-art.
arXiv Detail & Related papers (2020-06-10T14:48:48Z) - Learning multiview 3D point cloud registration [74.39499501822682]
We present a novel, end-to-end learnable, multiview 3D point cloud registration algorithm.
Our approach outperforms the state-of-the-art by a significant margin, while being end-to-end trainable and computationally less costly.
arXiv Detail & Related papers (2020-01-15T03:42:14Z)
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.