betaFeedback

WorksComputer Science

Map2SLAM: From Streaming Map Prediction to Real-Time SLAM

Abstract

Streaming 3D foundation models (3DFMs) estimate camera poses and dense geometry online, but they fall short of SLAM: their predictions are fixed once emitted, so loop closures cannot correct accumulated drift. With such models already providing strong geometric capability, a central question for SLAM becomes how to schedule their inference and how to keep its results as revisable state. We present Map2SLAM, which keeps LingBot-Map frozen, trains only a lightweight retrieval head, and builds SLAM on the model's inference interface, turning its predictions into observations of an external persistent SLAM state. The front-end tracks every incoming frame with the model's causal streaming inference and decides which frames are written to the persistent state as keyframes. The back-end asynchronously decides when and which past frames to re-observe, re-running the model's joint inference over them with fresh context; verified loop observations correct the trajectory online, and segment observations refine dense geometry after the sequence. All invocations share a single frame encoder pass per image, whose cached features also drive loop retrieval, so frequent re-invocation incurs no additional encoding cost. Map2SLAM achieves state-of-the-art performance on KITTI, VBR, and Oxford Spires, reducing mean ATE by over 40% compared with the best uncalibrated baselines, while maintaining real-time tracking at over 28 FPS at a resolution of 518×154518\times154 on an NVIDIA RTX 5090D GPU. Please visit our project page at https://robbyant-research.github.io/Map2SLAM/.

Introduction

Feed-forward 3D foundation models (3DFMs) infer camera poses and dense scene geometry directly from unposed images [48, 46]. Streaming 3DFMs extend this capability to online video, producing a geometric prediction for each incoming frame [56, 10]. However, these predictions are fixed once emitted: drift accumulates over long sequences, and even when the camera revisits a known place, earlier estimates cannot be corrected (Figure 1, left). Current streaming 3DFMs therefore cannot yet replace SLAM.

Figure 1. From Streaming Map Prediction to SLAM. Model outputs from LingBot-Map exhibit jitter and drift (left). Rather than treating these predictions as final estimates, Map2SLAM uses them as observations of persistent SLAM states (center). The Geometry Reasoner follows one prefix-causal attention architecture: selected history forms a fresh Bidirectional Prefix for re-observation, while Causal Continuation observes incoming frames. Both reuse features from a single Frame Encoder pass. These operations enable real-time tracking with a revisable history, yielding a globally consistent reconstruction (right).

Prior work has combined 3DFMs with SLAM in several ways: aligning chunk-wise predictions [13, 32], using a 3DFM as the front-end of a classical SLAM pipeline [40, 36, 35], or attaching loop closure to a streaming model [12, 25]. These methods invoke the model in a fixed pattern, over predefined chunks, frame pairs, or a single causal pass, rather than scheduling its inference. Given the strong geometric capability of current models, we argue that the key to building SLAM lies in how to schedule model inference and how to keep its results as revisable state. Just as LLM agents rely on a harness to schedule a fixed model, a 3DFM needs a similar mechanism to decide which frames enter its context, when to re-observe history, and which state each prediction updates.

Following this principle, we build Map2SLAM upon LingBot-Map [10] with a framework that schedules its inference and turns its predictions into persistent SLAM state, yielding accurate real-time SLAM. The prefix-causal structure of LingBot-Map supports two inference modes: Bidirectional Prefix jointly reasons over multiple frames, and Causal Continuation infers frame by frame autoregressively over long videos. Map2SLAM assigns the two modes to the two ends of the system: the front-end processes the live stream with Causal Continuation, and the back-end re-observes history with Bidirectional Prefix. The front-end decides which frames enter the context and are written to the state. To avoid the trajectory jitter caused by an ever-growing context, it tracks within bounded windows and treats each Causal Continuation step as a Keyframe Probe: based on the projective motion induced by the predicted geometry, an accepted frame is committed as a keyframe without repeated inference, and a rejected frame has its KV update rolled back.

Windowed tracking still accumulates drift over long sequences. The back-end revises the state asynchronously, deciding when and which past frames to re-observe. Whereas LingBot-Map uses Bidirectional Prefix only for initialization, the back-end re-invokes it with fresh context. Loop Retrieval proposes revisit candidates from cached features. Because appearance matches do not guarantee geometric consistency, Pairwise Geometry verifies each candidate with a two-view prefix, and verified constraints enter Incremental Pose Graph Optimization (iPGO), which corrects the trajectory online. The back-end also re-observes sequential and loop segments with multi-view prefixes, whose results feed Dense Geometric Refinement after the sequence ends. All invocations share a single Frame Encoder pass per image: both the downstream Geometry Reasoner and the retrieval head reuse its cached features, so frequent re-invocation incurs no additional encoding cost.

We evaluate Map2SLAM on KITTI [23], VBR [8], and Oxford Spires [42]. Map2SLAM achieves state-of-the-art performance on KITTI, VBR, and Oxford Spires, reducing mean ATE by more than 40% relative to the best-performing uncalibrated baselines, while running in real time at over 28 FPS with an input resolution of 518 × 154 on an NVIDIA RTX 5090D GPU.

Our contributions are threefold:

  • We propose a design principle for building SLAM on streaming 3DFMs: given their strong geometric capability, the key lies in scheduling model inference and managing the state formed by its results.

  • We present Map2SLAM, which realizes this principle on a frozen LingBot-Map: a causal front-end writes the state through commit-or-rollback Keyframe Probes, and an asynchronous back-end revisits it by re-invoking Bidirectional Prefix with fresh context, with all invocations sharing one Frame Encoder pass per image.

  • Map2SLAM achieves the lowest mean ATE among uncalibrated methods on KITTI, VBR, and Oxford Spires, 42.7–48.3% below the second-best results, while tracking at over 28 FPS on an NVIDIA RTX 5090D GPU.

Related Work

Long-Sequence Visual SLAM Visual SLAM has evolved from feature-based systems [30, 39], through direct methods [16, 17], to learned geometric frontends [43, 44]. Long-sequence SLAM, however, requires more than estimating motion as frames arrive. It must retain past estimates in its state so that a loop can introduce long-range constraints and revise the trajectory [39, 9, 16, 21, 33].

3D Foundation Models Recent 3D foundation models (3DFMs) infer camera and scene geometry in a feed-forward pass over image collections [48, 54, 46, 47, 18, 20]. Streaming 3DFMs extend this inference to video frames as they arrive [56, 10, 12, 25], enabling geometric prediction over increasingly long sequences. In particular, LingBot-Map [10] first processes an initial set of frames jointly to establish scene context, and then incrementally incorporates subsequent frames in an autoregressive manner.

Long-Sequence 3D Reconstruction Recent work extends 3DFMs to long sequences by composing local predictions into globally consistent reconstructions [13, 32, 55, 14, 52, 50]. Related efforts increasingly integrate 3DFM predictions with incremental estimation, loop closure, and global optimization [40, 36, 35, 37, 27, 31, 19]. Together, these developments are carrying long-sequence reconstruction beyond a purely offline setting and progressively closer to the system-level concerns of SLAM.

Method

