betaFeedback

WorksComputer Science

Refin3R: Geometry-Guided Refinement for Feed-Forward 3D Reconstruction

Abstract

Feed-forward 3D reconstruction models predict dense point maps from multiple images in a single pass. Without explicit geometric constraints, however, their predictions are often inconsistent across views and lack fine-grained precision. Recent methods incorporate geometric priors such as camera pose or depth, but use them merely as auxiliary inputs, process each view independently, or refine the geometry only where the priors are available. We present Refin3R, which refines feed-forward point maps with Structure-from-Motion (SfM) points, propagating SfM geometry over the image grid. In its dual-branch architecture, a 2D branch extends SfM geometry beyond its coverage using geometry-aware backbone features, while a 3D branch reasons over the SfM points of all views, capturing multi-view structure that the image grid alone cannot represent. The two branches exchange information bidirectionally to jointly refine each view, yielding dense and accurate point maps. Across ScanNet++, ETH3D, Tanks&Temples, and out-of-domain human and surgical scenes, Refin3R consistently outperforms feed-forward and geometry-guided methods in point map accuracy while running faster than the strongest geometry-guided baseline.

Introduction

Multi-view 3D reconstruction from RGB images is a long-standing problem in computer vision. Recent feed-forward methods [27, 50, 52], trained on large-scale datasets, predict dense point maps for all views in a single forward pass. Their fast and scalable inference has established this paradigm as a promising direction, and follow-up works are rapidly emerging [20, 51, 55]. However, these models regress point maps purely from learned priors, without enforcing explicit geometric constraints such as triangulation [16]. As a result, their predictions are often inconsistent across views and lack fine-grained precision.

Structure-from-Motion (SfM) [1, 32, 40, 58], in contrast, establishes correspondences across images and triangulates them under explicit multi-view constraints, yielding consistent and accurate points. Yet it often recovers only sparse geometry and becomes fragile under wide baselines or low overlap [35, 41]. Moreover, since it relies solely on correspondences without semantic understanding, mismatches can introduce outliers [5]. The two paradigms are thus complementary: feed-forward models are dense but imprecise, whereas SfM is accurate but incomplete.

Recent works incorporate explicit geometric cues, such as correspondences, camera poses, or depth, into feed-forward reconstruction. Optimization-based methods [9, 26] match pixels across views with learned matchers and jointly refine cameras and dense depth, initialized from feed-forward predictions. However, they adjust depth only via a coarse grid of anchor depths or a few per-image coefficients, limiting fine-grained refinement. Learning-based methods instead feed geometric priors into networks: geometry-conditioned feed-forward models [19, 20] take cameras or depth as extra inputs, and depth completion methods [14, 64, 65] densify sparse depth under image guidance. However, the former use the priors merely as auxiliary inputs, while the latter process each view independently, ignoring the 3D structure shared across views.

Closer to our work, GGPT [6] refines the feed-forward point maps of all views jointly in 3D space with accurate points from its SfM pipeline, enforcing multi-view consistency around these points. However, it refines local cubic patches of points from geometric inputs alone, so its refinement remains largely confined to the regions covered by SfM. Areas without such coverage, typically textureless surfaces and regions observed by a single view, thus benefit little from the SfM guidance (Figure 1).

Comparison of partial and dense reconstruction, and error maps for DA3, SfM, GGPT, and Refin3R

Figure 1. Refin3R refines feed-forward 3D reconstruction with SfM points. Given multi-view images, feed-forward models such as Depth Anything 3 (DA3) [27] predict dense but less accurate point maps, while SfM points are accurate but incomplete. Leveraging both, Refin3R produces dense and accurate point maps. Right: error maps of DA3, SfM (GGPT pipeline [6]), GGPT, and Refin3R.

Motivated by these limitations, we propose Refin3R, which refines the feed-forward point maps as per-view depth on the image grid rather than as points in 3D space. Operating on the image grid allows Refin3R to leverage the dense image features of the pretrained feed-forward backbone [27, 55], which guide the refinement across the whole image. In addition, Refin3R exploits the SfM points of all views in 3D, so that each view is refined with the multi-view structure of the scene rather than only the points it observes. By combining both, Refin3R recovers accurate point maps even in regions without SfM coverage (Figure 1).

We realize this with a dual-branch architecture: a 2D branch on the image grid and a 3D branch on sparse voxels. The 2D branch refines the feed-forward depth of each view with its own SfM depth, guided by the dense image features from the feed-forward backbone, whose semantic and geometric cues let the SfM depth propagate beyond its coverage. This per-view input, however, holds at most one depth per pixel, so SfM points occluded in the current view or triangulated only from other views are left out. The 3D branch complements it by gathering the SfM points of all views into sparse voxels within the space seen by each view, providing a richer 3D structure than the view’s own SfM depth. As each voxel is indexed by a pixel and a depth bin, the two branches share the same pixel coordinates and exchange information: the 2D branch receives the multi-view evidence that the image grid alone cannot represent, and the 3D branch receives the image context around each point. Spatial propagation then fuses their predictions into the refined depth, which is back-projected to obtain the refined point maps.

Extensive experiments show that Refin3R achieves state-of-the-art point map accuracy on both standard and out-of-domain benchmarks, consistently outperforming feed-forward and geometry-guided methods by a large margin. Moreover, while sharing its SfM front-end with the strongest geometry-guided baseline, Refin3R runs substantially faster, making it an efficient refinement module for feed-forward 3D reconstruction.

Related works

3D reconstruction

Multi-view 3D reconstruction has long been studied in computer vision, with its foundations in classical multi-view geometry [2, 13, 15, 32], and has matured into practical SfM systems [1, 18, 34, 58] such as COLMAP [40]. Learning-based components have since been integrated throughout the SfM pipeline, from feature detection and matching [8, 10, 11, 12, 24, 30, 39, 43, 63] to track refinement [17, 23, 29]. Beyond individual components, VGGSfM [49] makes the entire pipeline end-to-end differentiable, while MP-SfM [35] leverages monocular priors to improve robustness under low overlap. Recently, feed-forward reconstruction models infer scene geometry and camera parameters directly from images. Pairwise models [25, 52] regress point maps from image pairs but require a global alignment for more views, whereas subsequent multi-view models [20, 27, 50, 51, 55] process all views jointly in a single forward pass. Trained on large-scale 3D data, these models are fast and robust in sparse-view settings, yet without explicit geometric constraints their predictions often lack multi-view consistency and local precision, especially on out-of-domain scenes.

Geometry-guided reconstruction

Recent works leverage both feed-forward models and multi-view geometry, following two directions. One direction refines feed-forward predictions by correspondence-based optimization. VGGT+BA [50] refines the predicted cameras through bundle adjustment [45] to improve their accuracy, and MASt3R-SfM [9] and BLASt3R [26] further optimize dense depth jointly with the cameras. The other direction feeds geometric priors into feed-forward models, e.g., multi-view transformers that take camera parameters or depth as optional inputs [19, 20, 55]. Most closely related, GGPT [6] combines both directions: it obtains accurate SfM points with dense matching, sparse bundle adjustment initialized by feed-forward predictions, and linear triangulation [15], and refines the feed-forward point maps with them using a 3D point transformer [59]. We adopt its SfM pipeline but refine depth in the image domain with geometry-aware image features, while aggregating the SfM points of all views in 3D.

Depth completion

