ROVER: Robust Loop Closure Verification with Trajectory Prior in Repetitive Environments

Anjun Hu; Hong Zhang; Jiankun Wang; Jiayi Yang; Jingwen Yu; Ping Tan

REVIEW 3 major objections 4 minor 36 references

ROVER: Robust Loop Closure Verification with Trajectory Prior in Repetitive Environments

T0 review · 3 major / 4 minor · reviewed 2026-08-15 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read ROVER verifies loop closures by checking whether adding the loop bends the robot's path gracefully, rather than by appearance.

desk verdict A genuinely useful, appearance-free loop verification idea built on trajectory change, but the headline evaluation table contradicts its own dataset description and needs a careful re-check before any state-of-the-art claim is credible. read the letter →

arxiv 2508.13488 v1 pith:HDXHHOK5 submitted 2025-08-19 cs.RO cs.CV

Jingwen Yu , Jiayi Yang , Anjun Hu , Jiankun Wang , Ping Tan , Hong Zhang This is my paper · ORCID

classification cs.ROcs.CV

keywords loopclosureverificationtrajectorypriorposegraphoptimizationrepetitiveenvironmentsSLAMfalsepositiverejectionsensor-agnostic

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper introduces ROVER, a verification stage for loop closure detection that ignores appearance entirely and instead uses the robot's own past trajectory as a prior. For each candidate loop, ROVER runs pose-graph optimization with and without the loop constraint, aligns the two resulting trajectories, and scores their difference. A small, local, continuous change supports a true loop; a large chaotic change marks a false one. Across four repetitive-environment datasets the method reaches an average precision of 99.25 and a maximum recall at 100 percent precision of 87.39, and integrating it into visual SLAM systems cuts absolute trajectory error substantially. If this holds, appearance-agnostic verification could make SLAM reliable in corridors, warehouses, and multi-floor buildings where visual similarity misleads feature matchers.

What carries the argument

The trajectory prior constraint (TPC) is the mechanism: for a candidate loop, solve pose-graph optimization with that loop inserted, align the optimized trajectory's translation-only component to the front-end's original trajectory via least-squares similarity alignment, and compute the mean pointwise Euclidean distance between the aligned paths. That scalar is the loop-confidence score and is thresholded to accept or reject. Because each candidate is optimized and scored one at a time, the method fits online SLAM, where batch outlier-rejection techniques cannot be applied.

What would settle it

One test is to run ROVER on a symmetric grid environment and inject a false loop candidate whose relative pose is consistent with a rigid transform of the drifted odometry; if that candidate's TPC score falls below the acceptance threshold, ROVER has accepted a false loop, and the central assumption fails in that regime.

Watch

Extended reading notes

Core claim

The central claim is that a loop closure can be verified by the shape of the pose-graph update it induces, without referencing image content. Adding a true loop to the pose graph corrects drift and produces a smooth, continuous change in the estimated trajectory; adding a false loop bends the graph into a chaotic shape. ROVER operationalizes this as the trajectory prior constraint (TPC): optimize the pose graph with the loop constraint, align the resulting trajectory to the original front-end trajectory using a least-squares similarity transform, and take the mean Euclidean distance between the two translation-only paths as the confidence score. The paper reports that this outperforms geometric verification and visual place-recognition baselines on the Hotel, Warehouse, Escalator, and Cross-floor datasets, and that inserting the verifier into complete SLAM systems reduces the RMSE of absolute trajectory error, for example on the Hotel dataset from 2.17 meters to 0.11 meters.

Load-bearing premise

The method assumes that true loop closures always reshape the optimized trajectory in a small, continuous way while false ones always distort it chaotically, which stops being reliable when the odometry already carries large drift.

Editorial extensions

If this is right

A false loop that looks identical to a true one to appearance-based matchers is still rejected when its insertion would bend the trajectory chaotically.
The verifier depends only on poses and constraints, so the same implementation can be dropped into visual, LiDAR, radar, or inertial SLAM front-ends.
In a dataset with no true revisits, the method prevents false loops from corrupting the map and matches the accuracy of pure odometry instead of diverging.
Integrating the verifier suppresses the large spikes in localization error that false loops cause, improving real-time navigation safety in repetitive environments.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

