Backend
Scale Anchoring via Implicit Semantics and Sequence-Consistent Loop Closure for VGGT-Based SLAM
arXiv cs.RO0 views
arXiv:2611.06308v1 Announce Type: new Abstract: Feed-forward geometric foundation models enable dense monocular reconstruction without requiring camera calibration, but independently reconstructed submaps can accumulate scale drift, and even a valid revisit can yield an inconsistent cross-submap measurement. We extend VGGT-SLAM 2.0 with fixed-root scale anchoring and short-sequence-assisted direct loop connections. SALAD selects an image pair between the initial submap and each eligible new submap; joint VGGT inference then uses learned implicit semantic-geometric cues to supply a scale-only anchor while preserving the original overlap chain. For loop closure, neighboring image pairs support a consistency check and translation-scale alignment. Each accepted candidate contributes one robust Sim(3) factor between existing center-frame nodes, without an auxiliary loop submap. A 17-sequence comparison lowers mean Sim(3) ATE on nine TUM sequences from 0.1018 to 0.0451 m relative to the VGGT-SLAM 2.0 baseline. Anchoring improves all seven no-loop module ablations. On three Clio scenes, a fixed-loop comparison favors the direct connection pipeline over the tested auxiliary-submap pipeline. A separate candidate audit exposes additional rejections of visually overlapping pairs by the short-sequence check. These comparisons distinguish the gains from long-range scale anchoring and loop connection choices from the limitations of candidate verification.
Source:https://arxiv.org/abs/2611.06308PreviousCorridor-Based Monitoring and Emergency Braking Decision for Automated Vehicle SafetyNextVortex-Induced Torque in Grasping Soft Objects: Influence of Geometry and Pneumatic Parameters
Related posts
Cloud Storage CORS Support for Direct Browser Receipt Uploads (A Go Retention Boundary)
0dev.to Go
5 Ways to Publish Timed Caption Segments with Reconnect Handling in Live Rooms
0dev.to Go

Efficiently Growing Unowned Maps in Go: Avoiding Resizes and Reducing Memory Overhead
0dev.to Go
Syncing 1C and Bitrix24 Without Duplicates: Designing an Idempotent Exchange
0dev.to Database
Kimball's Data Warehouse Architecture: Evaluating the Challenges of Conformed Data against the Inmon Model
0arXiv cs.DB
COL-Trees: Efficient Hierarchical Object Search in Spatial Networks
0arXiv cs.DB