Geometry-guided reconstruction is closely related to depth completion, which densifies sparse depth, typically from LiDAR [47, 48, 62, 65], under image guidance, with recent methods leveraging monocular depth foundation models [56, 64]. Following this formulation, Murre [14] performs multi-view reconstruction by guiding a monocular diffusion model with the SfM depth of each view. However, these methods process each view independently and only use the measurements observed in that view. Our image-domain refinement shares this spirit, but both the image features and the SfM evidence in our method are multi-view: the features come from a multi-view feed-forward model, and the 3D branch aggregates the SfM points of all views.

Method

Overview

Given NN RGB images {Ii}i=1N\{I_i\}_{i=1}^{N}, our goal is to reconstruct a dense point map Pi∈RH×W×3P_i \in\mathbb{R}^{H \times W \times3} for each view in a shared coordinate system. As illustrated in Figure 2, Refin3R first obtains two complementary reconstructions: a dense but less accurate one from a feed-forward model and a partial but accurate one from SfM. Representing both as pixel-aligned depth maps of each view (§ 3.2), it then refines the feed-forward depth on the image grid with per-pixel residuals guided by the SfM points.

Overview of Refin3R

Figure 2. Overview of Refin3R. A feed-forward model provides dense depth DffD^{\mathrm{ff}} and geometry-aware features F\mathbf{F}, and SfM provides partial but accurate depth DsfmD^{\mathrm{sfm}} (§ 3.2). For each view, a 2D U-Net refines the dense depth on the image grid, while a sparse 3D U-Net refines the SfM points of all views that project into its image, with both branches exchanging information (§ 3.3 and § 3.4). A spatial propagation network (SPN) fuses their estimates into the refined depth (§ 3.5), which is back-projected into the final point map.

The refinement is performed by a dual-branch network that takes both reconstructions along with geometry-aware features from the feed-forward backbone (§ 3.3). Its 2D branch combines the feed-forward and SfM depth of each view with these features and refines the dense depth on the image grid. In parallel, its 3D branch refines the depth at the SfM-observed pixels of the current view, leveraging the SfM points aggregated from all views in sparse voxels. The two branches exchange information (§ 3.4), and a spatial fusion stage merges their estimates across the image through iterative spatial propagation (§ 3.5). Finally, the refined depth DipredD_i^{\mathrm{pred}} is back-projected along the pixel rays of the SfM cameras to obtain the point map PiP_i of each view.

Input representation

Initial reconstructions. Following GGPT [6], we obtain two initial reconstructions. A pretrained multi-view feed-forward model, such as Depth Anything 3 (DA3) [27] or Pi3X [55], first predicts initial camera parameters and a dense depth map Diff∈RH×WD_i^{\mathrm{ff}} \in\mathbb{R}^{H \times W} for every view. Building on this prediction, an SfM pipeline establishes correspondences with RoMa v2 [12], refines the cameras (Ki,Ri,ti)(\mathbf{K}_i, \mathbf{R}_i, \mathbf{t}_i) by sparse bundle adjustment, and triangulates valid tracks by multi-view DLT [16]; see GGPT [6] for details. This yields a partial SfM depth map DisfmD_i^{\mathrm{sfm}} with a validity mask Mi∈{0,1}H×WM_i \in\{0,1\}^{H \times W} marking triangulated pixels.

Geometric inputs. We express both reconstructions as depth along the pixel rays, so that they are aligned on the image grid of each view, and parameterize depth in log space, ζ=log⁡D\zeta= \log D, which compresses its wide dynamic range [22]. Each pixel p=(u,v)p=(u,v) of view ii is then described by its ray ri(p)=Ki−1[u,v,1]⊤\mathbf{r}_i(p)=\mathbf{K}_i^{-1}[u,v,1]^\top, the feed-forward and SfM log-depths ζiff(p)\zeta_i^{\mathrm{ff}}(p) and ζisfm(p)\zeta_i^{\mathrm{sfm}}(p), and the mask Mi(p)M_i(p), where we set ζisfm(p)=0\zeta_i^{\mathrm{sfm}}(p)=0 if Mi(p)=0M_i(p)=0.

Geometry-aware image features. As in depth completion, propagating sparse geometry across an image requires dense geometric context, indicating how depth relates between neighboring pixels. We therefore reuse intermediate features of the frozen feed-forward backbone, whose multi-view transformer is trained to predict geometry and thus carries both semantic and geometric cues. We take the image tokens T∈R4×(HpWp)×Ct\mathbf{T}\in\mathbb{R}^{4\times(H_pW_p)\times C_t} from four intermediate layers of the backbone, where HpWpH_pW_p is the number of patches and CtC_t the token dimension. A DPT head [36], trained end-to-end as part of the full model, fuses and upsamples them into an image-resolution feature map F\mathbf{F}:

F=DPT⁡feat(T)∈RH×W×CF.(1)\mathbf{F}=\operatorname{DPT}_{\mathrm{feat}}(\mathbf{T})\in\mathbb{R}^{H\times W\times C_F}. \tag*{(1)}

Dual-branch refinement network

Our setting resembles depth completion, which densifies sparse depth measurements under RGB guidance [14, 64, 65], but differs in two aspects: the feed-forward depth already provides a dense initial estimate, and the partial measurements come from all views rather than the current one alone. We therefore design one branch for each: a dense 2D branch that refines the feed-forward depth on the image grid, and a sparse 3D branch that refines the SfM depth using the points of all views. Both predict residuals in log-depth space, the 2D branch on ζiff\zeta_i^{\mathrm{ff}} and the 3D branch on ζisfm\zeta_i^{\mathrm{sfm}} at the SfM-observed pixels.

2D branch. Guided by the image features F\mathbf{F}, the 2D branch U2DU_{2\mathrm{D}} propagates the partial SfM depth to pixels without any triangulated point, e.g., textureless regions or regions observed by a single view. It is a U-Net [38] built from ConvNeXt blocks [57] with six scales (stride 1 to 32). Per pixel, it takes the geometric channels:

gi(p)=[ri∥ζiff∥ζisfm∥(ζisfm−ζiff)∥Mi](p),(2)\mathbf{g}_i(p)=\left[\mathbf{r}_i\mathbin\Vert\zeta_i^{\mathrm{ff}}\mathbin\Vert\zeta_i^{\mathrm{sfm}}\mathbin\Vert\left(\zeta_i^{\mathrm{sfm}}-\zeta_i^{\mathrm{ff}}\right)\mathbin\Vert M_i\right](p), \tag*{(2)}

where ∥\mathbin\Vert denotes channel-wise concatenation. The difference ζisfm−ζiff\zeta_i^{\mathrm{sfm}}-\zeta_i^{\mathrm{ff}} (set to zero where Mi=0M_i=0) makes the discrepancy between the two reconstructions explicit, indicating how much the feed-forward depth deviates from the SfM depth.

Given gi\mathbf{g}_i and the image features Fi\mathbf{F}_i, U2DU_{2\mathrm{D}} predicts a log-depth residual Δζi2D\Delta\zeta_i^{2\mathrm{D}} and a confidence logit c^i\hat{c}_i:

(Δζi2D,c^i)=U2D([gi∥Fi]),ζi2D=ζiff+Δζi2D,(3)\left(\Delta\zeta_i^{2\mathrm{D}},\hat{c}_i\right)=U_{2\mathrm{D}}\left([\mathbf{g}_i\mathbin\Vert\mathbf{F}_i]\right),\qquad\zeta_i^{2\mathrm{D}}=\zeta_i^{\mathrm{ff}}+\Delta\zeta_i^{2\mathrm{D}}, \tag*{(3)}

where c^i\hat{c}_i is used for training supervision (Sec. 3.6).

3D branch. The 2D branch takes only the SfM depth of the current view, which holds at most one value per pixel; points occluded in this view or triangulated only from other views are thus left out, leaving the full scene geometry unexplored. Inspired by multi-view reconstruction methods that aggregate evidence in 3D space [33, 37], we introduce a 3D branch that reasons over the SfM points of all views with sparse 3D convolution to refine each view’s depth.

Following MoGe-3 [22], we construct for each view ii a voxel grid in its image coordinates and log depth at the original image resolution, so that a voxel (u,v,z)(u,v,z) corresponds to pixel (u,v)(u,v) and zz indexes its discretized log depth. We then voxelize the SfM points of all views into this grid, keeping only those that lie in front of camera ii and project inside its image. Further details, including how points are assigned to voxels, are in the supplementary material.

The 3D branch U3DU_{3\mathrm{D}} is a sparse U-Net with five levels of residual sparse 3D convolution blocks on this grid, through which each voxel aggregates features from points close to it in 3D space. For each occupied voxel mm, let pmp_m denote its pixel and ζm\zeta_m the log depth of its SfM point in view ii. As in Eq. (2), U3DU_{3\mathrm{D}} takes per voxel an input feature that combines ζm\zeta_m with the offsets of ζm\zeta_m from the feed-forward and SfM depths at pmp_m:

vm(0)=[ri(pm)∥ζm∥ζm−ζiff(pm)∥ζm−ζisfm(pm)∥Mi(pm)∥1mown],(4)\mathbf{v}_m^{(0)}=\left[\mathbf{r}_i(p_m)\mathbin\Vert\zeta_m\mathbin\Vert\zeta_m-\zeta_i^{\mathrm{ff}}(p_m)\mathbin\Vert\zeta_m-\zeta_i^{\mathrm{sfm}}(p_m)\mathbin\Vert M_i(p_m)\mathbin\Vert\mathbb{1}_m^{\mathrm{own}}\right], \tag*{(4)}

where 1mown\mathbb{1}_m^{\mathrm{own}} indicates whether mm holds a point triangulated by view ii. The two differences encode the depth of each SfM point relative to the feed-forward depth and to the pixel’s own SfM depth, respectively (the latter difference is set to zero where Mi(pm)=0M_i(p_m)=0), so that the scene geometry aggregated from all views is represented in terms of the current view.

From these features, U3DU_{3\mathrm{D}} predicts a log-depth residual and a confidence logit for every occupied voxel at the input resolution, i.e., that of vm(0)\mathbf{v}_m^{(0)}. Reading them out at the voxels with 1mown=1\mathbb{1}_m^{\mathrm{own}}=1 yields per-pixel maps on Mi=1M_i=1:

(Δζi3D,β^i)=U3D({vm(0)}m),ζi3D=ζisfm+Δζi3D.(5)\left(\Delta\zeta_i^{3\mathrm{D}},\hat{\beta}_i\right)=U_{3\mathrm{D}}\left(\{\mathbf{v}_m^{(0)}\}_m\right),\qquad\zeta_i^{3\mathrm{D}}=\zeta_i^{\mathrm{sfm}}+\Delta\zeta_i^{3\mathrm{D}}. \tag*{(5)}

The confidence βi=σ(β^i)\beta_i=\sigma(\hat{\beta}_i), where σ\sigma is the sigmoid function, is used in Sec. 3.5.

Bidirectional 2D–3D interaction

The two branches are complementary: the 2D branch uses image features to propagate depth to pixels without SfM points, whereas the 3D branch holds multi-view evidence that the image grid alone cannot represent, such as SfM points triangulated without correspondences in view ii. We let them exchange information in their encoders at two coarse scales, ℓ∈{3,4}\ell\in\{3,4\} (stride 8 and 16), where both branches have the same feature width. Denoting by Xi(ℓ)\mathbf{X}_i^{(\ell)} the 2D feature map of view ii and by V(ℓ)\mathbf{V}^{(\ell)} the voxel features of its grid at scale ℓ\ell, each exchange proceeds as:

X(l)←Enc⁡2D(l)(X(l−1)),X^{(l)} \leftarrow\operatorname{Enc}_{2D}^{(l)}\left(X^{(l-1)}\right),
V(l)←Blocks⁡3D(l)(Inject⁡l(V(l),X(l))),V^{(l)} \leftarrow\operatorname{Blocks}_{3D}^{(l)}\left(\operatorname{Inject}_{l}\left(V^{(l)},X^{(l)}\right)\right),
X(l)←X(l)+Gather⁡l(X(l),V(l)),(6)X^{(l)} \leftarrow X^{(l)}+\operatorname{Gather}_{l}\left(X^{(l)},V^{(l)}\right), \tag*{(6)}

where Enc⁡2D(l)\operatorname{Enc}_{2D}^{(l)} is the scale-ll encoder stage of U2DU_{2D}, Blocks⁡3D(l)\operatorname{Blocks}_{3D}^{(l)} are the sparse convolution blocks of U3DU_{3D} at the same scale, and Inject⁡l\operatorname{Inject}_{l} and Gather⁡l\operatorname{Gather}_{l} are the two exchange operations detailed below.

Since both branches halve the image axes at each scale, the 2D feature map and the voxel grid at scale ll share the same image grid, downsampled by 2l2^{l}. Every voxel mm thus lies at a pixel pmp_m of this grid, and we call the set of voxels corresponding to a pixel pmp_m its column. In the 2D→3D direction (Inject), voxels in a column receive the image feature at its pixel, Xi(l)(pm)X_i^{(l)}(p_m), by a direct lookup. In the 3D→2D direction (Gather), Xi(l)(p)X_i^{(l)}(p) receives a single feature reduced from the voxel features in its column.

2D→3D injection. Each voxel feature vm(l)v_m^{(l)} is concatenated with the image feature at the corresponding pixel, Xi(l)(pm)X_i^{(l)}(p_m), providing image context absent from the 3D branch’s input:

vm(l)←MLP⁡([vm(l)∥Xi(l)(pm)]).(7)v_m^{(l)} \leftarrow\operatorname{MLP}\left([v_m^{(l)} \mathbin{\|} X_i^{(l)}(p_m)]\right). \tag*{(7)}

All voxel features in a pixel column receive the same image feature (Figure 3 top).

Bidirectional 2D–3D interaction

Figure 3. Bidirectional 2D–3D interaction. The 2D feature map of each view and the voxel features of its grid exchange information along pixel columns. Top: In 2D→3D injection, the image feature of each pixel is broadcast to all occupied voxels in its column, providing the 3D branch with image context. Bottom: In 3D→2D gathering, the voxel features in each column are average-pooled along the depth axis and fused into the image feature map, providing multi-view evidence back to the 2D branch. Only voxels containing points of the current view (blue) are pooled, while those formed solely by points of other views (red) are excluded.