The TPC score could be used as a continuous weight in the pose-graph optimization instead of a binary gate, letting the back-end partially trust borderline loops.
The paper's limitation discussion points to an evident next step: an online odometry-uncertainty estimator that relaxes the acceptance threshold when drift is large, which would extend the method to noisier front-ends.
A symmetric environment with many geometrically consistent wrong matches is the natural stress test; measuring ROVER's score distributions there would reveal how far the graceful-versus-chaotic assumption holds.

Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

Here's my take. The core idea — verify a loop candidate by measuring how much the robot trajectory changes when you inject that candidate into pose-graph optimization — is a good one. It is appearance-free, sensor-agnostic, and the sequential formulation matches real SLAM pipelines. The scoring scheme (Sim(3) alignment, mean Euclidean distance) is simple and the paper is honest that each component is established. The integration with ORB-SLAM2 and VINS-Fusion is a plus, and the reported ATE improvements are plausible. Promising source code and a self-collected dataset also counts for something.

What worries me is the evaluation table. Section IV-A says the Warehouse dataset "does not contain revisits (i.e., true positive loops)" and the same is repeated in Section IV-C. Under the paper's own metric definitions, AP and MR are undefined or vacuous with zero true positives. Yet Table I reports ROVER on Warehouse with AP=100.00 and MR=100.00, and baselines with MR values like 76.92. That is internally inconsistent. Either the annotation is wrong, the metrics were computed with a different ground truth, or there is a bug. Since Warehouse is a quarter of the reported average, the headline "highest AP and MR on all datasets" rests on this. The reader's report also notes that on Escalator, LoFTR actually beats ROVER on both AP and MR (98.57 vs 97.77, 62.31 vs 61.54), which directly contradicts the claim in Section IV-B. These two overclaims are not minor blemishes; they are load-bearing evaluation errors.

Second, the method's score (Eq. 6) is a distance, but Section III-B says loops are verified by thresholding "the probability p(sij)" in [0,1]. The mapping from distance to probability and the threshold tau are never specified. That makes the method not fully reproducible as described. Minor but real.

Third, the central assumption — true loops cause graceful trajectory changes, false loops cause chaos — is acknowledged in Section IV-D to break under significant odometry drift. That is an honest statement of a real limitation, not a fatal one.

Overall, the conceptual contribution is clear, not circular, and worth serious referee time. But the evaluation inconsistencies are exactly the kind of thing a careful reviewer would catch, and the paper should not get a pass until the Warehouse numbers are explained and the Escalator claim is corrected. I would still send it out — the idea deserves scrutiny — but with a strict request for clarification and a re-run of the metrics.

Referee Report

3 major / 4 minor

Summary. ROVER proposes a loop closure verification stage for SLAM that scores each loop candidate by comparing the trajectory obtained from pose-graph optimization with the candidate against the odometry-only trajectory (the "trajectory prior"), using Umeyama alignment and an average translation distance. The method is validated on the Hotel, Warehouse, Escalator, and a self-collected Cross-floor dataset, with AP/MR comparisons against retrieval and geometric verification baselines, and ATE comparisons when integrated into ORB-SLAM2 and VINS-Fusion.

Significance. The trajectory-prior idea is a genuinely different axis from appearance-based loop verification and is plausibly sensor-agnostic. The paper ships open-source code and a self-collected dataset, evaluates on four datasets with two SLAM back-ends, and reports practically meaningful ATE improvements (e.g., Hotel from 2.17 m to 0.11 m). Section IV-D is candid about the drift sensitivity of the approach. However, the headline evaluation contains an internal inconsistency on the Warehouse dataset and an overclaim about per-dataset AP/MR, so the quantitative claims need repair before the results can be fully trusted.

major comments (3)

