L-PR: Exploiting LiDAR Fiducial Marker for Unordered Low-Overlap Multiview Point Cloud Registration
Bibliographic record
Abstract
The point cloud registration is a prerequisite for many applications in computer vision and robotics. Most existing methods focus on the registration of point clouds with high overlap. While some learning-based methods address low-overlap cases, they struggle in out-of-distribution scenarios with extremely low-overlap ratios. This article introduces a novel framework dubbed L-PR, designed to register unordered low-overlap multiview point clouds leveraging light detection and ranging (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 3-D 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 perform both qualitative and quantitative experiments to demonstrate that the proposed method outperforms previous state-of-the-art (SOTA) methods in addressing challenging low-overlap cases. Specifically, the proposed method can serve as a convenient, efficient, and low-cost tool for applications such as 3-D asset collection from sparse scans, training data collection in unseen scenes, reconstruction of degraded scenes, and merging large-scale low-overlap 3-D maps, which existing methods struggle with. We also collect a new dataset named Livox-3DMatch using L-PR and incorporate it into the training of the SOTA learning-based methods, which brings evident improvements for them across various benchmarks. We release the open-source code implementation and datasets at:https://github.com/yorklyb/L-PR.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.002 |
| Bibliometrics | 0.002 | 0.003 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.003 |
| Open science | 0.003 | 0.003 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".