3D→2D gathering. The voxel features contain multi-view 3D information, aggregated from the SfM points of all views. We provide this information to the 2D branch by reducing each column to a single feature at a pixel (Figure 3 bottom). Since the 2D branch operates on the image of view ii, we use only the voxels relevant to this view. Specifically, we extend 1own\mathbb{1}^{\mathrm{own}} to scale ll by marking a voxel as own if it contains at least one own voxel at the input resolution (blue in Figure 3 bottom), and exclude voxels that contain only other views’ voxels (red in Figure 3 bottom).

The own voxels in each column are then average-pooled along the depth axis:

qp=1∣Zp∣∑m∈Zpvˉm(l),Zp={m:pm=p, 1mown=1},(8)\mathbf{q}_p=\frac{1}{\lvert\mathcal{Z}_p\rvert}\sum_{m\in\mathcal{Z}_p}\bar{\mathbf{v}}_m^{(l)},\qquad\mathcal{Z}_p=\{m:p_m=p,\ \mathbb{1}^{\mathrm{own}}_m=1\}, \tag*{(8)}

where vˉ\bar{\mathbf{v}} denotes layer-normalized voxel features, and qp=0\mathbf{q}_p=0 if Zp\mathcal{Z}_p is empty. The pooled feature qp\mathbf{q}_p is then concatenated with the image feature Xi(l)(p)X_i^{(l)}(p), fed into an MLP, and added to it as a residual:

Xi(l)(p)←Xi(l)(p)+MLP⁡([Xi(l)(p)∥qp]).(9)X_i^{(l)}(p)\leftarrow X_i^{(l)}(p)+\operatorname{MLP}\left([X_i^{(l)}(p)\mathbin{\|}\mathbf{q}_p]\right). \tag*{(9)}

Spatial fusion

The two branches provide two refined depth estimates: a dense one from the 2D branch and, on SfM-observed pixels, one from the 3D branch. Fusing them per pixel would mix the two only where both exist, so the 3D-branch depth would refine only the SfM-observed pixels without affecting their neighbors. We therefore employ spatial propagation [7], which iteratively updates a dense depth map with learned, content-dependent neighbor weights to mix the two estimates adaptively across the entire image.

Specifically, we adapt the dynamic variant [28] and propagate in linear depth, D=exp⁡ζD=\exp\zeta. On SfM-observed pixels, the confidence βi\beta_i of Eq. (5) blends the SfM and 3D-branch depths into an anchor, ai=(1−βi)Disfm+βiDi3Da_i=(1-\beta_i)D_i^{\mathrm{sfm}}+\beta_iD_i^{3D}. The 2D branch is equipped with a second decoder, which shares the encoder after the 2D–3D interaction and predicts the propagation parameters: affinities wt,kw_{t,k} and offsets ot,ko_{t,k} over K=5K=5 neighbors for each round tt, and an anchoring weight ηi\eta_i set to zero where no SfM observation exists. Starting from Di(0)=Di2DD_i^{(0)}=D_i^{2D}, each of the TT rounds updates:

Di(t)(p)=(1−ηi)∑k=1Kwt,kDi(t−1)(p+ot,k)+ηiai,(10)D_i^{(t)}(p)=(1-\eta_i)\sum_{k=1}^{K}w_{t,k}D_i^{(t-1)}(p+o_{t,k})+\eta_i a_i, \tag*{(10)}

where ηi\eta_i, aia_i, wt,kw_{t,k}, and ot,ko_{t,k} are taken at pp, and wt,⋅w_{t,\cdot} is normalized by a softmax over the KK neighbors. After T=6T=6 rounds, Dipred=Di(T)D_i^{\mathrm{pred}}=D_i^{(T)} gives the refined depth, which is back-projected with the SfM cameras to obtain the point map PiP_i.

Training objectives

We supervise the outputs of the 2D branch, the 3D branch, and the propagation. For the dense outputs, we use the confidence-weighted loss of [6, 52] with the depth error,

Lconf(D,c)=1∣Ωi∣∑p∈Ωic(p)∣D(p)−Dgt(p)∣−αlog⁡c(p),(11)\mathcal{L}_{\mathrm{conf}}(D,c)=\frac{1}{|\Omega_i|}\sum_{p\in\Omega_i}c(p)\left|D(p)-D^{\mathrm{gt}}(p)\right|-\alpha\log c(p), \tag*{(11)}

where Ωi\Omega_i is the set of pixels with valid ground truth, ci=1+exp⁡(c^i)≥1c_i=1+\exp(\hat{c}_i)\ge1 is the confidence obtained from the logit of Eq. (3), and α=0.2\alpha=0.2 balances the regularizer. The 3D branch is supervised only at the view’s own SfM pixels with a plain L1 loss, L3D=1∣Ωi∩Mi∣∑p∈Ωi∩Mi∣Di3D(p)−Digt(p)∣\mathcal{L}_{3D}=\frac{1}{|\Omega_i\cap M_i|}\sum_{p\in\Omega_i\cap M_i}|D_i^{3D}(p)-D_i^{\mathrm{gt}}(p)|, without confidence. The total loss is

L=Lconf(Dipred,ci)+λ2DLconf(Di2D,ci)+λ3DL3D,(12)\mathcal{L}=\mathcal{L}_{\mathrm{conf}}(D_i^{\mathrm{pred}},c_i)+\lambda_{2D}\mathcal{L}_{\mathrm{conf}}(D_i^{2D},c_i)+\lambda_{3D}\mathcal{L}_{3D}, \tag*{(12)}

where the first term supervises the final output, and the second keeps a gradient on the 2D-branch depth from which the propagation starts.

Experiments

Implementation details

Inputs and architecture. For both training and evaluation, we obtain the initial reconstructions from a feed-forward backbone, either DA3 [27] or Pi3X [55], and the SfM pipeline of GGPT [6] (§ 3.2); we report results for both versions, each trained separately. The 2D branch follows the U-Net of PacGDC [47], the DPT head follows the architecture of the DA3 depth head, and the 3D branch follows the sparse U-Net of MoGe-3 [22].

Training. We train on the training splits of ScanNet++ [61], TartanAir v2 [53, 63], UnrealStereo4K [44], and BlendedMVS [60], all of which provide dense ground-truth depth and camera poses. Following MapAnything [20], we sample multi-view sets via a covisibility-constrained random walk, with 4–16 views for ScanNet++, 4–8 views for TartanAir v2 and UnrealStereo4K, and 3–6 for BlendedMVS. We train for 200K iterations on 4 NVIDIA RTX A6000 GPUs using AdamW [31] with a learning rate of 10−410^{-4} and weight decay 0.05. The learning rate is linearly warmed up over the first 2K iterations and then cosine-decayed to 10−510^{-5}. Further architectural and training details are in the supplementary material.

Evaluation protocol

Datasets. Following GGPT [6], we evaluate on ScanNet++ [61], ETH3D [42], and Tanks&Temples [21], each with 4-, 8-, and 16-view splits. Since ScanNet++ is part of our training data, we refer to it as within-domain, and to ETH3D and Tanks&Temples as cross-domain. We further evaluate on two out-of-domain datasets whose appearance and geometry differ substantially from the training data: 4D-DRESS [54], rendered from high-resolution scans of clothed humans, and MV-dVRK [4], photorealistic renderings of robotic abdominal surgery.

Metrics. We evaluate point map accuracy with the area under the accuracy curve (AUC) at several error thresholds. We align each predicted point map to the metric ground truth with robust Umeyama alignment [46] implemented in pycolmap [40], and measure the Euclidean error between each predicted point and its ground-truth counterpart.