[Section IV-A/IV-C and Table I] Section IV-A states that the Warehouse dataset "does not contain revisits (i.e., true positive loops)" and Section IV-C repeats "due to the absence of revisits," yet Table I reports AP=100.00 and MR=100.00 for ROVER and nonzero MR values (e.g., 76.92) for DBoW2, ORB-NN, and others. Under the MR definition in Section IV-A, recall-based metrics are undefined when there are zero true positives, and a nonzero MR is impossible. Because Warehouse contributes one quarter of the claimed average AP and MR, this inconsistency directly undermines the headline "highest AP and MR" claim. Please clarify the Warehouse ground-truth annotation and either recompute or exclude the dataset from AP/MR averaging, or correct the text.
[Table I and Section IV-B] The statement "ROVER achieves robust performance across all datasets with the highest AP and MR" is contradicted by Table I on the Escalator dataset: LoFTR and eLoFTR report AP 98.57 and 98.74 versus ROVER's 97.77, and SIFT-LG and LoFTR report MR 63.85 and 62.31 versus ROVER's 61.54. Please revise the claim to state which aggregate statistic supports "highest" or provide a statistical comparison supporting "competitive" rather than "highest."
[Section III-C and Section IV-D] The central assumption of the trajectory prior constraint, that a true loop induces a "graceful" trajectory change while a false loop induces a "chaotic" one, is not quantitatively characterized. The paper acknowledges drift sensitivity but offers no analysis or experiment isolating when the separation holds. Please add a sensitivity study (e.g., AP/MR versus odometry noise level and drift magnitude) and make the proof-of-concept setup in Fig. 5 fully reproducible by reporting the noise parameters, number of trials, and trajectory generation details.

minor comments (4)

[Section III-A] Several equations appear with missing glyphs in the manuscript text; please ensure all mathematical symbols render correctly in the final PDF.
[Section IV-A/IV-B] Please report the number of loop candidates and the annotation protocol for each dataset; this information is necessary to interpret MR and to reproduce Table I.
[Figure 5] The caption does not state which noise levels correspond to which precision-recall curves; please label the curves directly or specify the mapping in the caption.
[Table II and Section IV-C] Consider reporting the number of accepted loops for each SLAM integration, since ROVER's deliberately conservative threshold (Section IV-D) affects the resulting ATE and the interpretation of the improvement.

Circularity Check

0 steps flagged · score 0.0 of 10

No circular derivation: ROVER's score is computed directly from the trajectory change induced by a loop candidate, not from fitted labels or from self-cited results; the Warehouse AP/MR inconsistency is a non-circular evaluation issue.

full rationale

ROVER's verification score is computed from quantities that are not derived from the target output: the trajectory before PGO comes from the front-end odometry, and the trajectory after PGO is obtained by inserting the candidate loop constraint. The score in Eq. (6) is the Euclidean distance between the aligned trajectories, and no parameter is fitted to ground-truth loop labels or to the final accepted/rejected decision. The 'graceful versus chaotic' trajectory-change premise is an empirical heuristic, not a definition that encodes the ground-truth label. The only self-citations in the paper (GV-Bench [7] for MR/AP definitions and FusionPortable [21] for the Escalator dataset) are not load-bearing: AP and MR are standard metrics, and the dataset is public and externally usable. Baselines are external methods, and the comparison does not rely on an unverified uniqueness theorem or on a prior paper by the same authors to force the method's form. Therefore the central derivation is self-contained and not circular. Separately, the paper contains an internal evaluation inconsistency that is a correctness concern but not a circularity concern: Section IV-A states that the Warehouse dataset 'does not contain revisits (i.e., true positive loops),' yet Table I reports ROVER with AP=100.00 and MR=100.00 on Warehouse and reports nonzero MR values for several baselines. Under the paper's own MR definition as the maximum recall at 100% precision, nonzero MR requires ground-truth true-positive loops, so a dataset with zero true positives cannot yield these numbers. This inconsistency should be resolved, but it does not make the derivation circular because the metrics are not used as inputs to the proposed scoring scheme.

Assumptions & free parameters 1 free parameters · 3 assumptions · 0 invented entities

The central claim rests on a heuristic relationship between loop correctness and trajectory change magnitude, plus the assumption that odometry drift is modest. The acceptance threshold and the score-to-probability mapping are unspecified free parameters that influence the SLAM integration results.

free parameters (1)

Acceptance threshold tau and scoring function p(sij) = not reported
Algorithm 1 accepts a loop if p(sij) >= tau, but the function p and the threshold tau are not defined or justified in the paper. Section IV-D describes the threshold as strict and conservative, suggesting it may be hand-tuned for the SLAM experiments, which affects the reported ATE improvements.

assumptions (3)

