Organizations: Beijing Normal-Hong Kong Baptist University · Jilin University · Hong Kong Baptist University · Guangdong Provincial Key Laboratory of Interdisciplinary Research and Application for Data Science
Feed-forward 3D foundation models face a key challenge: the quadratic computational cost introduced by global attention, which severely limits scalability as input length increases. Concurrent acceleration methods, such as token merging, operate at the token level. While they offer local savings, the required nearest-neighbor searches introduce undesirable overhead. Consequently, these techniques fail to tackle the fundamental issue of structural redundancy dominant in dense capture data. In this work, we introduce S-VGGT, a novel approach that addresses redundancy at the structural frame level, drastically shifting the optimization focus. We first leverage the initial features to build a dense scene graph, which characterizes structural scene redundancy and guides the subsequent scene partitioning. Using this graph, we softly assign frames to a small number of subscenes, guaranteeing balanced groups and smooth geometric transitions. The core innovation lies in designing the subscenes to share a common reference frame, establishing a parallel geometric bridge that enables independent and highly efficient processing without explicit geometric alignment. This structural reorganization provides strong intrinsic acceleration by cutting the global attention cost at its source. Crucially, S-VGGT is entirely orthogonal to token-level acceleration methods, allowing the two to be seamlessly combined for compounded speedups without compromising reconstruction fidelity. Code is available at https://github.com/Powertony102/S-VGGT.
Figures & tables
Fig. 1: Comparison of VGGT (2.69 FPS) and S-VGGT (10.13 FPS) on a 500-frame scene. S-VGGT achieves a significant speedup by processing subscenes in parallel while maintaining reconstruction quality.
Fig. 2: The framework of S-VGGT. The input frames are first embedded into tokens, and frame similarity is calculated to assess redundancy. Frames are then grouped into subscenes via soft assignment, ensuring parallel processing. A shared reference frame across subscenes enables efficient global and frame attention operations, with the model architecture based on VGGT [ 18 ] .
Method
NRGBD
7 Scenes
Acc ↓
Comp ↓
NC ↑
FPS ↑
Acc ↓
Comp ↓
NC ↑
FPS ↑
Mean
Med.
Mean
Med.
Mean
Med.
Mean
Med.
Mean
Med.
Mean
Med.
Fast3R
0.088
0.040
0.031
0.011
0.607
0.640
5.484
0.058
0.025
0.049
0.009
0.572
0.609
5.312
CUT3R
0.286
0.208
0.105
0.036
0.567
0.597
15.342
0.175
0.121
0.083
0.083
0.546
0.563
15.435
Spann3R
0.700
0.343
0.221
0.128
0.559
0.587
7.961
0.379
0.242
0.163
0.080
0.534
0.548
7.895
VGGT ∗
0.031
0.019
0.025
0.010
0.642
0.767
2.732
0.019
0.009
0.028
0.010
0.632
0.716
2.612
TABLE I: Quantitative results of point cloud reconstruction on the Neural RGB-D [ 1 ] and 7-Scenes [ 15 ] datasets with 500-frame input sequences. The best results are highlighted in bold , and the second-best results are underlined.
Method
ATE ↓
ARE ↓
RPE-rot ↓
RPE-trans ↓
FPS ↑
Fast3R
1.065
42.024
28.461
0.456
2.673
CUT3R
1.235
56.756
0.968
0.048
11.725
Spann3R
OOM
OOM
OOM
OOM
OOM
VGGT ∗
0.190
4.351
0.864
0.038
1.458
FastVGGT
0.162
3.805
0.656
0.030
5.200
Ours
0.145
3.576
0.665
0.053
5.699
TABLE II: Quantitative results of camera pose estimation and point cloud reconstruction on the ScanNet dataset with input sequences of 1000 images. OOM denotes out-of-memory.
Fig. 3: Qualitative comparison of camera pose estimation performance between S-VGGT and VGGT ∗ .
Fig. 4: Compounded Speedup (vs. VGGT ∗ ) on NRGBD [ 1 ] Results validate the complementarity of frame-level S-VGGT (”Ours”) and token-level FastVGGT (”Fast”), showing enhanced acceleration across varying sequence lengths.
Feed-forward 3D foundation models reconstruct scenes from unposed images, but the quadratic cost of global attention limits their scalability to large view sets. We present Zebra3D, a layerwise sparse-linear hybrid attention framework that improves the efficiency of pretrained 3D foundation models without training from scratch. Across VGGT, HunyuanWorld-Mirror, and π3, we observe a broadly consistent depth-wise pattern: early stages are relatively tolerant to linear replacement, while sensitive middle-to-late stages tend to exhibit more concentrated attention. Zebra3D exploits this structure by assigning linear-centered attention to tolerant stages and tile-sparse attention to sensitive stages, using landmark summaries to preserve unselected context. Closed-form affine fitting enables training-free conversion, while optional post-conversion training combines task supervision with output and relational feature distillation. Across all three backbones, Zebra3D achieves strong reconstruction and camera-pose accuracy at high attention sparsity, with training-free variants remaining close to their dense counterparts. End-to-end speedups increase with input view count, reaching up to 7.1× at 1,024 views. After post-conversion training, Zebra3D-VGGT reaches 80.5% RealEstate10K AUC@30 at 94% mean attention sparsity, within 1.1 percentage points of dense VGGT fine-tuned on the same data and schedule.
Utkarsh Saxena, Ruijing Yang, Mehdi Rezagholizadeh +3
Visual Geometry Grounded Transformer (VGGT) recovers dense 3D scene structure from multi-view images in one forward pass, but quadratic cross-frame attention limits its scalability. Existing training-free accelerators reduce computation uniformly along one axis, missing layer heterogeneity. Our spectral, probing, and causal analyses reveal three regimes: shallow layers lack cross-view structure, middle layers drive cross-view alignment, and deep layers are redundant for dense geometry yet their cross-frame attention remains essential for pose. RegimeVGGT applies layer-wise U-shaped compression along two axes: Saliency-Guided Banded Merging protects geometry- and edge-salient tokens, while Selectively Protected K/V Downsampling preserves cross-frame spatial coverage and the pose-critical path through a phase-shifted spatial grid, a reference-frame anchor, and uncompressed camera/register tokens. Training-free, RegimeVGGT achieves a 6.7x speedup over VGGT* at matched reconstruction quality.
Jinhao You, Shuo Lyu, Zhuohang Lyu +5
University of Pennsylvania · University of California, Irvine · Nanyang Technological University +1
Feed-forward 3D reconstruction models based on Vision Transformers can directly estimate scene geometry and camera poses from a small set of input images, but scaling them to video inputs with hundreds or thousands of frames remains challenging due to the quadratic cost of global attention layers. Recent token-merging methods accelerate these models by compressing the token sequence within the global attention layers, but they apply a uniform reduction to query tokens and key-value tokens, ignoring their functionally distinct roles in 3D reconstruction. In this work, we identify a key property of feed-forward 3D reconstruction models: query tokens encode view-specific geometric requests and are sensitive to compression, while key-value tokens represent shared scene context and tolerate aggressive compression. Guided by this insight, we propose Spark3R, a training-free acceleration framework that decouples the compression of query tokens and key-value tokens by assigning distinct reduction factors, with intra-group token merging applied to query tokens and lightweight token pruning to key-value tokens. Additionally, Spark3R adaptively adjusts the key-value reduction factor across layers, further improving the quality-efficiency trade-off. As a plug-and-play framework requiring no retraining, Spark3R integrates directly into multiple pretrained feed-forward 3D reconstruction models, including VGGT, π3, Depth-Anything-3, and VGGT-Ω, and achieves up to 28× speedup on 1,000-frame inputs while maintaining competitive reconstruction quality.
Zecheng Tang, Jiaye Fu, Qiankun Gao +5
School of Electronic and Computer Engineering, Peking University, Shenzhen 518055, China