Baselines. We compare against four groups of methods. For fairness, all methods that take geometric priors receive the same SfM output as ours. (1) Feed-forward models: DA3 [27], Pi3X (RGB only) [55], and VGGT-Ω [51], which take only images as input. (2) Geometry-conditioned feed-forward models: MapAnything [20] and Pi3X, conditioned on our SfM cameras and the per-view SfM depth DisfmD_i^{\mathrm{sfm}} (§ 3.2). (3) Depth completion: Murre [14] and Any2Full [64], which complete DisfmD_i^{\mathrm{sfm}} of each view independently; the results are back-projected with the SfM cameras into a global point map. (4) Feed-forward reconstruction with multi-view geometry: MASt3R-SfM [9] and BLAst3R [26], which run their own pipelines to jointly optimize cameras and dense depth using correspondences and depth priors, and GGPT [6], which refines the feed-forward point maps with the SfM points in 3D. We apply GGPT to the same DA3 and Pi3X initial reconstructions as ours.

Results

We summarize the main results below. Additional qualitative examples and detailed quantitative results are provided in the supplementary material.

Within- and cross-domain evaluation. Table 1 compares Refin3R with the baselines on ScanNet++, ETH3D, and Tanks&Temples. Refin3R achieves the best accuracy across all benchmarks and, with either backbone, consistently outperforms GGPT applied to the same initial reconstructions. Geometry-conditioned models such as Pi3X also benefit from the same SfM priors but remain far behind Refin3R.

ScanNet++ [61]ETH3D [42]T&T [21]
4 imgs8 imgs16 imgs4 imgs8 imgs16 imgs4 imgs8 imgs16 imgs
Feed-forward
Depth Anything 3 [27]1.6/8.80.9/7.10.6/4.78.9/31.98.0/29.67.0/27.11.1/8.70.7/7.10.5/6.3
Pi3X (RGB only) [55]14.7/50.415.3/53.914.3/54.89.8/34.86.1/28.84.8/26.45.1/25.23.9/23.53.4/22.7
VGGT-Ω\Omega [51]2.1/16.31.3/13.51.0/11.94.1/25.63.1/22.22.2/17.22.0/16.01.5/14.60.9/9.9
Geometry-conditioned Feed-forward
MapAnything [20]15.6/43.913.3/43.812.5/42.06.8/27.36.3/25.05.3/25.23.4/18.72.5/15.12.2/14.7
Pi3X [55]17.3/52.118.2/55.518.3/58.315.6/43.712.9/40.010.2/37.98.9/33.68.1/34.96.4/30.7
Depth completion
Any2Full [64]22.9/50.028.6/59.632.0/65.124.8/49.328.5/55.430.4/58.912.1/34.413.1/42.113.9/42.7
Murre [14]16.6/44.121.3/53.123.9/57.413.0/34.413.6/35.415.2/38.75.5/22.26.6/25.77.7/28.2
Feed-forward w/ multi-view geometry
MASt3R-SfM [9]11.5/30.815.6/41.018.9/49.215.0/37.417.5/37.716.7/39.014.9/35.118.2/41.617.7/41.4
BLASt3R [26]27.8/57.134.5/64.739.2/67.511.7/31.213.6/34.914.2/38.44.1/19.15.2/22.75.0/22.8
GGPT (w/ DA3) [6]21.6/45.027.4/56.931.8/64.527.7/56.228.4/58.732.6/64.414.9/36.916.0/46.116.0/47.1
GGPT (w/ Pi3X) [6]25.6/56.729.5/62.834.8/67.831.7/60.032.7/62.039.4/69.116.1/38.519.1/49.719.7/49.4
Refin3R (w/ DA3) (Ours)31.5/60.637.5/68.843.4/74.042.7/67.346.4/69.953.6/76.115.6/40.320.5/52.121.8/53.1
Refin3R (w/ Pi3X) (Ours)33.7/65.639.6/71.445.2/75.743.1/67.646.3/70.253.3/76.417.1/39.721.5/52.022.4/52.3

Table 1. Multi-view 3D reconstruction on standard test sets. We report AUC@1/5 cm (% ↑). ScanNet++ is within-domain, and ETH3D and Tanks&Temples are cross-domain. The best and second-best results for each metric within each dataset are shown in bold and _underline_, respectively.

Out-of-domain evaluation. Table 2 reports results on 4D-DRESS and MV-dVRK, whose appearance and geometry differ substantially from the training data. While the feed-forward backbones largely fail on these scenes, Refin3R achieves the best results on both datasets, with the largest margins at the strictest threshold. VGGT-Ω is competitive at the loose threshold on 4D-DRESS, likely owing to human-centric training data [3], yet falls far behind Refin3R at the 1 cm threshold.

4D-DRESS [54]MV-dVRK [4]
@1 cm@5 cm@1 mm@5 mm
Feed-forward
Depth Anything 32.16.317.250.7
Pi3X (RGB only)3.611.83.921.1
VGGT-Ω42.081.617.754.0
Geometry-conditioned Feed-forward
MapAnything7.229.832.269.1
Pi3X45.776.933.865.2
Depth completion
Any2Full63.279.765.3<u>84.1</u>
Murre48.574.159.581.7
Feed-forward w/ multi-view geometry
MASt3R-SfM51.170.143.964.6
BLASt3R13.939.624.650.8
GGPT (w/ DA3)50.771.267.083.1
GGPT (w/ Pi3X)64.682.162.676.6
Refin3R (w/ DA3) (Ours)<u>75.1</u><u>83.6</u>72.387.4
Refin3R (w/ Pi3X) (Ours)80.289.6<u>68.9</u>83.7

Table 2. Out-of-domain evaluation. AUC (%) on 4D-DRESS and MV-dVRK, with thresholds in centimeters and millimeters, respectively. The best and second-best results for each metric within each dataset are shown in bold and <u>underline</u>, respectively.

Qualitative comparison. Figure 4 compares point error maps of Refin3R and the baselines on all datasets. Refin3R keeps the accuracy of the SfM points while refining regions they do not cover, such as textureless surfaces and single-view regions, where the baselines retain large errors.

Qualitative comparison of reconstructions across ScanNet++, ETH3D, Tanks&Temples, 4D-DRESS, and MV-dVRK

Figure 4. Qualitative comparison. Each row shows one example from ScanNet++, ETH3D, Tanks&Temples, 4D-DRESS, and MV-dVRK, with only one input view visualized. We compare a feed-forward model using only images (DA3), monocular depth completion (Any2Full), a geometry-conditioned model (Pi3X), and feed-forward methods with multi-view geometry (BLASt3R, GGPT), where Any2Full, Pi3X, and GGPT use the same SfM prior as ours. AUC@10 (cm; mm for MV-dVRK) is shown in each reconstruction.

Ablation study

Table 3 ablates Refin3R on ScanNet++ and ETH3D. Rows (a)–(c) add one component at a time, and the last two rows compare how the 3D-branch depth reaches the output. All variants use DA3 and share the same training setting.