domain assumption A valid loop closure produces a graceful (small) change in the robot trajectory after PGO, while a false loop produces a chaotic (large) change.
This is the core intuition of TPC, stated in Section I and III-C and illustrated in Fig. 4. It is not proven and fails in cases of large odometry drift, which the authors acknowledge in Section IV-D.
domain assumption The front-end odometry trajectory (trajectory prior) is sufficiently accurate for the change to be meaningful.
The method relies on the prior trajectory as a reference; Section IV-D explicitly lists significant drift as a limitation.
domain assumption Alignment using only translational components via Umeyama Sim(3) is sufficient to compare trajectories before and after PGO.
The paper cites reference [18] for sufficiency, but the impact of rotational differences on the score is not analyzed in the text.

how reviews work

0 comments

Cite this review

Pith. "Pith review of ROVER: Robust Loop Closure Verification with Trajectory Prior in Repetitive Environments." pith.science (2026). https://pith.science/paper/HDXHHOK5

@misc{pith2026250813488,
  author       = {Pith},
  title        = {Pith review of: ROVER: Robust Loop Closure Verification with Trajectory Prior in Repetitive Environments},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/HDXHHOK5}},
  note         = {Machine review of arXiv:2508.13488}
}

read the original abstract

Loop closure detection is important for simultaneous localization and mapping (SLAM), which associates current observations with historical keyframes, achieving drift correction and global relocalization. However, a falsely detected loop can be fatal, and this is especially difficult in repetitive environments where appearance-based features fail due to the high similarity. Therefore, verification of a loop closure is a critical step in avoiding false positive detections. Existing works in loop closure verification predominantly focus on learning invariant appearance features, neglecting the prior knowledge of the robot's spatial-temporal motion cue, i.e., trajectory. In this letter, we propose ROVER, a loop closure verification method that leverages the historical trajectory as a prior constraint to reject false loops in challenging repetitive environments. For each loop candidate, it is first used to estimate the robot trajectory with pose-graph optimization. This trajectory is then submitted to a scoring scheme that assesses its compliance with the trajectory without the loop, which we refer to as the trajectory prior, to determine if the loop candidate should be accepted. Benchmark comparisons and real-world experiments demonstrate the effectiveness of the proposed method. Furthermore, we integrate ROVER into state-of-the-art SLAM systems to verify its robustness and efficiency. Our source code and self-collected dataset are available at https://github.com/jarvisyjw/ROVER.

Review history (2 revisions) →

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

36 extracted references · 34 canonical work pages

[1]

Robust loop closure by textual cues in challenging environments,

T. Jin, X. Xu, Y . Yang, S. Yuan, T.-M. Nguyen, J. Li, and L. Xie, “Robust loop closure by textual cues in challenging environments,” IEEE Robot. Autom. Lett. , 2024

work page 2024
[2]

Resolving loop closure confusion in repetitive environments for visual slam through ai foundation models assistance,

H. Li, S. Yu, S. Zhang, and G. Tan, “Resolving loop closure confusion in repetitive environments for visual slam through ai foundation models assistance,” in Proc. IEEE Int. Conf. Robot. Autom. IEEE, 2024, pp. 6657–6663

work page 2024
[3]

Past, present, and future of simultaneous localization and mapping: Toward the robust-perception age,

C. Cadena, L. Carlone, H. Carrillo, Y . Latif, D. Scaramuzza, J. Neira, I. Reid, and J. J. Leonard, “Past, present, and future of simultaneous localization and mapping: Toward the robust-perception age,” IEEE Trans. Robot., vol. 32, no. 6, pp. 1309–1332, 2016

2016
[4]

ORB-SLAM2: an open-source SLAM system for monocular, stereo and RGB-D cameras,

R. Mur-Artal and J. D. Tard ´os, “ORB-SLAM2: an open-source SLAM system for monocular, stereo and RGB-D cameras,” IEEE Trans. Robot., vol. 33, no. 5, pp. 1255–1262, 2017

work page 2017
[5]

Orb-slam3: An accurate open-source library for visual, visual–inertial, and multimap slam,

C. Campos, R. Elvira, J. J. G. Rodr ´ıguez, J. M. Montiel, and J. D. Tard ´os, “Orb-slam3: An accurate open-source library for visual, visual–inertial, and multimap slam,”IEEE Trans. Robot., vol. 37, no. 6, pp. 1874–1890, 2021

work page 2021
[6]

Submap-based pose-graph visual slam: A robust visual exploration and localization system,

W. Chen, L. Zhu, Y . Guan, C. R. Kube, and H. Zhang, “Submap-based pose-graph visual slam: A robust visual exploration and localization system,” in Proc. IEEE/RJS Int. Conf. Intell. Robots Syst. IEEE, 2018, pp. 6851–6856