Map2SLAM turns streaming geometric predictions into observations that update persistent trajectory and dense-geometry states. It builds on LingBot-Map [10], which first processes an initial frame set jointly with bidirectional attention for coordinate grounding and then handles later frames causally, one at a time, for online inference. We call these executions Bidirectional Prefix and Causal Continuation; together, they form a prefix-causal architecture [15]. Map2SLAM uses Causal Continuation for live tracking and runs Bidirectional Prefix again on selected historical frames to produce fresh geometric observations for optimization.

System Overview

In our Map2SLAM system, Front-end tracking and Back-end re-observation run asynchronously on separate GPUs. The Frame Encoder processes each image once: the Front-end consumes its geometric features immediately, while Back-end queries reuse cached outputs from the same pass. Within each tracking window, the Front-end maintains one active Geometry Reasoner context; each Back-end geometric query starts from a fresh context. Figure 2 summarizes this architecture.

Figure 2. System overview. The Frame Encoder processes each image once, and cached outputs are reused throughout. The Front-end initializes each tracking window with a Bidirectional Prefix, tracks through Causal Continuation, and admits keyframes through Keyframe Probe. Each Back-end path performs selection, fresh-context re-observation, and optimization. Loop Retrieval, Pairwise Geometry, and iPGO correct the trajectory online; Segment Scheduling, Segment Geometry, and Dense Optimization refine keyframe poses and depths after the sequence. Final keyframe corrections propagate to non-keyframes.

Front-end Tracking

Extending LingBot-Map’s streaming context over long sequences leads to trajectory jitter. We therefore track in bounded windows and reinitialize the active Geometry Reasoner context at each boundary. This bounds the context and stabilizes local tracking, but introduces drift between windows.

To initialize the first window, we process its first NpN_p frames as a Bidirectional Prefix, establishing the initial tracking context. For each subsequent frame, one Causal Continuation step tentatively extends the active context to form a Keyframe Probe, yielding the pose, depth, and intrinsics used to measure projective motion. Let k(i)k(i) denote the latest keyframe before frame IiI_i. We measure the projective motion induced by the probe as

mi=1∣Ωk(i)∣∑u∈Ωk(i)∥π(KiTi←k(i)π−1(u,Dk(i)(u),Kk(i)))−u∥2,(1)m_i = \frac{1}{\lvert\Omega_{k(i)}\rvert}\sum_{\mathbf{u}\in\Omega_{k(i)}} \left\lVert\pi\left(K_i T_{i\leftarrow k(i)}\pi^{-1}\left(\mathbf{u},D_{k(i)}(\mathbf{u}),K_{k(i)}\right)\right)-\mathbf{u}\right\rVert_2, \tag*{(1)}

where u\mathbf{u} denotes a pixel coordinate in keyframe k(i)k(i); TiT_i, KiK_i, and DiD_i are the predicted camera pose, intrinsics, and depth, respectively; π\pi and π−1\pi^{-1} denote perspective projection and back-projection; Ωk(i)\Omega_{k(i)} contains valid pixels of keyframe k(i)k(i); and Ti←k(i)=Ti−1Tk(i)T_{i\leftarrow k(i)} = T_i^{-1}T_{k(i)}. If mi>τm_i > \tau, the front-end accepts the candidate frame as a keyframe and commits its KV cache update; otherwise, it rejects the frame and rolls back the update.

When the context reaches its budget NbN_b, accepting a frame triggers context reinitialization rather than a commit. The front-end clears the KV cache and forms the successor Bidirectional Prefix from the accepted frame and the last Np−1N_p - 1 keyframes. This prefix has its own similarity gauge, which we align to the existing trajectory using the replayed keyframes: their depth ratios determine the scale sws_w, while their poses determine the rotation RwR_w and translation twt_w. Each local prediction (R~i,t~i,D~i)(\widetilde{R}_i,\widetilde{t}_i,\widetilde{D}_i) in the successor context is then mapped as

Ri=RwR~i,ti=swRwt~i+tw,Di=swD~i.(2)R_i = R_w\widetilde{R}_i,\qquad t_i = s_wR_w\widetilde{t}_i + t_w,\qquad D_i = s_w\widetilde{D}_i. \tag*{(2)}

This alignment preserves cross-window continuity for subsequent causal outputs.

For each accepted keyframe, the Front-end records its pose relative to the preceding accepted keyframe as a sequential observation. For each non-keyframe, it retains the causal pose relative to the latest keyframe for final trajectory recovery. Online Trajectory Correction combines the sequential observations with verified loop constraints to correct accumulated long-range drift.

Back-end Optimization

The Back-end comprises two paths with the same three stages: selection, geometric re-observation, and optimization. Online Trajectory Correction updates the trajectory while tracking continues; Dense Geometric Refinement jointly refines keyframe poses and depths after the sequence.

Online Trajectory Correction

Loop Retrieval Although LingBot-Map is trained to predict dense geometry, we find that intermediate tokens from its Frame Encoder remain effective for visual place recognition. We add a lightweight SALAD aggregation head [26] to these cached tokens while keeping the encoder frozen. The head produces a global descriptor for each accepted keyframe, and descriptor similarity proposes historical loop candidates for Pairwise Geometry.

To control the number of redundant loop candidates, each descriptor becomes searchable only after Q=64Q = 64 subsequent keyframes have been accepted, and each query retains up to K=5K = 5 loop candidates with SALAD similarity of at least τs=0.40\tau_s = 0.40. Once a pair is verified, we suppress further candidates between the accepted-keyframe neighborhoods of radius r=5r = 5 around its two endpoints.

Pairwise Geometry Pairwise Geometry consists of relative-geometry estimation followed by geometric consistency verification. For each loop candidate (i,j)(i,j), a fresh two-view Bidirectional Prefix over cached frame features jointly predicts the two camera poses, depth maps, and intrinsics. We then verify the predicted geometry through bidirectional depth consistency:

γi→j=1∣Ωi∣∑p∈Ωi1[ei→j(p)<ϵ],ei→j(p)=∣d^i→j(p)−dj(πi→j(p))∣dj(πi→j(p))(3)\gamma_{i\to j} = \frac{1}{\lvert\Omega_i\rvert}\sum_{p\in\Omega_i}\mathbf{1}[e_{i\to j}(p)<\epsilon], \qquad e_{i\to j}(p)=\frac{\left\lvert\hat{d}_{i\to j}(p)-d_j(\pi_{i\to j}(p))\right\rvert}{d_j(\pi_{i\to j}(p))} \tag*{(3)}

Here, Ωi\Omega_i contains source pixels with valid depth, while πi→j(p)\pi_{i\to j}(p) and d^i→j(p)\hat{d}_{i\to j}(p) denote the projected location and depth of pp in view jj, respectively. A projected depth is consistent when its relative error is below ϵ=0.10\epsilon= 0.10; invalid projections are counted as inconsistent. We use γij=min⁡{γi→j,γj→i}\gamma_{ij} = \min\{\gamma_{i\to j},\gamma_{j\to i}\} as the pairwise consistency score. If γij≥τg\gamma_{ij} \ge\tau_g, with τg=0.40\tau_g = 0.40, the candidate yields a verified loop constraint for iPGO; otherwise, it is discarded, as shown in Figure 3.

Loop retrieval followed by pairwise geometry