ScanNet++ETH3D
@1 / @5 / @10↑@1 / @5 / @10↑
Feed-forward (DA3)1.0 / 6.9 / 15.18.0 / 29.5 / 43.6
GGPT (w/ DA3)27.0 / 55.5 / 67.529.5 / 59.8 / 71.0
(a) 2D branch, geometry only34.3 / 64.7 / 76.642.8 / 67.4 / 76.3
(b) + image features35.4 / 66.3 / 77.944.7 / 68.8 / 77.2
(c) + 3D branch & interaction36.7 / 67.2 / 78.446.2 / 69.7 / 77.9
+ hard substitution†37.1 / 67.5 / 78.646.7 / 70.3 / 78.5
(d) + Spatial fusion (Refin3R)37.5 / 67.8 / 78.947.6 / 71.1 / 79.1

Table 3. Ablation study. AUC (%) at 1, 5, and 10 cm on ScanNet++ and ETH3D, averaged over the 4-, 8-, and 16-view splits. Rows (a)–(c) add one component at a time, and the last two rows compare how the depth of the 3D branch reaches the output on top of (c). †Applied at test time only, without retraining.

Image-grid refinement. Refining the feed-forward depth on the image grid from the geometric channels of Eq. (2) alone (a) already outperforms GGPT by a large margin, showing the benefit of refining on the image grid rather than as points in 3D. Adding the backbone features (b) further improves accuracy, as they provide geometric cues where the SfM depth alone is insufficient.

Bidirectional interaction. Adding the 3D branch with bidirectional interaction (c) brings consistent gains on both datasets. Since the 3D-branch depth is used only for supervision in this variant, these gains come solely from the feature exchange, which provides the 2D branch with multi-view evidence beyond the view’s own SfM depth.

Spatial fusion. Substituting the 3D-branch depth on SfM-observed pixels at test time already helps, confirming that the 3D branch refines these pixels more accurately than the 2D branch. However, hard substitution trusts every triangulated pixel equally and leaves its neighbors untouched. Spatial fusion (d) instead anchors this depth with learned confidence and propagates it through learned affinities, yielding the best results.

Efficiency

Table 4 reports the inference time and peak GPU memory on ETH3D. Since all methods in the table receive the same SfM front-end output, we report only the time of each method itself; ours and Any2Full process the views in batches of four. Among them, Refin3R is the fastest at every view count, 2.2× faster than Pi3X and 15× faster than GGPT with 16 views. Our main numbers exclude the DA3 encoder, which already runs to obtain the SfM priors; even including it, Refin3R remains the fastest.

Method4 views8 views16 views16 views
Any2Full0.781.583.175.0
MapAnything0.701.372.7612.3
Pi3X0.460.881.8810.9
GGPT4.367.2012.926.2
Ours0.170.390.86<u>5.1</u>
Ours + DA3 Backbone<u>0.35</u><u>0.73</u><u>1.58</u>9.8

Table 4. Efficiency. Inference time and peak GPU memory on ETH3D, measured on an NVIDIA RTX A6000. The last row includes the DA3 encoder.

Conclusion

We presented Refin3R, which refines feed-forward 3D reconstructions on the image grid of each view, guided by the SfM points of all views aggregated in 3D. Its dual-branch architecture couples dense image features with multi-view SfM evidence through bidirectional interaction, and spatial fusion propagates the refined geometry across the whole image. Refin3R achieves state-of-the-art accuracy on standard and out-of-domain benchmarks, consistently outperforming feed-forward and geometry-guided methods while adding little overhead to the SfM front-end.

