cs.RODec 10, 2025

Calibrated Keyframe-Segment Selection for Descriptor-Agnostic LiDAR Loop Closure in Repetitive Environments

Authors: Jaehyun Kim, Seungwon Choi, Wonseok Kang, Tae-Wan Kim

Abstract

False LiDAR loop closures can distort pose graphs in repetitive environments, where one query may match several distant places. Genuine revisits, unlike many perceptual aliases, tend to remain consistent across neighboring keyframes. We present Query-Calibrated Segmental Admission (QCSA), a loop-candidate selection method between descriptor retrieval and point-cloud registration. QCSA maps descriptor scores to evidence that distinguishes true loops from hard negatives, accumulates it over short keyframe segments, and admits only the best segment above a threshold fitted to the strongest false segment for each calibration query. The admitted segment forms two local submaps for one Generalized Iterative Closest Point (GICP) registration. QCSA requires pairwise descriptor scores and separate calibration for each descriptor and setting. Across seven descriptors on the SNU Library Dataset (SNULib), QCSA lowers average trajectory error with 53.8% fewer registration attempts than Top-1. With common local submaps and downstream processing on NCLT, it also reduces registration attempts, constraints exceeding the pose-error tolerance, and trajectory error relative to Top-1. HeLiPR Bridge further evaluates repeated outdoor geometry. Our implementation and dataset will be released at: https://github.com/wanderingcar/snu_library_dataset.

Figures & tables

Explore similar work

Mar 5, 2026

Loop Closure via Maximal Cliques in 3D LiDAR-Based SLAM

Reliable loop closure detection remains a critical challenge in 3D LiDAR-based SLAM, especially under sensor noise, environmental ambiguity, and viewpoint variation conditions. RANSAC is often used in the context of loop closures for geometric model fitting in the presence of outliers. However, this approach may fail, leading to map inconsistency. We introduce a novel deterministic algorithm, CliReg, for loop closure validation that replaces RANSAC verification with a maximal clique search over a compatibility graph of feature correspondences. This formulation avoids random sampling and increases robustness in the presence of noise and outliers. We integrated our approach into a real- time pipeline employing binary 3D descriptors and a Hamming distance embedding binary search tree-based matching. We evaluated it on multiple real-world datasets featuring diverse LiDAR sensors. The results demonstrate that our proposed technique consistently achieves a lower pose error and more reliable loop closures than RANSAC, especially in sparse or ambiguous conditions. Additional experiments on 2D projection-based maps confirm its generality across spatial domains, making our approach a robust and efficient alternative for loop closure detection.
Jun 26, 2026

PinNet: Keypoint-Aware Learned Local Descriptors with Geometric Embedding for Loop Closure in LiDAR SLAM

Loop closure is essential to reduce drift and build globally consistent maps in large-scale environments. However, reliable loop closure with only geometric information from, e.g., a LiDAR sensor, remains challenging due to the difficulty of constructing discriminative geometric features. We present PinNet, a neural network that produces local geometric descriptors from point clouds for place recognition and scanto-scan registration. PinNet incorporates a neural network that generates keypoints and their corresponding descriptors, together with a plane-based geometric self-attention module that models inter-keypoint spatial relationships to enhance descriptor discriminability for loop-closure detection and point-cloud registration. The approach is comprehensively evaluated on multiple datasets collected with different LiDAR sensors. Experimental results demonstrate strong place-recognition performance, precise relative pose estimation, and successful single-shot localization in different environments.
Aug 20, 2026

CVSD-Reg: Cross-Modal Visual Semantic Prior Distillation for Robust LiDAR Registration

Learning-based global point cloud registration has achieved remarkable progress, yet its reliance on geometric representations makes existing methods sensitive to variations in point density, scan pattern, viewpoint, and sensor characteristics. We propose CVSD-Reg, a robust global LiDAR registration framework that distills visual semantic priors from a vision foundation model into LiDAR representations. In Stage 1, a Point Transformer V3 student learns from a frozen DINOv2 teacher through contrastive distillation and spherical-manifold alignment, which preserves the hyperspherical geometry of the teacher embedding space. Self-supervised InfoNCE consistency and soft SE(3)\mathrm{SE}(3) invariance further encourage viewpoint-robust descriptors. In Stage 2, the distilled representation is adapted to registration through correspondence learning, density-aware point-dropout augmentation, and end-to-end pose optimization. With a single checkpoint, CVSD-Reg generalizes to both single-sensor and zero-shot cross-sensor scenarios without sensor-specific adaptation and remains entirely camera-free at inference. On KITTI, nuScenes, and HeLiPR, CVSD-Reg achieves strict success rate ([email protected],m/1∘1^\circ) of 97.7%\%, 99.0%\%, and 99.3%\%, respectively, including 97.3%\% on sparse 16-beam Velodyne scans. It outperforms state-of-the-art geometric registration methods by up to 44.0 percentage points without requiring camera inputs or post-hoc ICP refinement.