Figure 3. Loop Retrieval followed by Pairwise Geometry (τρ=τγ=0.4\tau_\rho= \tau_\gamma= 0.4). Both pairs pass appearance retrieval; fresh two-view geometric re-observation accepts (a) and rejects (b). Ground-truth camera-center distance is shown only for reference and is not used by the method.

Incremental Pose Graph Optimization At time tt, iPGO operates on the ordered accepted keyframes Kt=(k0,…,kNt−1)\mathcal{K}_t = (k_0,\ldots,k_{N_t-1}) and the loop candidates Ct\mathcal{C}_t proposed up to that time. Causal Tracking and Pairwise Geometry provide the sequential and verified-loop constraint sets

Eseq,t={(kn−1,kn)}n=1Nt−1,Eloop,tver={(i,j)∈Ct∣γij≥τg}.(4)\mathcal{E}_{\mathrm{seq},t}=\{(k_{n-1},k_n)\}_{n=1}^{N_t-1}, \qquad\mathcal{E}^{\mathrm{ver}}_{\mathrm{loop},t}=\{(i,j)\in\mathcal{C}_t\mid\gamma_{ij}\ge\tau_g\}. \tag*{(4)}

iPGO optimizes St={Si}i∈Kt\mathcal{S}_t=\{\mathbf{S}_i\}_{i\in\mathcal{K}_t}, where Si∈Sim⁡(3)\mathbf{S}_i\in\operatorname{Sim}(3). Each constraint (i,j)(i,j) supplies a relative measurement S^ij∈Sim⁡(3)\hat{\mathbf{S}}_{ij}\in\operatorname{Sim}(3). The Sim⁡(3)\operatorname{Sim}(3) representation allows joint correction of scale, rotation, and translation; fixing Sk0\mathbf{S}_{k_0} to its initial value removes the global gauge freedom.

Because Pairwise Geometry verifies each candidate independently, verified loop constraints may still conflict with the current trajectory. We jointly evaluate them against the sequential constraints using GNC-TLS (Yang et al., [51]) in riSAM’s incremental scheme (McGann et al., [38]), treating the sequential constraints as known inliers. Each verified loop receives a robust weight wij,t∈[0,1]w_{ij,t}\in[0,1], and the active set is Eloop,tact={(i,j)∈Eloop,tver∣wij,t≥0.5}\mathcal{E}^{\mathrm{act}}_{\mathrm{loop},t}=\{(i,j)\in\mathcal{E}^{\mathrm{ver}}_{\mathrm{loop},t}\mid w_{ij,t}\ge0.5\}. As new constraints arrive, the selector updates these weights without changing the loop measurements, allowing loops to be activated, withdrawn, or reactivated.

The sequential and active loop constraints enter a stateful iSAM2 graph (Kaess et al., [28]), which estimates the trajectory by minimizing

St∗=arg⁡min⁡St∑(i,j)∈Eseq,t∪Eloop,tactρH(dSim⁡(3)(S^ij,Sij(St))).(5)\mathcal{S}_t^*=\underset{\mathcal{S}_t}{\arg\min}\sum_{(i,j)\in\mathcal{E}_{\mathrm{seq},t}\cup\mathcal{E}^{\mathrm{act}}_{\mathrm{loop},t}}\rho_{\mathrm{H}}\left(d_{\operatorname{Sim}(3)}\left(\hat{\mathbf{S}}_{ij},\mathbf{S}_{ij}(\mathcal{S}_t)\right)\right). \tag*{(5)}

Here, Sij(St)\mathbf{S}_{ij}(\mathcal{S}_t) is the relative transformation implied by the current keyframe states, dSim⁡(3)d_{\operatorname{Sim}(3)} compares it with the measurement S^ij\hat{\mathbf{S}}_{ij}, and ρH\rho_{\mathrm{H}} is the Huber loss. As keyframes and active-set changes arrive, iSAM2 adds new states and sequential constraints and adds or removes loop constraints, revising the trajectory without rebuilding the graph.

Dense Geometric Refinement

Segment Scheduling We first group accepted keyframes for historical re-observation into two types of segments. For Sequential Segments, we slide a window of Ns=24N_s = 24 keyframes with an overlap of No=6N_o = 6 over the accepted-keyframe order. For a loop pair (i,j)(i,j), i<ji < j, we form a Loop Segment by concatenating Ns/2N_s/2 keyframes ending at kjk_j with Ns/2N_s/2 keyframes starting at kik_i. This ordering places the verified revisit at one adjacent seam in a virtual capture sequence. Sequential Segments become available upon window completion and Loop Segments upon loop verification.

Segment Geometry For each available segment, we run a fresh Bidirectional Prefix over its cached features. Unlike Causal Continuation, every keyframe can attend to all other keyframes in the segment, providing full multi-view context. Each execution outputs local poses, per-pixel depths, intrinsics, and confidence maps. These service as one segment observation. Reusing the cached features avoids another Frame Encoder pass, and these independent executions can overlap with Front-end Causal Tracking.

Dense Optimization After the input sequence ends and iPGO produces its final active set, we retain all Sequential Segment observations and the Loop Segment observations associated with this set, denoted by O\mathcal{O}. We initialize one shared pose TiT_i per keyframe from the final iPGO trajectory and optimize these poses together with one log-depth field ziz_i per keyframe and shared camera parameters α\alpha. For each retained segment ss, we fit a Sim⁡(3)\operatorname{Sim}(3) alignment AsA_s from its prefix-local poses to their iPGO counterparts and keep AsA_s fixed. The shared 3D point at pixel u\mathbf{u} is

Xi(u)=Tiπ−1(u,exp⁡zi(u),K(α)).\mathbf{X}_i(\mathbf{u}) = T_i\pi^{-1}(\mathbf{u}, \exp z_i(\mathbf{u}), K(\alpha)).

Following confidence-weighted 3D pointmap alignment [48], we optimize

min⁡{Ti,zi},α∑s∈O, i∈Ks∑u∈Ωsiwsi(u) ρδ(∥rsi(u)∥2),(6)\min_{\{T_i,z_i\},\alpha}\sum_{s\in\mathcal{O},\,i\in\mathcal{K}_s}\sum_{\mathbf{u}\in\Omega_{si}} w_{si}(\mathbf{u})\,\rho_\delta\left(\lVert\mathbf{r}_{si}(\mathbf{u})\rVert_2\right), \tag*{(6)}
rsi(u)=As−1Xi(u)−X~si(u)σrℓsi(u).\mathbf{r}_{si}(\mathbf{u}) = \frac{A_s^{-1}\mathbf{X}_i(\mathbf{u})-\widetilde{\mathbf{X}}_{si}(\mathbf{u})}{\sigma_r\ell_{si}(\mathbf{u})}.

Here, Ks\mathcal{K}_s contains the keyframes in segment ss, and Ωsi\Omega_{si} contains valid positive-depth predictions with confidence at least one. The weight wsiw_{si} is the predicted log confidence normalized by the number of retained segments covering keyframe ii. We set σr=0.1\sigma_r = 0.1 and use the Huber loss with δ=1.5\delta= 1.5. We fix the first keyframe pose, solve the remaining variables with Levenberg–Marquardt, and eliminate the per-pixel log depths at each iteration using an exact Schur complement. The optimized state yields refined keyframe poses, dense depths, and shared camera intrinsics.

Pose Correction Propagation

