TL;DR
The paper introduces QCSA, a descriptor-agnostic loop admission policy that reduces false loop insertions in LiDAR SLAM, improving graph stability and trajectory accuracy in repetitive environments.
Contribution
It presents a novel query-calibrated segmental admission method that effectively filters aliasing loop candidates, enhancing SLAM robustness without route-specific tuning.
Findings
QCSA reduces inserted loop factors by 3.8 times.
It increases factor precision from 0.542 to 0.717.
It maintains comparable mean ATE while reducing worst-sequence ATE from 1.064 to 0.778 m.
Abstract
Structurally repetitive environments produce visually plausible but aliased LiDAR loop candidates that can destabilize pose-graph optimization when admitted as loop factors. We propose Query-Calibrated Segmental Admission (QCSA), a descriptor-agnostic sparse loop-admission policy for graph-stability-oriented insertion. The policy scores short descriptor segments against hard negatives, calibrates which query-level segment hypotheses reach geometry, and inserts representative pairs validated by Generalized Iterative Closest Point (G-ICP). We evaluate it on the SNU Library Dataset (SNULib) and HeLiPR overlap routes. Aggregated over seven LiDAR descriptor families on SNULib, QCSA reduces inserted loop factors by 3.8 times, raises factor precision from 0.542 to 0.717, and sharply lowers false admissions per query group. With this sparser graph, it maintains comparable mean absolute…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRobotics and Sensor-Based Localization · Human Pose and Action Recognition · Advanced Image and Video Retrieval Techniques