work page 2018
[7]

Gv-bench: Benchmarking local feature matching for geometric verification of long-term loop closure detection,

J. Yu, H. Ye, J. Jiao, P. Tan, and H. Zhang, “Gv-bench: Benchmarking local feature matching for geometric verification of long-term loop closure detection,” in Proc. IEEE/RJS Int. Conf. Intell. Robots Syst. IEEE, 2024, pp. 7922–7928

work page 2024
[8]

Switchable constraints for robust pose graph slam,

N. S ¨underhauf and P. Protzel, “Switchable constraints for robust pose graph slam,” in Proc. IEEE/RJS Int. Conf. Intell. Robots Syst. IEEE, 2012, pp. 1879–1884

work page 2012

Show all 36 references

[9]

Robust loop closing over time,

Y . Latif, C. Cadena, and J. Neira, “Robust loop closing over time,” in Robot.: Sci. Syst. , 2013, pp. 233–240

2013
[10]

Monocular visual odometry using learned repeatability and description,

H. Huang, H. Ye, Y . Sun, and M. Liu, “Monocular visual odometry using learned repeatability and description,” in Proc. IEEE Int. Conf. Robot. Autom. IEEE, 2020, pp. 8913–8919

2020
[11]

Bifocal- binocular visual slam system for repetitive large-scale environments,

S. Xu, Y . Dong, H. Wang, S. Wang, Y . Zhang, and B. He, “Bifocal- binocular visual slam system for repetitive large-scale environments,” IEEE Trans. Instrum. Meas. , vol. 71, pp. 1–15, 2022

2022
[12]

Global localization in repetitive and ambiguous environments,

Z. Wu, W. Wang, J. Zhang, Q. Lyu, H. Zhang, and D. Wang, “Global localization in repetitive and ambiguous environments,” in Proc. IEEE Int. Conf. Robot. Autom. IEEE, 2023, pp. 12 374–12 380

2023
[13]

Conquering tex- tureless with rf-referenced monocular vision for mav state estimation,

S. Zhang, S. Tang, W. Wang, T. Jiang, and Q. Zhang, “Conquering tex- tureless with rf-referenced monocular vision for mav state estimation,” in Proc. IEEE Int. Conf. Robot. Autom. IEEE, 2021, pp. 146–152

2021
[14]

Topological mapping for manhattan- like repetitive environments,

S. S. Puligilla, S. Tourani, T. Vaidya, U. S. Parihar, R. K. Sarvadev- abhatla, and K. M. Krishna, “Topological mapping for manhattan- like repetitive environments,” in Proc. IEEE Int. Conf. Robot. Autom. IEEE, 2020, pp. 6268–6274

2020
[15]

Super- glue: Learning feature matching with graph neural networks,

P.-E. Sarlin, D. DeTone, T. Malisiewicz, and A. Rabinovich, “Super- glue: Learning feature matching with graph neural networks,” in Proc. IEEE Conf. Comput. Vis. Pattern Recognit. , 2020, pp. 4938–4947

2020
[16]

Loftr: Detector- free local feature matching with transformers,

J. Sun, Z. Shen, Y . Wang, H. Bao, and X. Zhou, “Loftr: Detector- free local feature matching with transformers,” in Proc. IEEE Conf. Comput. Vis. Pattern Recognit. , 2021, pp. 8922–8931

2021
[17]

Grounding image matching in 3d with mast3r,

V . Leroy, Y . Cabon, and J. Revaud, “Grounding image matching in 3d with mast3r,” in Proc. Eur. Conf. Comput. Vis. Springer, 2024, pp. 71–91

2024
[18]

Trajectory alignment and evaluation in slam: Horns method vs alignment on the manifold,

M. Salas, Y . Latif, I. D. Reid, and J. Montiel, “Trajectory alignment and evaluation in slam: Horns method vs alignment on the manifold,” in Robot.: Sci. and Sys. Workshop: The problem of mobile sensors . sn, 2015, pp. 1–3

2015
[19]

Least-squares estimation of transformation parameters between two point patterns,

S. Umeyama, “Least-squares estimation of transformation parameters between two point patterns,” IEEE Trans. Pattern Anal. Mach. Intell. , vol. 13, no. 04, pp. 376–380, 1991