The back-end refines only keyframes, while non-keyframes retain their Causal Tracking poses relative to the preceding keyframe. The change from each keyframe’s causal pose to its final pose defines a Sim⁡(3)\operatorname{Sim}(3) correction. We interpolate these corrections between adjacent keyframes and apply them to intermediate non-keyframes, recovering the full trajectory without additional model inference.

Experiments

Benchmark Evaluation

We evaluate trajectory accuracy on KITTI Odometry [23], VBR [8], and Oxford Spires [42], using ATE after a global Sim⁡(3)\operatorname{Sim}(3) alignment. We report per-sequence ATE and the mean across sequences, grouping methods into calibrated and uncalibrated settings. Methods with frequent tracking failures are not reported on the corresponding benchmarks: ORB-SLAM3 is reported only on KITTI, while MAS3R-SLAM [40] is omitted from all three. VGG-SLAM 2.0 is included for reference only, as it reports poses at keyframes.

As shown in Figure 4(d–Figure 4f), LingBot-Map(S) exhibits severe local jitter, whereas LingBot-Map(W) produces a smoother trajectory but accumulates cross-window drift that distorts the global route.

Trajectory comparison plots for LoGeR, HorizonStream + LC, ABot-Recon + LC, LingBot-Map (S), LingBot-Map (W), and Ours

Figure 4. Trajectory comparison on VBR Spagna-0. The sequence contains 14,141 frames and covers 1.56 km. Blue and orange denote the reference and estimated trajectories, respectively.

Our system suppresses both effects and closely follows the ground truth. This improvement is also reflected quantitatively, with substantially lower ATE on KITTI, VBR, and Oxford Spires. These results suggest that model capability is only part of the equation; how its predictions are used matters too.

Against existing uncalibrated methods, our system achieves the lowest mean ATE on all three benchmarks, improving over ABot-Recon by more than 40% in each case. This advantage is consistent across sequences, with our system ranking first or second on 26 of the 28 sequences. Despite using no camera intrinsics, it also outperforms the best complete calibrated baseline on KITTI and VBR; on Oxford Spires, DPV-SLAM++ remains better at 2.28 m versus 3.07 m.

System Ablations

Pairwise Geometry Geometric consistency verification is critical for filtering false loop candidates before iPGO. As shown in Figure 5(a), without this check, adding Loop Retrieval and iPGO increases the mean ATE from 15.277 m to 71.825 m; with Pairwise Geometry, it drops to 7.534 m.

System ablation results, robust loop selection, and loop-region geometry across system stages

Figure 5. System Ablations. (a) Mean results on KITTI sequences 00–10 show that Geometric Check filters false loop candidates, while fixing segment alignments to the solution from Incremental Pose Graph Optimization (iPGO) recovers low ATE and retains low RPE. (b) On VBR diag_train0, GNC-TLS avoids the trajectory failure observed without it, reducing ATE from 35.641 m to 4.489 m. (c) Across Tracking, iPGO, and Dense Pose–Depth Optimization (Dense Opt.), the same loop-region point samples from the earlier (blue) and later (red) visits are overlaid in a common coordinate frame.

ConfigurationGeometric CheckGNC-TLSDense Opt.Segment Sim(3)ATE (m) ↓RPEₜ (m) ↓RPEᵣ (deg) ↓
Causal Tracking––––15.2770.6720.446
+ Retrieval + iPGO××––71.8252.9190.602
+ Geometric Check✓×––7.5340.6050.424
+ GNC-TLS✓✓––7.5680.6040.423
+ Dense Opt.✓✓✓Free12.9620.2890.302
Full method✓✓✓Fixed7.4890.2960.306

Table a. System component ablation on KITTI

GNC-TLS Pairwise-verified loops can still conflict globally. Although GNC-TLS has little effect on the KITTI mean ATE (7.534 → 7.568 m), it prevents the trajectory failure in the VBR diag_train0 stress case in Figure 5(b). Its benefit therefore lies in robustness to conflicting loop constraints rather than average accuracy.

Dense Geometric Refinement Free segment alignment substantially reduces translational and rotational RPE from 0.604 m/0.423° to 0.289 m/0.302°, but degrades the mean ATE from 7.568 m to 12.962 m, showing that better local geometry can come at the expense of global consistency. Fixing the iPGO-conditioned alignments restores the mean ATE to 7.489 m while retaining low RPE at 0.296 m/0.306°. Dense refinement is applied only at sequence end; online global correction is provided by iPGO.

Analysis of the Loop Retrieval Descriptor

Our retrieval descriptor reuses cached token features captured during LingBot-Map’s Frame Encoder pass. A 1.8M-parameter SALAD aggregation head converts these tokens into a global descriptor [26]. For 322 × 322 input images, this conversion takes only 0.94 ms. We train only this head on GSV-Cities [1] for 10 epochs at 224 × 224 resolution while keeping the Frame Encoder frozen. Training takes approximately 2 hours on one NVIDIA RTX 5090D GPU with mixed precision. The resulting descriptor achieves a mean Recall@1 (R@1) of 88.2 across MSLS-val [49], Pitts250k-test [45], and SPED [11], as shown in Figure 6(a). This result is comparable to strong CNN-based VPR baselines such as EigenPlaces [7] (88.5) and MixVPR [2] (89.0).

Latency–accuracy trade-off, ablation on blocks, and ablation on aspect

Figure 6. Visual place retrieval with LingBot-Map’s Frame Encoder. All three panels report Recall@1 (R@1 ↑). (a) By reusing cached Frame Encoder features, our full SLAM system achieves VPR accuracy comparable to strong CNN-based baselines with only a 1.8M-parameter head and 0.94 ms of additional descriptor latency for 322 × 322 inputs. (b) Block 18 is the best retrieval tap among the last eight Frame Encoder blocks. (c) The square-trained head remains stable across aspect ratios, allowing retrieval to consume cached features directly at the runtime input shape.

Although it trails standalone DINOv2 models specialized for VPR, including SALAD [26] and BoQ [3], the descriptor remains effective as the loop-candidate proposal stage of our full system. Pairwise Geometry verifies retrieved pairs before they enter the pose graph, and the complete-system results are reported in Table 1, Table 2, and Table 3.

MethodLCDense Geo.Frame-wise0001020304050607080910Avg. ↓
Calibrated
ORB-SLAM3 [9]✓✓7.77–25.180.850.726.0316.932.5764.556.768.48–
DROID-SLAM [43]✓✓✓110.1990.94138.723.201.4773.6461.5016.09103.8592.0122.2164.89
DPV-SLAM++ [33]✓✓7.8727.4871.752.561.035.9212.4918.00113.9474.5413.6531.75
Uncalibrated
DROID-Calib [24]✓✓47.6534.2193.955.782.3939.7411.2918.6276.3268.268.7937.00
VGGT-Long [13]✓✓10.8366.4155.695.573.9510.136.952.8357.5931.2122.1624.85
SwiftVGGT [32]✓✓9.30113.8256.2910.395.4311.828.3524.5668.9031.0825.0733.18
VGGT-SLAM 2.0† [35]✓✓104.44151.66146.8712.922.9210.3628.5818.2576.3928.8424.0455.02
LoGeR [53]✓62.9341.6839.184.871.8241.0913.8916.1826.4322.828.8125.43
LingBot-Map(S) [10]✓✓31.33102.4256.713.931.2723.598.338.6319.0921.5012.5226.30
LingBot-Map(W) [10]✓✓52.46106.7163.173.292.0630.398.399.6950.9554.848.9935.54
HorizonStream [12]✓✓✓15.3823.8970.805.560.717.947.733.1622.2927.2112.2917.91
ABot-Recon [25]✓✓✓11.6721.4939.824.362.905.918.651.6622.3914.0416.2213.56
Ours✓✓✓3.5126.9411.021.921.023.402.062.2416.189.655.247.56