References

  1. [1]Sameer Agarwal, Noah Snavely, Ian Simon, Steven M. Seitz, and Richard Szeliski. Building rome in a day. In 2009 IEEE 12th International Conference on Computer Vision, pages 72–79, 2009.
  2. [2]Paul A. Beardsley, Philip H. S. Torr, and Andrew Zisserman. 3d model acquisition from extended image sequences. In ECCV, 1996.DOI
  3. [3]Michael J. Black, Priyanka Patel, Joachim Tesch, and Jinlong Yang. BEDLAM: A synthetic dataset of bodies exhibiting detailed lifelike animated motion. In Proceedings of the IEEE/CVF Conf. on Computer Vision and Pattern Recognition (CVPR), pages 8726–8737, 2023.
  4. [4]Guido Cacciamiga, Sergey Prokudin, Yutong Chen, Bernard Javot, Rachael L’Orsa, Omer Burak Aladağ, Yarden Sharon, Jens Rolinger, Ivan Capobianco, Anton Deguet, et al. Mv-dvrk: A multi-viewpoint benchmark for spatial surgical perception. arXiv preprint arXiv:2609.02717, 2026.
  5. [5]Ruoqin Cai, Joseph Tung, Qianqian Wang, Hadar Averbuch-Elor, Bharath Hariharan, and Noah Snavely. Doppelgangers: Learning to disambiguate images of similar structures. In 2023 IEEE/CVF International Conference on Computer Vision (ICCV), pages 34–44. IEEE, 2023.
  6. [6]Yutong Chen, Yiming Wang, Xucong Zhang, Sergey Prokudin, and Siyu Tang. Ggpt: Geometry grounded point transformer. arXiv preprint arXiv:2603.11174, 2026.arxiv.org/abs/2603.11174
  7. [7]Xinjing Cheng, Peng Wang, and Ruigang Yang. Learning depth with convolutional spatial propagation network. IEEE transactions on pattern analysis and machine intelligence, 42(10):2361–2379, 2019.
  8. [8]Daniel DeTone, Tomasz Malisiewicz, and Andrew Rabinovich. Superpoint: Self-supervised interest point detection and description. In 2018 IEEE/CVF conference on computer vision and pattern recognition workshops (CVPRW), pages 337–33712. IEEE, 2018.
  9. [9]Bardienus Pieter Duisterhof, Lojze Zust, Philippe Weinzaepfel, Vincent Leroy, Yohann Cabon, and Jerome Revaud. Mast3r-sfm: a fully-integrated solution for unconstrained structure-from-motion. In 2025 International Conference on 3D Vision (3DV), pages 1–10. IEEE, 2025.
  10. [10]Johan Edstedt, Ioannis Athanasiadis, Mårten Wadenbäck, and Michael Felsberg. Dkm: Dense kernelized feature matching for geometry estimation. In 2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pages 17765–17775. IEEE, 2023.
  11. [11]Johan Edstedt, Qiyu Sun, Georg Bö̏kman, Mårten Wadenbäck, and Michael Felsberg. Roma: Robust dense feature matching. In 2024 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pages 19790–19800. IEEE, 2024.DOI
  12. [12]Johan Edstedt, David Nördström, Yushan Zhang, Georg Bö̏kman, Jonathan Astermark, Viktor Larsson, Anders Heyden, Fredrik Kahl, Mårten Wadenbäck, and Michael Felsberg. Roma v2: Harder better faster denser feature matching. In European Conference on Computer Vision, pages 664–682. Springer, 2026.
  13. [13]Andrew William Fitzgibbon and Andrew Zisserman. Automatic camera recovery for closed or open image sequences. In ECCV, 1998.
  14. [14]Haoyu Guo, He Zhu, Sida Peng, Haotong Lin, Yunzhi Yan, Tao Xie, Wenguan Wang, Xiaowei Zhou, and Hujun Bao. Multi-view reconstruction via sfm-guided monocular depth estimation. In 2025 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pages 5272–5282. IEEE, 2025.
  15. [15]Richard Hartley and Andrew Zisserman. Multiple View Geometry in Computer Vision. Cambridge University Press, New York, NY, USA, 2 edition, 2003.
  16. [16]Richard I Hartley and Peter Sturm. Triangulation. Computer vision and image understanding, 68(2):146–157, 1997.
  17. [17]Xingyi He, Jiaming Sun, Yifan Wang, Sida Peng, Qixing Huang, Hujun Bao, and Xiaowei Zhou. Detector-free structure from motion. In 2024 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pages 21594–21603. IEEE, 2024.arxiv.org/abs/2306.15669
  18. [18]Jared Heinly, Johannes L. Schönberger, Enrique Dunn, and Jan-Michael Frahm. Reconstructing the world in six days. In 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pages 3287–3295, 2015.
  19. [19]Wonbong Jang, Philippe Weinzaepfel, Vincent Leroy, Lourdes Agapito, and Jerome Revaud. Pow3r: Empowering unconstrained 3d reconstruction with camera and scene priors. In 2025 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pages 1071–1081. IEEE, 2025.
  20. [20]Nikhil Keetha, Norman Müller, Johannes Schönberger, Lorenzo Porzi, Yuchen Zhang, Tobias Fischer, Arno Knapitsch, Duncan Zauss, Ethan Weber, Nelson Antunes, et al. Mapanything: Universal feed-forward metric 3d reconstruction; map-anything. github. io. In 2026 International Conference on 3D Vision (3DV), pages 499–509. IEEE, 2026.
  21. [21]Arno Knapitsch, Jaesik Park, Qian-Yi Zhou, and Vladlen Koltun. Tanks and temples: Benchmarking large-scale scene reconstruction. ACM Transactions on Graphics (ToG), 36(4):1–13, 2017.
  22. [22]Lingyu Kong, Ruilcheng Li, Ruilcheng Wang, Sicheng Xu, Chengtang Yao, Jianfeng Xiang, and Jiaolong Yang. Moge-3: Fine-detail monocular geometry estimation with self-guided sparse volumetric refinement. arXiv e-prints, pages arXiv–2607, 2026.
  23. [23]JongMin Lee and Sungjoo Yoo. Dense-sfm: Structure from motion with dense consistent matching. In 2025 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pages 6404–6414. IEEE, 2025.
  24. [24]Jongmin Lee, Seungyeop Kang, and Sungjoo Yoo. Mv-roma: From pairwise matching into multi-view track reconstruction. arXiv preprint arXiv:2603.27542, 2026.
  25. [25]Vincent Leroy, Yohann Cabon, and Jérôme Revaud. Grounding image matching in 3d with mast3r. In European conference on computer vision, pages 71–91. Springer, 2024.
  26. [26]Vincent Leroy, Philippe Weinzaepfel, Lojze Zust, Yohann Cabon, and Jérôme Revaud. Blast3r: Bundle adjustment of any image set with multi-view matching and monocular priors. In European Conference on Computer Vision, pages 641–662. Springer, 2026. 2, 3, 6, 7
  27. [27]Haotong Lin, Sili Chen, Junhao Liew, Donny Y Chen, Zhenyu Li, Guang Shi, Jiashi Feng, and Bingyi Kang. Depth anything 3: Recovering the visual space from any views. arXiv preprint arXiv:2511.10647, 2025. 1, 2, 3, 6, 7arxiv.org/abs/2511.10647
  28. [28]Yuankai Lin, Tao Cheng, Qi Zhong, Wending Zhou, and Hua Yang. Dynamic spatial propagation network for depth completion. In Proceedings of the aaai conference on artificial intelligence, pages 1638–1646, 2022. 5
  29. [29]Philipp Lindenberger, Paul-Edouard Sarlin, Viktor Larsson, and Marc Pollefeys. Pixel-perfect structure-from-motion with featuremetric refinement. In 2021 IEEE/CVF International Conference on Computer Vision (ICCV), pages 5967–5977. IEEE, 2021. 2
  30. [30]Philipp Lindenberger, Paul-Edouard Sarlin, and Marc Pollefeys. Lightglue: Local feature matching at light speed. In Proceedings of the IEEE/CVF international conference on computer vision, pages 17627–17638, 2023. 2arxiv.org/abs/2306.13643
  31. [31]Ilya Loshchilov, Frank Hutter, et al. Fixing weight decay regularization in adam. arXiv preprint arXiv:1711.05101, 5(5):5, 2017. 6
  32. [32]Roger Mohr, Long Quan, and Francoise Veillon. Relative 3d reconstruction using multiple uncalibrated images. The International Journal of Robotics Research, 1993. 2
  33. [33]Zak Murez, Tarren Van As, James Bartolozzi, Ayan Sinha, Vijay Badrinarayanan, and Andrew Rabinovich. Atlas: End-to-end 3d scene reconstruction from posed images. In European conference on computer vision, pages 414–431. Springer, 2020. 4arxiv.org/abs/2003.10432
  34. [34]Zador Pataki, Paul-Edouard Sarlin, Marc Pollefeys, and Johannes L Schönberger. Global structure-from-motion revisited. In European Conference on Computer Vision, pages 58–77. Springer, 2024. 2
  35. [35]Zador Pataki, Paul-Edouard Sarlin, Johannes L Schönberger, and Marc Pollefeys. Mp-sfm: Monocular surface priors for robust structure-from-motion. In 2025 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pages 21891–21901. IEEE, 2025. 2arxiv.org/abs/2504.20040
  36. [36]René Ranftl, Alexey Bochkovskiy, and Vladlen Koltun. Vision transformers for dense prediction. In 2021 IEEE/CVF International Conference on Computer Vision (ICCV), pages 12159–12168. IEEE, 2021. 4arxiv.org/abs/2103.13413
  37. [37]Alexander Rich, Noah Stier, Pradeep Sen, and Tobias Höllerer. 3dnet: Multi-view depth prediction and volumetric refinement. In 2021 International Conference on 3D Vision (3DV), pages 700–709. IEEE, 2021. 4
  38. [38]Olaf Ronneberger, Philipp Fischer, and Thomas Brox. U-net: Convolutional networks for biomedical image segmentation. In International Conference on Medical image computing and computer-assisted intervention, pages 234–241. Springer, 2015. 4arxiv.org/abs/1505.04597
  39. [39]Paul-Edouard Sarlin, Daniel DeTone, Tomasz Malisiewicz, and Andrew Rabinovich. Superglue: Learning feature matching with graph neural networks. In 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pages 4937–4946. IEEE, 2020. 2arxiv.org/abs/1911.11763
  40. [40]Johannes L Schonberger and Jan-Michael Frahm. Structure-from-motion revisited. In Proceedings of the IEEE conference on computer vision and pattern recognition, pages 4104–4113, 2016. 2, 6DOI
  41. [41]Johannes L Schönberger, Enliang Zheng, Jan-Michael Frahm, and Marc Pollefeys. Pixelwise view selection for unstructured multi-view stereo. In European conference on computer vision, pages 501–518. Springer, 2016. 2DOI
  42. [42]Thomas Schöps, Johannes L. Schönberger, Silvano Galliani, Torsten Sattler, Konrad Schindler, Marc Pollefeys, and Andreas Geiger. A multi-view stereo benchmark with high-resolution images and multi-camera videos. In 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pages 2538–2547, 2017. 6, 7DOI
  43. [43]Jiaming Sun, Zehong Shen, Yuang Wang, Hujun Bao, and Xiaowei Zhou. Loftr: Detector-free local feature matching with transformers. arXiv preprint arXiv:2104.00680, 2021. 2arxiv.org/abs/2104.00680
  44. [44]Fabio Tosi, Yiyi Liao, Carolin Schmitt, and Andreas Geiger. Smd-nets: Stereo mixture density networks. In Conference on Computer Vision and Pattern Recognition (CVPR), 2021. 6arxiv.org/abs/2104.03866
  45. [45]Bill Triggs, Philip F. McLauchlan, Richard I. Hartley, and Andrew W. Fitzgibbon. Bundle adjustment — a modern synthesis. In Vision Algorithms: Theory and Practice, pages 298–372, Berlin, Heidelberg, 2000. Springer Berlin Heidelberg. 3DOI
  46. [46]Shinji Umeyama. Least-squares estimation of transformation parameters between two point patterns. IEEE Transactions on pattern analysis and machine intelligence, 13(4):376–380, 1991. 6DOI
  47. [47]Haotian Wang, Aoran Xiao, Xiaoqin Zhang, Meng Yang, and Shijian Lu. Pagcd: Label-efficient generalizable depth completion with projection ambiguity and consistency. In 2025 IEEE/CVF International Conference on Computer Vision (ICCV), pages 7709–7720. IEEE, 2025. 3, 6arxiv.org/abs/2507.07374
  48. [48]Haotian Wang, Meng Yang, Xinhu Zhou, and Gang Hua. Scale propagation network for generalizable depth completion. IEEE Transactions on Pattern Analysis and Machine Intelligence, 47(3):1908–1922, 2025. 3arxiv.org/abs/2410.18408
  49. [49]Jianyuan Wang, Nikita Karaev, Christian Rupprecht, and David Novotny. Vggsfm: Visual geometry grounded deep structure from motion. In 2024 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pages 21686–21697. IEEE, 2024. 2DOI
  50. [50]Jianyuan Wang, Minghao Chen, Nikita Karaev, Andrea Vedaldi, Christian Rupprecht, and David Novotny. Vggt: Visual geometry grounded transformer. In 2025 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pages 5294–5306. IEEE, 2025. 1, 2, 3arxiv.org/abs/2503.11651
  51. [51]Jianyuan Wang, Minghao Chen, Shangzhan Zhang, Nikita Karaev, Johannes Schönberger, Patrick Labatut, Piotr Bojanowski, David Novotny, Andrea Vedaldi, and Christian Rupprecht. VGGT-Ω. arXiv preprint arXiv:2605.15195, 2026. 1, 2, 6, 7
  52. [52]Shuzhe Wang, Vincent Leroy, Yohann Cabon, Boris Chidlovskii, and Jerome Revaud. Dust3r: Geometric 3d vi sion made easy. In 2024 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pages 20697–20709. IEEE, 2024. 1, 2, 6
  53. [53]Wenshan Wang, Delong Zhu, Xiangwei Wang, Yaoyou Hu, Yuheng Qiu, Chen Wang, Yafei Hu, Ashish Kapoor, and Sebastian Scherer. TartanAir: A dataset to push the limits of visual slam. In 2020 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), pages 4909–4916. IEEE, 2020. 6arxiv.org/abs/2003.14338
  54. [54]Wenbo Wang, Hsuan-JI Ho, Chen Guo, Boxiang Rong, Artur Grigorev, Jie Song, Juan Jose Zarate, and Otmar Hilliges. 4d-dress: A 4d dataset of real-world human clothing with semantic annotations. In 2024 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pages 550–560. IEEE, 2024. 6, 8arxiv.org/abs/2404.18630
  55. [55]Yifan Wang, Jianjun Zhou, Haoyi Zhu, Wenzheng Chang, Yang Zhou, Zizun Li, Junyi Chen, Jiangmiao Pang, Chunhua Shen, and Tong He. $\pi^3$: Permutation-equivariant visual geometry learning. In International Conference on Learning Representations, pages 10481–10497, 2026. 1, 2, 3, 6, 7
  56. [56]Zehan Wang, Siyu Chen, Lihe Yang, Jialei Wang, Ziang Zhang, Hengshuang Zhao, and Zhou Zhao. Depth anything with any prior. arXiv preprint arXiv:2505.10565, 2025. 3arxiv.org/abs/2505.10565
  57. [57]Sanghyun Woo, Shoubhik Debnath, Ronghang Hu, Xinlei Chen, Zhuang Liu, In So Kweon, and Saining Xie. Convnext v2: Co-designing and scaling convnets with masked autoencoders. In 2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pages 16133–16142. Ieee, 2023. 4arxiv.org/abs/2301.00808
  58. [58]Changchang Wu. Towards linear-time incremental structure from motion. In 2013 International Conference on 3D Vision - 3DV 2013, pages 127–134, 2013. 2DOI
  59. [59]Xiaoyang Wu, Li Jiang, Peng-Shuai Wang, Zhijian Liu, Xin-hui Liu, Yu Qiao, Wanli Ouyang, Tong He, and Hengshuang Zhao. Point transformer v3: Simpler, faster, stronger. In 2024 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pages 4840–4851. IEEE, 2024. 3
  60. [60]Yao Yao, Zixin Luo, Shiwei Li, Jingyang Zhang, Yufan Ren, Lei Zhou, Tian Fang, and Long Quan. Blendedmvs: A large-scale dataset for generalized multi-view stereo networks. Computer Vision and Pattern Recognition (CVPR), 2020. 6arxiv.org/abs/1911.10127
  61. [61]Chandan Yeshwanth, Yueh-Cheng Liu, Matthias Nießner, and Angela Dai. Scannet++: A high-fidelity dataset of 3d indoor scenes. In 2023 IEEE/CVF International Conference on Computer Vision (ICCV), pages 12–22. IEEE, 2023. 6, 7arxiv.org/abs/2308.11417
  62. [62]Youmin Zhang, Xianda Guo, Matteo Poggi, Zheng Zhu, Guan Huang, and Stefano Mattoccia. Completionformer: Depth completion with convolutions and vision transformers. In 2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pages 18527–18536. IEEE, 2023. 3arxiv.org/abs/2304.13030
  63. [63]Yuchen Zhang, Nikhil Keetha, Chenwei Lyu, Bhuvan Jhamb, Yutian Chen, Yuheng Qiu, Jay Karhade, Shreyas Jha, Yaoyou Hu, Deva Ramanan, et al. Ufm: A simple path towards unified dense correspondence with flow. arXiv preprint arXiv:2506.09278, 2025. 2, 6arxiv.org/abs/2506.09278
  64. [64]Zhiyuan Zhou, Ruofeng Liu, Taichi Liu, Weijian Zuo, Shanshan Wang, Zhiqing Hong, and Desheng Zhang. Any to full: Prompting depth anything for depth completion in one stage. In European Conference on Computer Vision, pages 442–462. Springer, 2026. 2, 3, 4, 6, 7arxiv.org/abs/2603.05711
  65. [65]Yiming Zuo, Willow Yang, Zeyu Ma, and Jia Deng. Omnidc: Highly robust depth completion with multiresolution depth integration. In 2025 IEEE/CVF International Conference on Computer Vision (ICCV), pages 9287–9297. IEEE, 2025. 2, 3, 4

Paper details

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

views · 0

downloads · 0

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

  • Computer Science

Not recorded for this paper

View statement
Looking for related papers…
Contents