[CVPR 2025] GGPT: Bridging the Gap Between Neural Feed-Forward and Geometric Structure-from-Motion

GGPT: Geometry Grounded Point Transformer

Summary
Problem
Method
Results
Takeaways
Abstract

GGPT (Geometry-Grounded Point Transformer) is a novel 3D reconstruction framework that enhances dense feed-forward predictions using a robust, lightweight Structure-from-Motion (SfM) pipeline. By fusing sparse, geometrically accurate points with dense but noisy point maps through a 3D Point Transformer, it achieves new SOTA performance in sparse-view reconstruction across multiple datasets (ScanNet++, ETH3D, etc.).

TL;DR

GGPT (Geometry-Grounded Point Transformer) is a modular refinement framework that "grounds" noisy dense 3D predictions from models like VGGT or DUSt3R using a lightweight, highly accurate SfM pipeline. By shifting the refinement process from 2D pixels to a unified 3D point cloud space, it eliminates multi-layer artifacts and achieves massive gains in reconstruction accuracy (+34% AUC in some cases) without requiring model fine-tuning.

Problem & Motivation: The Consistency Crisis

Recent years have seen a paradigm shift in 3D vision with feed-forward transformers (e.g., DUSt3R, VGGT). These models can predict camera poses and dense geometry in a single pass. However, they possess a fatal flaw: geometric inconsistency. Without explicit multi-view constraints, they often produce "ghosting" effects—multi-layered surfaces where there should be one—and struggle to generalize to out-of-distribution data like surgical scenes or human figures.

In contrast, Structure-from-Motion (SfM) is the gold standard for accuracy due to its grounding in epipolar geometry, but it is typically sparse and computationally heavy. The authors ask: Can we combine the completeness of neural networks with the precision of SfM?

Methodology: Geometry-Grounded 3D Reasoning

GGPT breaks this task into two distinct, efficient stages:

1. Robust & Efficient SfM

Instead of traditional incremental pipelines (like COLMAP), GGPT uses dense matchers (RoMa/UFM) combined with:

  • Sparse Bundle Adjustment (BA): Optimizing only a subset of high-confidence points to fix camera poses.
  • Direct Linear Triangulation (DLT): Parallelized 3D point reconstruction using CUDA, making it orders of magnitude faster than RANSAC-based methods.

2. The 3D Point Transformer (GGPT)

Unlike prior works that refined depth in 2D, GGPT performs attention directly in 3D coordinate space.

  • Input: It takes the noisy dense map () and the accurate sparse SfM cloud ().
  • Encodings: It uses specialized Positional Encodings (PE) and Correspondence Offsets () to tell the network exactly how far the dense points deviate from the geometric "ground truth" provided by SfM.
  • Backbone: It leverages the PTv3 architecture, processing the scene in local patches to maintain high efficiency and capture fine-grained details.

Overall Architecture Figure 1: GGPT Overview. The framework uses SfM to provide reliable anchors for the transformer to refine dense but inconsistent predictions.

Experiments & Results: SOTA Performance

The impact of GGPT is most evident in cross-domain scenarios. When a model trained on indoor rooms (ScanNet++) is tested on surgical data (MV-dVRK), the error drops significantly.

  • In-Domain (ScanNet++): VGGT + GGPT achieves 50/66 AUC vs. the baseline's 16/29 AUC (16 views).
  • Cross-Domain (ETH3D): GGPT improves almost every baseline model tested, proving its value as a universal "plug-and-play" module.
  • Efficiency: Despite the extra steps, GGPT remains faster than integrated solutions like MASt3R-SfM due to its linear DLT stage and efficient PTv3 backbone.

Experimental Results Figure 2: Performance vs. runtime. GGPT (RoMa v2) provides the best speed-accuracy trade-off, scaling efficiently to 50 views.

Critical Analysis & Conclusion

The core "Aha!" moment of this paper is the move from image-space refinement to 3D-space grounding. By treating the sparse SfM result as a "scaffold," the transformer learns to "pull" the dense neural predictions toward geometrically valid positions.

Takeaway

GGPT proves that we don't need to choose between neural "black-box" efficiency and geometric "white-box" accuracy. By modularizing the two, we can enhance existing foundation models without retraining them from scratch.

Limitations

  • Point-Based artifacts: As a point-based method, it can occasionally produce patchy artifacts in areas with zero SfM guidance.
  • Sequential Dependency: If the initial SfM stage fails (e.g., in extremely textureless environments), the refinement stage has no "ground" to stand on.

Conclusion: GGPT represents a significant step toward "Universal 3D Reconstruction" that is both complete and metrically reliable.

Find Similar Papers

Try Our Examples

  • Search for recent papers that integrate dense feature matching into end-to-end 3D reconstruction transformers to eliminate the separate SfM stage.
  • What is the theoretical origin of using Point Transformer V3 for geometry refinement tasks, and how does GGPT's patch-based processing differ from the original PTv3 implementation?
  • Find studies that apply 3D point cloud refinement techniques, specifically those similar to GGPT's geometry-guidance, to the field of 4D dynamic scene reconstruction or video-based SLAM.
Contents
[CVPR 2025] GGPT: Bridging the Gap Between Neural Feed-Forward and Geometric Structure-from-Motion
1. TL;DR
2. Problem & Motivation: The Consistency Crisis
3. Methodology: Geometry-Grounded 3D Reasoning
3.1. 1. Robust & Efficient SfM
3.2. 2. The 3D Point Transformer (GGPT)
4. Experiments & Results: SOTA Performance
5. Critical Analysis & Conclusion
5.1. Takeaway
5.2. Limitations