1991
[20]

A benchmark dataset for collaborative slam in service environments,

H. Park, I. Lee, M. Kim, H. Park, and K. Joo, “A benchmark dataset for collaborative slam in service environments,” IEEE Robot. Autom. Lett., 2024

2024
[21]

Fusionportable: A multi-sensor campus- scene dataset for evaluation of localization and mapping accuracy on diverse platforms,

J. Jiao, H. Wei, T. Hu, X. Hu, Y . Zhu, Z. He, J. Wu, J. Yu, X. Xie, H. Huang et al. , “Fusionportable: A multi-sensor campus- scene dataset for evaluation of localization and mapping accuracy on diverse platforms,” in Proc. IEEE/RJS Int. Conf. Intell. Robots Syst. IEEE, 2022,...

2022
[22]

Fast and incremental method for loop-closure detection using bags of visual words,

A. Angeli, D. Filliat, S. Doncieux, and J.-A. Meyer, “Fast and incremental method for loop-closure detection using bags of visual words,” IEEE Trans. Robot. , vol. 24, no. 5, pp. 1027–1037, 2008

2008
[23]

Netvlad: Cnn architecture for weakly supervised place recognition,

R. Arandjelovic, P. Gronat, A. Torii, T. Pajdla, and J. Sivic, “Netvlad: Cnn architecture for weakly supervised place recognition,” in Proc. IEEE Conf. Comput. Vis. Pattern Recognit. , 2016, pp. 5297–5307

2016
[24]

Mixvpr: Feature mixing for visual place recognition,

A. Ali-Bey, B. Chaib-Draa, and P. Giguere, “Mixvpr: Feature mixing for visual place recognition,” in Winter Conf. App. Comput. Vis., 2023, pp. 2998–3007

2023
[25]

Anyloc: Towards universal visual place recognition,

N. Keetha, A. Mishra, J. Karhade, K. M. Jatavallabhula, S. Scherer, M. Krishna, and S. Garg, “Anyloc: Towards universal visual place recognition,” IEEE Robot. Autom. Lett. , 2023

2023
[26]

Optimal transport aggregation for visual place recognition,

S. Izquierdo and J. Civera, “Optimal transport aggregation for visual place recognition,” in Proc. IEEE Conf. Comput. Vis. Pattern Recog- nit., 2024, pp. 17 658–17 668

2024
[27]

Textinplace: Indoor visual place recognition in repetitive structures with scene text spotting and verification,

H. Tao, B. Liu, C. Chen, T. Huang, H. Li, J. Cui, and H. Zhang, “Textinplace: Indoor visual place recognition in repetitive structures with scene text spotting and verification,” in Proc. IEEE/RJS Int. Conf. Intell. Robots Syst. IEEE, 2025

2025
[28]

Object recognition from local scale-invariant features,

D. G. Lowe, “Object recognition from local scale-invariant features,” in Proc. IEEE Int. Conf. Comput. Vis. , vol. 2, 1999, pp. 1150–1157

1999
[29]

LightGlue: Local Feature Matching at Light Speed,

P. Lindenberger, P.-E. Sarlin, and M. Pollefeys, “LightGlue: Local Feature Matching at Light Speed,” in Proc. IEEE Int. Conf. Comput. Vis., 2023

2023
[30]

Efficient LoFTR: Semi-dense local feature matching with sparse-like speed,

Y . Wang, X. He, S. Peng, D. Tan, and X. Zhou, “Efficient LoFTR: Semi-dense local feature matching with sparse-like speed,” in Proc. IEEE Conf. Comput. Vis. Pattern Recognit. , 2024

2024
[31]

Disk: Learning local features with policy gradient,

M. Tyszkiewicz, P. Fua, and E. Trulls, “Disk: Learning local features with policy gradient,” Adv. Neural Inf. Process. Syst. , vol. 33, 2020

2020
[32]

Aliked: A lighter keypoint and descriptor extraction network via deformable transformation,

X. Zhao, X. Wu, W. Chen, P. C. Y . Chen, Q. Xu, and Z. Li, “Aliked: A lighter keypoint and descriptor extraction network via deformable transformation,” IEEE Trans. Instrum. Meas., vol. 72, pp. 1–16, 2023. [Online]. Available: https://arxiv.org/pdf/2304.03608.pdf

2023 arXiv
[33]