Table 1. Absolute trajectory error (ATE, m) on KITTI [23]. “–” denotes tracking failure. LC, Dense Geo., and Frame-wise denote loop closure, dense geometry, and per-frame tracking, respectively. LingBot-Map(S/W) denote the streaming/window modes. † VGGT-SLAM 2.0 uses native keyframes only and is excluded from ranking. The best and second-best results in each section are shown in bold and underlined, respectively.

MethodLCDense Geo.Frame-wiseColosseo-0Campus-0Campus-1Pincio-1Spagna-0Diag-0Campimino-1Avg. ↓
Calibrated
DROID-SLAM [43]✓✓✓76.66125.7783.8749.8559.6135.81145.2882.41
DPV-SLAM++ [33]✓✓✓18.5921.6922.2239.3737.3133.5145.5631.18
Uncalibrated
DROID-Calib [24]✓✓27.3676.0568.5214.0925.38124.98–
VGGT-Long [13]✓✓44.13132.70115.6264.2959.0533.66179.4189.84
SwiftVGGT [32]✓✓21.24131.36115.9465.8058.4334.52176.5886.27
VGGT-SLAM 2.0† [35]✓✓18.7526.8822.9033.2510.176.4749.8024.03
LoGeR [53]✓25.5119.6929.2327.9122.8734.9993.0436.18
LingBot-Map(S) [10]✓✓14.8520.309.9230.4623.7122.6865.0926.71
LingBot-Map(W) [10]✓✓86.86123.09104.6463.4056.6823.6882.2077.22
HorizonStream [12]✓✓✓25.0028.7910.5415.4921.627.4418.3618.18
ABot-Recon [25]✓✓✓16.708.004.305.1217.919.698.099.97
Ours✓✓✓7.544.282.456.573.384.677.185.15

Table 2. Absolute trajectory error (ATE, m) on VBR [8]. “–” denotes tracking failure. LC, Dense Geo., and Frame-wise denote loop closure, dense geometry, and per-frame tracking, respectively. LingBot-Map(S/W) denote the streaming/window modes. † VGGT-SLAM 2.0 uses native keyframes only and is excluded from ranking. The best and second-best results in each section are shown in bold and underlined, respectively.

MethodLCDense Geo.Frame-wiseKC-02KC-03KC-04KC-05OQ-01OQ-02CC-02CC-03CC-05BL-02Avg. ↓
Calibrated
DROID-SLAM [43]✓✓✓7.8931.503.9336.440.430.294.090.868.961.209.56
DPV-SLAM++ [33]✓✓2.620.411.290.530.740.501.770.0811.932.912.28
Uncalibrated
DROID-Calib [24]✓✓11.894.821.8337.021.013.249.920.632.631.367.43
VGGT-Long [13]✓✓1.7614.7432.534.593.705.6611.654.0013.5116.1610.83
SwiftVGGT [32]✓✓7.7122.6924.5321.137.016.1825.180.8910.7729.7415.58
VGGT-SLAM 2.0† [35]✓✓4.639.324.755.981.841.651.990.9336.258.327.57
LoGeR [53]✓4.233.776.877.195.466.056.682.8111.7514.016.88
LingBot-Map(S) [10]✓✓3.723.022.736.903.262.2912.562.7933.7610.388.14
LingBot-Map(W) [10]✓✓5.408.1136.6729.717.766.9515.364.9814.4529.9215.93
HorizonStream [12]✓✓✓6.828.8421.1921.945.991.5430.195.8426.2927.9715.66
ABot-Recon [25]✓✓✓2.364.255.124.653.712.867.941.929.3711.415.36
Ours✓✓✓1.531.892.395.732.051.782.680.526.325.823.07

Table 3. Absolute trajectory error (ATE, m) on the Oxford Spires Dataset [42]. KC, OQ, CC, and BL denote Keble College, Observatory Quarter, Christ Church, and Bodleian Library, respectively. “–” denotes tracking failure. LC, Dense Geo., and Frame-wise denote loop closure, dense geometry, and per-frame tracking, respectively. LingBot-Map(S/W) denote the streaming/window modes. † VGGT-SLAM 2.0 uses native keyframes only and is excluded from ranking. The best and second-best results in each section are shown in bold and underlined, respectively.

Among the tested late Frame Encoder blocks, intermediate features outperform the final-block features for retrieval. Block 18 achieves the highest mean R@1 of 88.20, closely followed by Block 19 at 88.13, whereas the final Block 24 reaches 85.36 (Figure 6(b)). This trend is consistent with prior observations that DINO-based VPR can peak before the final transformer layer [29]. Finally, we test whether the square-trained head transfers to the native wide input used by the SLAM system. On KITTI [23], R@1 varies by only 0.38 points across five approximately token-matched input shapes and reaches 96.22 at the 154 × 518 runtime shape (Figure 6(c)). These results support applying the retrieval head directly to cached intermediate DINO tokens at the runtime input shape.

Conclusions

We presented Map2SLAM, which builds SLAM on a frozen LingBot-Map by scheduling its inference and keeping its predictions as revisable state. The front-end updates this state through Causal Continuation for stable online tracking, while the asynchronous back-end uses Bidirectional Prefix with newly available context to re-evaluate loop constraints for iPGO and to re-observe segments for Dense Geometric Refinement after the sequence. This design preserves local tracking stability while allowing global trajectory errors to be corrected over time. Experiments on KITTI, VBR, and Oxford Spires show that Map2SLAM reduces mean ATE by more than 40% compared with the second-best uncalibrated method, while maintaining a tracking speed above 28 FPS on an NVIDIA RTX 5090D GPU.

AI Use Statement

Generative AI tools were used to assist with manuscript drafting and language editing, as well as software development, including code generation, debugging, testing, and execution of experiments under instructions provided by the authors. The research ideas, methodology, experimental design, and interpretation of results were developed by the authors. All AI-assisted text, code, and experimental outputs were reviewed and verified by the authors. The authors take full responsibility for the final content and results of this work.

Additional Benchmark Results

Table 3 reports the per-sequence results on Oxford Spires. All methods process each sequence at its full length, without temporal cropping. We compute ATE after a single global Sim⁡(3)\operatorname{Sim}(3) alignment using all predicted poses with valid ground-truth correspondences.

SLAM System Profiling

Figure 7. System execution and memory profile for a complete KITTI 00 run on two NVIDIA RTX 5090D GPUs. During the online stage, GPU 0 performs Tracking, GPU 1 interleaves Loop Retrieval, Pairwise Geometry, and Segment Geometry, and the CPU executes Incremental PGO. GPU 1 performs terminal Dense Optimization after the online stage. The lower plot reports per-GPU VRAM usage throughout the run.

