În afara temei aiqbench
Această știre a fost preluată de la o sursă pe care o urmărim, dar nu ține de domeniul AI sau cuantic, așa că nu există o perspectivă aiqbench pentru ea.
Calibrated Keyframe-Segment Selection for Descriptor-Agnostic LiDAR Loop Closure in Repetitive Environments
arXiv:2512.09447v3 Announce Type: replace 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.
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: this https URL.
Robotics (cs.RO); Computer Vision and Pattern Recognition (cs.CV)
arXiv:2512.09447 [cs.RO]
(or arXiv:2512.09447v3 [cs.RO] for this version)
https://doi.org/10.48550/arXiv.2512.09447 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 275 cuvinte
Subiecte conexe
RTISSLAM: In-air Imaging Sonar SLAM using a Robust Pose Graph and Occupancy Grid Mapping
arXiv · 14 oct. 2026

Automating coherent long-form video generation
Google Research · 24 sept. 2026

Gemini 4 Argon for Robotics
Google DeepMind · 13 oct. 2026
Agentic Search. More accurate and efficient results from your AI systems.
Mistral AI · 20 aug. 2026