Dust3r: Geometric 3d vision made easy,

S. Wang, V . Leroy, Y . Cabon, B. Chidlovskii, and J. Revaud, “Dust3r: Geometric 3d vision made easy,” in Proc. IEEE Conf. Comput. Vis. Pattern Recognit., 2024

2024
[34]

Fast-lio2: Fast direct lidar-inertial odometry,

W. Xu, Y . Cai, D. He, J. Lin, and F. Zhang, “Fast-lio2: Fast direct lidar-inertial odometry,” IEEE Trans. Robot., vol. 38, no. 4, pp. 2053– 2073, 2022

2022
[35]

Vins-mono: A robust and versatile monocular visual-inertial state estimator,

T. Qin, P. Li, and S. Shen, “Vins-mono: A robust and versatile monocular visual-inertial state estimator,” IEEE Trans. Robot., vol. 34, no. 4, pp. 1004–1020, 2018

2018
[36]

A general optimization-based framework for global pose estimation with multiple sensors,

T. Qin, S. Cao, J. Pan, and S. Shen, “A general optimization-based framework for global pose estimation with multiple sensors,” arXiv preprint arXiv:1901.03642, 2019

1901 arXiv

Pith tools

Reviewed August 15, 2026 · model on record in the stance chip above.

[1] [1]

Robust loop closure by textual cues in challenging environments,

T. Jin, X. Xu, Y . Yang, S. Yuan, T.-M. Nguyen, J. Li, and L. Xie, “Robust loop closure by textual cues in challenging environments,” IEEE Robot. Autom. Lett. , 2024

work page 2024

[2] [2]

Resolving loop closure confusion in repetitive environments for visual slam through ai foundation models assistance,

H. Li, S. Yu, S. Zhang, and G. Tan, “Resolving loop closure confusion in repetitive environments for visual slam through ai foundation models assistance,” in Proc. IEEE Int. Conf. Robot. Autom. IEEE, 2024, pp. 6657–6663

work page 2024

[3] [3]

Past, present, and future of simultaneous localization and mapping: Toward the robust-perception age,

C. Cadena, L. Carlone, H. Carrillo, Y . Latif, D. Scaramuzza, J. Neira, I. Reid, and J. J. Leonard, “Past, present, and future of simultaneous localization and mapping: Toward the robust-perception age,” IEEE Trans. Robot., vol. 32, no. 6, pp. 1309–1332, 2016

2016

[4] [4]

ORB-SLAM2: an open-source SLAM system for monocular, stereo and RGB-D cameras,

R. Mur-Artal and J. D. Tard ´os, “ORB-SLAM2: an open-source SLAM system for monocular, stereo and RGB-D cameras,” IEEE Trans. Robot., vol. 33, no. 5, pp. 1255–1262, 2017

work page 2017

[5] [5]

Orb-slam3: An accurate open-source library for visual, visual–inertial, and multimap slam,

C. Campos, R. Elvira, J. J. G. Rodr ´ıguez, J. M. Montiel, and J. D. Tard ´os, “Orb-slam3: An accurate open-source library for visual, visual–inertial, and multimap slam,”IEEE Trans. Robot., vol. 37, no. 6, pp. 1874–1890, 2021

work page 2021

[6] [6]

Submap-based pose-graph visual slam: A robust visual exploration and localization system,

W. Chen, L. Zhu, Y . Guan, C. R. Kube, and H. Zhang, “Submap-based pose-graph visual slam: A robust visual exploration and localization system,” in Proc. IEEE/RJS Int. Conf. Intell. Robots Syst. IEEE, 2018, pp. 6851–6856

work page 2018

[7] [7]

Gv-bench: Benchmarking local feature matching for geometric verification of long-term loop closure detection,

J. Yu, H. Ye, J. Jiao, P. Tan, and H. Zhang, “Gv-bench: Benchmarking local feature matching for geometric verification of long-term loop closure detection,” in Proc. IEEE/RJS Int. Conf. Intell. Robots Syst. IEEE, 2024, pp. 7922–7928

work page 2024

[8] [8]

Switchable constraints for robust pose graph slam,

N. S ¨underhauf and P. Protzel, “Switchable constraints for robust pose graph slam,” in Proc. IEEE/RJS Int. Conf. Intell. Robots Syst. IEEE, 2012, pp. 1879–1884

work page 2012