We profile the complete KITTI Sequence 00 on two NVIDIA RTX 5090D GPUs. GPU0 and GPU1 are dedicated to the front end and back end, respectively. GPU0 executes Tracking, while GPU1 executes Loop Retrieval, Pairwise Geometry, Segment Geometry, and terminal Dense Optimization. Both Pairwise Geometry and Segment Geometry use fresh-context bidirectional prefix inference over selected historical frames to obtain repeated geometric observations. On the CPU, we record only Incremental Pose Graph Optimization (iPGO). The activity bars show the measured execution spans of these components, while the memory curves report GPU memory usage sampled every 100 ms.

The profile shows the following:

  1. Smooth front-end tracking. GPU0 remains almost continuously occupied by Tracking and processes KITTI Sequence 00 at 29.1 FPS, indicating steady front-end execution.

  2. Asynchronous front-end/back-end execution. Tracking on GPU0 overlaps with loop processing and Segment Geometry on GPU1, as well as iPGO on the CPU. The repeated iPGO activity shows that the trajectory is updated online while new frames are being tracked.

  3. Effective loop-candidate filtering. From 4,541 input frames, the system selects 2,208 keyframes and computes a SALAD descriptor for each, but issues only 429 retrieval queries. These queries produce 2,141 candidate pairs, of which only 175 (8.2%) enter Pairwise Geometry. Among them, 59 pass verification, corresponding to 33.7% of the geometrically verified candidates and 2.8% of all retrieved pairs. The retrieval and candidate-pool filters therefore restrict expensive Pairwise Geometry to a small subset of candidate pairs.

  4. Opportunistic Segment Geometry. Loop Retrieval and Pairwise Geometry occupy only short intervals on GPU1, leaving substantial idle capacity for Segment Geometry. By running Segment Geometry concurrently with tracking, most segment observations are completed online, and the final Segment Geometry execution finishes only approximately 4.15 s after tracking ends.

  5. Dense-optimization memory bottleneck. During online operation, GPU0 and GPU1 peak at 9.73 GiB and 6.98 GiB, respectively. Terminal Dense Optimization raises the GPU1 peak to 12.94 GiB. Reducing the depth-map resolution may therefore lower the peak memory requirement.

Detailed VPR Evaluation

Table 4 extends the main-paper analysis with the complete R@1R@1/R@5R@5/R@10R@10 comparison on MSLS-val [49], Pitts250k-test [45], and SPED [11]. We measure every method within the same evaluation framework, using the same benchmark splits, ground-truth annotations, and FAISS L2 retrieval, while retaining each method’s standard evaluation resolution. Latency is measured with batch size 1 and FP16 inference on a single NVIDIA RTX 5090D GPU using CUDA events after at least 20 warm-up iterations. For standalone baselines, the reported latency covers a full descriptor-model forward at each method’s standard evaluation resolution. For our method, it covers only the 1.8M-parameter aggregation-head forward on precomputed tokens from 322×322322 \times322 images. GeM and NetVLAD are our GSV-Cities reproductions because no standard checkpoints are publicly available; the remaining rows use the corresponding released weights.

We train only the 1.8M-parameter aggregation head while keeping the Frame Encoder frozen. Training runs for 10 epochs on GSV-Cities [1] at 224×224224 \times224 resolution using 16-bit mixed precision on one NVIDIA RTX 5090D GPU and takes approximately two hours. We use AdamW with an initial learning rate of 10−310^{-3} and a batch of 128 places with four images per place. The learning rate decays linearly to 2×10−42 \times10^{-4} over training. We validate after each epoch on Pitts30k-val and select the checkpoint with the highest R@1R@1.

On MSLS-val, Pitts250k-test, and SPED, our descriptor reaches R@1R@1 scores of 87.8, 93.2, and 83.5, respectively. It outperforms SFRS [22], GeM [41], Conv-AP [1], and CosPlace [6] on all three datasets, while remaining within 1.2 points of MixVPR on each dataset.

Figure 8. **Qualitative point-cloud results on KITTI.**Top-down views of the point clouds produced by our method for Sequences 00–10.

MethodDim.Δ\DeltaParams (M)Δ\DeltaLatency (ms)MSLS-valPitts250k-testSPED
SFRS ([22])4096149.02.7864.2/74.6/77.889.5/95.3/96.573.0/85.7/87.8
GeM ([41])204823.53.6578.9/87.6/90.186.5/94.6/96.466.9/79.4/85.2
NetVLAD ([4])3276824.64.0383.1/90.7/92.792.6/97.5/98.379.2/89.3/91.9
Conv-AP ([1])409625.62.9283.0/90.1/92.692.6/97.7/98.681.1/89.6/93.3
CosPlace ([6])204827.73.0887.6/92.7/94.792.4/97.5/98.479.6/89.0/92.6
MixVPR ([2])409610.92.4888.1/93.2/94.594.3/98.2/98.984.7/92.3/94.4
EigenPlaces ([7])204827.72.9089.1/93.1/95.394.5/98.1/98.881.9/92.3/95.1
SALAD ([26])844888.05.5792.0/96.2/96.995.0/98.5/99.291.9/96.1/96.7
CricaVPR ([34])10752106.813.5589.5/95.4/96.295.6/98.5/99.289.6/94.6/95.4
BoQ (DINOv2) ([3])1228895.25.3493.8/96.8/97.096.6/99.1/99.592.6/95.9/96.9
MegaLoc ([5])8448228.65.9393.4/97.0/97.896.4/98.9/99.490.4/95.2/95.9
Ours84481.80.9487.8/93.8/94.693.2/97.6/98.683.5/92.1/94.6

Table 4. Detailed visual place retrieval results. Each dataset reports R@1/R@5/R@10R@1/R@5/R@10 (%); higher is better. Δ\DeltaParams and Δ\DeltaLatency denote the additional model parameters and inference latency incurred by adding each VPR method to our SLAM system. Standalone baselines add their full descriptor model, whereas Ours adds only the aggregation head on cached Frame Encoder tokens.

Additional full-sequence trajectory comparisons for KITTI 00, KITTI 02, and Oxford Spires Christ Church 05, comparing LoGeR, HorizonStream + LC, ABot-Recon + LC, LingBot-Map (S), LingBot-Map (W), and Ours

Figure 9. Additional full-sequence trajectory comparisons. Blue and orange denote the reference and estimated trajectories, respectively. Each estimate is aligned once over the full sequence by Sim⁡(3)\operatorname{Sim}(3), matching the ATE protocol.

Interactive Qualitative Results

Figure 10 shows qualitative SLAM results on 3 game sequences with different challenging conditions. The first GTAV sequence contains a transition from nighttime to daytime, while the second GTAV sequence features a sudden change in speed of camera motion. The third sequence, from Assassin’s Creed Origins, contains dense loop closures.

Figure 10. Results on three game sequences. Each row pairs the terminal system visualization (left) with the final trajectory against ground truth (right). The trajectory panels report ATE RMSE and normalized ATE (nATE).The trajectories estimated by our system are color-coded from blue to red over time, while the ground-truth trajectories are shown in gray. As illustrated, our estimated trajectories closely align with the ground truth across nearly all sequences.

The complete videos are available on the project page and provide a clearer view of the system’s behavior over time than the static frames shown here. We therefore encourage readers to explore the project page for a more comprehensive visualization of these sequences and our SLAM results.

References

  1. [1]Amar Ali-Bey, Brahim Chaib-Draa, and Philippe Giguere. Gsv-cities: Toward appropriate supervised visual place recognition. Neurocomputing, 2022.DOI
  2. [2]Amar Ali-Bey, Brahim Chaib-Draa, and Philippe Giguere. Mixvpr: Feature mixing for visual place recognition. In WACV, 2023.arxiv.org/abs/2303.02190
  3. [3]Amar Ali-Bey, Brahim Chaib-Draa, and Philippe Giguere. Boq: A place is worth a bag of learnable queries. In CVPR, 2024.arxiv.org/abs/2405.07364
  4. [4]Relja Arandjelovic, Petr Gronat, Akihiko Torii, Tomas Pajdla, and Josef Sivic. Netvlad: Cnn architecture for weakly supervised place recognition. In CVPR, 2016.
  5. [5]Gabriele Berton and Carlo Masone. Megaloc: One retrieval to place them all. In CVPRW, 2025.arxiv.org/abs/2502.17237
  6. [6]Gabriele Berton, Carlo Masone, and Barbara Caputo. Rethinking visual geo-localization for large-scale applications. In CVPR, 2022.arxiv.org/abs/2204.02287
  7. [7]Gabriele Berton, Gabriele Trivigno, Barbara Caputo, and Carlo Masone. Eigenplaces: Training viewpoint robust models for visual place recognition. In ICCV, 2023.arxiv.org/abs/2308.10832
  8. [8]Leonardo Brizi, Emanuele Giacomini, Luca Di Giammarino, Simone Ferrari, Omar Salem, Lorenzo De Rebotti, and Giorgio Grisetti. VBR: A vision benchmark in Rome. In ICRA, 2024.arxiv.org/abs/2404.11322
  9. [9]Carlos Campos, Richard Elvira, Juan J Gómez Rodríguez, José MM Montiel, and Juan D Tardós. ORB-SLAM3: An accurate open-source library for visual, visual–inertial, and multi-map SLAM. IEEE Trans. Robot., 2021.DOI
  10. [10]Lin-Zhuo Chen, Jian Gao, Shangzhan Zhang, Yihang Chen, Nan Xue, Jianyuan Wang, Christian Rupprecht, Xun Cao, Xing Zhu, Yujun Shen, Yao Yao, and Yinghao Xu. Geometric context transformer for streaming 3D reconstruction. In ECCV, 2026.arxiv.org/abs/2604.14141
  11. [11]Zetao Chen, Adam Jacobson, Niko Sünderhauf, Ben Upcroft, Lingqiao Liu, Chunhua Shen, Ian Reid, and Michael Milford. Deep learning features at scale for visual place recognition. In ICRA, 2017.arxiv.org/abs/1701.05105
  12. [12]Chong Cheng, Peilin Tao, Nanjie Yao, Guanzhi Ding, Xianda Chen, Yuansen Du, Xiaoyang Guo, Wei Yin, Weiqiang Ren, Qian Zhang, Zhengqing Chen, and Hao Wang. HorizonStream: Long-horizon attention for streaming 3D reconstruction. arXiv, 2026.arxiv.org/abs/2605.23889
  13. [13]Kai Deng, Zexin Ti, Jiawei Xu, Jian Yang, and Jin Xie. VGGT-Long: Chunk it, loop it, align it–pushing VGGT’s limits on kilometer-scale long RGB sequences. In ICRA, 2026.arxiv.org/abs/2507.16443
  14. [14]Tianye Ding, Yiming Xie, Yiqing Liang, Maitreya Chatterjee, Pedro Miraldo, and Huaizu Jiang. LASER: Layer-wise scale alignment for training-free streaming 4D reconstruction. In CVPR, 2026.arxiv.org/abs/2512.13680
  15. [15]Li Dong, Nan Yang, Wenhui Wang, Furu Wei, Xiaodong Liu, Yu Wang, Jianfeng Gao, Ming Zhou, and Hsiao-Wuen Hon. Unified language model pre-training for natural language understanding and generation. In NeurIPS, 2019.arxiv.org/abs/1905.03197
  16. [16]Jakob Engel, Thomas Schöps, and Daniel Cremers. LSD-SLAM: Large-scale direct monocular SLAM. In ECCV, 2014.DOI
  17. [17]Jakob Engel, Vladlen Koltun, and Daniel Cremers. Direct sparse odometry. IEEE Trans. Pattern Anal. Mach. Intell., 2018.
  18. [18]Xianze Fang, Jingnan Gao, Zhe Wang, Zhuo Chen, Xingyu Ren, Jiangjing Lyu, Qiao-Mu Ren, Zhonglei Yang, Xiaokang Yang, Yichao Yan, et al. Dens3R: A foundation model for 3D geometry prediction. In ICLR, 2026a.arxiv.org/abs/2507.16290
  19. [19]Zhijian Fang, Weicheng Zheng, Yijun Yuan, Weibang Wang, Zhuoguang Chen, Chang Sun, Junhao Huang, Kenan Li, Minghui Qin, and Hang Zhao. SLAMFormer-∞: Infinite SLAM transformer for unbounded frontend and backend processing. arXiv, 2026b.arxiv.org/abs/2608.03429
  20. [20]Jingnan Gao, Zhe Wang, Xianze Fang, Xingyu Ren, Zhuo Chen, Shengqi Liu, Yuhao Cheng, Jiangjing Lyu, Xiaokang Yang, and Yichao Yan. MoRE: 3D visual geometry reconstruction meets mixture-of-experts. In CVPR, 2026.arxiv.org/abs/2510.27234
  21. [21]Xiang Gao, Rui Wang, Nikolaus Demmel, and Daniel Cremers. LDSO: Direct sparse odometry with loop closure. In IROS, 2018.arxiv.org/abs/1808.01111
  22. [22]Yixiao Ge, Haibo Wang, Feng Zhu, Rui Zhao, and Hongsheng Li. Self-supervising fine-grained region similarities for large-scale image localization. In ECCV, 2020.arxiv.org/abs/2006.03926
  23. [23]Andreas Geiger, Philip Lenz, and Raquel Urtasun. Are we ready for autonomous driving? the KITTI vision benchmark suite. In CVPR, 2012.DOI
  24. [24]Annika Hagemann, Moritz Knorr, and Christoph Stiller. Deep geometry-aware camera self-calibration from video. In ICCV, 2023.DOI
  25. [25]Jiarong Han, Jincheng Xiong, Yuzhou Liu, Linzhe Shi, Changjie Wu, Ning Guo, Mu Xu, Hang Zhang, and Ming Qian. Revisiting local context for long-horizon streaming 3D reconstruction. arXiv, 2026.arxiv.org/abs/2608.27529
  26. [26]Sergio Izquierdo and Javier Civera. Optimal transport aggregation for visual place recognition. In CVPR, 2024.arxiv.org/abs/2311.15937
  27. [27]Jinwoo Jeon, Dong-Uk Seo, Eungchang Mason Lee, and Hyun Myung. AIM-SLAM: Dense monocular SLAM via adaptive and informative multi-view keyframe prioritization with foundation model. In ICRA, 2026.arxiv.org/abs/2603.05097
  28. [28]Michael Kaess, Hordur Johannsson, Richard Roberts, Viorela Ila, John J Leonard, and Frank Dellaert. isam2: Incremental smoothing and mapping using the bayes tree. Int. J. Robot. Res., 2012.DOI
  29. [29]Nikhil Keetha, Avneesh Mishra, Jay Karhade, Krishna Murthy Jatavallabhula, Sebastian Scherer, Madhava Krishna, and Sourav Garg. AnyLoc: Towards universal visual place recognition. IEEE Robot. Autom. Lett., 2023.arxiv.org/abs/2308.00688
  30. [30]Georg Klein and David Murray. Parallel tracking and mapping for small AR workspaces. In ISMAR, 2007.DOI
  31. [31]Inha Lee, Dongjae Jeong, Junhee Lee, and Kyungdon Joo. UniSim-SLAM: Feed-forward SLAM with unified Sim(3) optimization. arXiv, 2026a.arxiv.org/abs/2608.01706
  32. [32]Jungho Lee, Minhyeok Lee, Sunghun Yang, Minseok Kang, and Sangyoun Lee. SwiftVGGT: A scalable visual geometry grounded transformer for large-scale scenes. In CVPR Findings, 2026b.arxiv.org/abs/2511.18290
  33. [33]Lahav Lipson, Zachary Teed, and Jia Deng. Deep patch visual SLAM. In ECCV, 2024.arxiv.org/abs/2408.01654
  34. [34]Feng Lu, Xiangyuan Lan, Lijun Zhang, Dongmei Jiang, Yaowei Wang, and Chun Yuan. Cricavpr: Cross-image correlation-aware representation learning for visual place recognition. In CVPR, 2024.arxiv.org/abs/2402.19231
  35. [35]Dominic Maggio and Luca Carlone. VGGT-SLAM 2.0: Real-time dense feed-forward scene reconstruction. In RSS, 2026.arxiv.org/abs/2601.19887
  36. [36]Dominic Maggio, Hyungtae Lim, and Luca Carlone. VGGT-SLAM: Dense RGB SLAM optimized on the SL(4) manifold. In NeurIPS, 2025.
  37. [37]Avilasha Mandal, Rajesh Kumar, Sudarshan Sunil Harithas, and Chetan Arora. VGGT-SLAM++. In CVPRW, 2026.arxiv.org/abs/2604.06830
  38. [38]Daniel McGann, John G Rogers, and Michael Kaess. Robust incremental smoothing and mapping (risam). In ICRA, 2023.arxiv.org/abs/2209.14359
  39. [39]Raul Mur-Artal, Jose Maria Martinez Montiel, and Juan D Tardos. ORB-SLAM: A versatile and accurate monocular SLAM system. IEEE Trans. Robot., 2015.
  40. [40]Riku Murai, Eric Dexheimer, and Andrew J Davison. MASt3R-SLAM: Real-time dense SLAM with 3D reconstruction priors. In CVPR, 2025.
  41. [41]Filip Radenović, Giorgos Tolias, and Ondřej Chum. Fine-tuning cnn image retrieval with no human annotation. IEEE Trans. Pattern Anal. Mach. Intell., 2018.
  42. [42]Yifu Tao, Miguel Ángel Muñoz-Bañón, Lintong Zhang, Jiahao Wang, Lanke Frank Tarimo Fu, and Maurice Fallon. The Oxford Spires Dataset: Benchmarking large-scale LiDAR-visual localisa- tion, reconstruction and radiance field methods. Int. J. Robot. Res., 2026.arxiv.org/abs/2411.10546
  43. [43]Zachary Teed and Jia Deng. DROID-SLAM: Deep visual SLAM for monocular, stereo, and RGB-D cameras. In NeurIPS, 2021.
  44. [44]Zachary Teed, Lahav Lipson, and Jia Deng. Deep patch visual odometry. In NeurIPS, 2023.arxiv.org/abs/2208.04726
  45. [45]Akihiko Torii, Josef Sivic, Tomas Pajdla, and Masatoshi Okutomi. Visual place recognition with repetitive structures. In CVPR, 2013.
  46. [46]Jianyuan Wang, Minghao Chen, Nikita Karaev, Andrea Vedaldi, Christian Rupprecht, and David Novotny. VGGT: Visual geometry grounded transformer. In CVPR, 2025.arxiv.org/abs/2503.11651
  47. [47]Jianyuan Wang, Minghao Chen, Shangzhan Zhang, Nikita Karaev, Johannes Schönberger, Patrick Labatut, Piotr Bojanowski, David Novotny, Andrea Vedaldi, and Christian Rupprecht. VGGT-Ω. In CVPR, 2026.DOI
  48. [48]Shuzhe Wang, Vincent Leroy, Yohann Cabon, Boris Chidlovskii, and Jerome Revaud. DUSt3R: Geometric 3D vision made easy. In CVPR, 2024.arxiv.org/abs/2312.14132
  49. [49]Frederik Warburg, Soren Hauberg, Manuel Lopez-Antequera, Pau Gargallo, Yubin Kuang, and Javier Civera. Mapillary street-level sequences: A dataset for lifelong place recognition. In Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, pp. 2626– 2635, 2020.DOI
  50. [50]Zhuang Xiong, Chen Zhang, Qingshan Xu, and Wenbing Tao. VGGT-Motion: Motion-aware calibration-free monocular SLAM for long-range consistency. In ICML, 2026.arxiv.org/abs/2602.05508
  51. [51]Heng Yang, Pasquale Antonante, Vasileios Tzoumas, and Luca Carlone. Graduated non-convex for robust spatial perception: From non-minimal solvers to global outlier rejection. IEEE Robot. Autom. Lett., 2020.DOI
  52. [52]Fengyi Zhang, Tianjun Zhang, Kasra KhoussoussI, Zheng Zhang, Zi Huang, and Yadan Luo. TALO: Pushing 3D vision foundation models towards globally consistent online reconstruction. In CVPR, 2026a.arxiv.org/abs/2512.02341
  53. [53]Junyi Zhang, Charles Herrmann, Junhwa Hur, Chen Sun, Ming-Hsuan Yang, Forrester Cole, Trevor Darrell, and Deqing Sun. LoGeR: Long-context geometric reconstruction with hybrid memory. arXiv, 2026b.arxiv.org/abs/2603.03269
  54. [54]Shangzhan Zhang, Jianyuan Wang, Yinghao Xu, Nan Xue, Christian Rupprecht, Xiaowei Zhou, Yujun Shen, and Gordon Wetzstein. FLARE: Feed-forward geometry, appearance and camera estimation from uncalibrated sparse views. In CVPR, 2025.arxiv.org/abs/2502.12138
  55. [55]Wei Zhang, Yihang Wu, Songhua Li, and Qi Wang. VGGT-Align: Bridging local reconstruction and global consistency for long-sequence 3D reconstruction. In ACM MM, 2026c.DOI
  56. [56]Dong Zhuo, Wenzhao Zheng, Jiahe Guo, Yuqi Wu, Jie Zhou, and Jiwen Lu. Streaming visual geometry transformer. In ICLR, 2026.

Paper details

vlnc:W_qne2tset
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 7

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

Generative AI tools

View statement
Looking for related papers…
Contents