---
title: Depth-Guided Geometric Prior Generation (DGPG)
url: https://www.emergentmind.com/topics/depth-guided-geometric-prior-generation-dgpg
type: topic
---

# Depth-Guided Geometric Prior Generation (DGPG)

Searching arXiv for recent papers on DGPG and closely related formulations.
arXiv search query: "Depth-Guided Geometric Prior Generation" and related frameworks.
Depth-Guided Geometric Prior Generation (DGPG) denotes a family of architectures in which depth, depth features, or geometry-derived signals are converted into an intermediate prior that guides a later prediction, generation, reconstruction, or recognition stage rather than serving as the final output directly. Across recent formulations, the prior may be obtained from incomplete metric measurements, monocular depth prediction, semantic context, planar scene structure, or cross-modal estimation; it is then used to constrain refinement, attention, denoising, rendering, or decoding. A recurring pattern is therefore coarse-to-fine: first construct a geometry-bearing prior, then consume that prior in a downstream model that recovers detail, metric fidelity, temporal consistency, or cross-modal alignment [2505.10565], [2604.26341], [2507.09294].

## 1. Conceptual scope and defining properties

In recent work, DGPG appears both as an explicit module name and as a broader design pattern. In "Depth Anything with Any Prior" [2505.10565], the method first generates a denser intermediate prior from incomplete metric depth and then refines it with a conditioned monocular depth estimation model. In "Geo-RepNet: Geometry-Aware Representation Learning for Surgical Phase Recognition in Endoscopic Submucosal Dissection" [2507.09294], the DGPG module converts raw endoscopic depth into relative positional encodings and visibility or depth masks that guide later attention. In "SpatialFusion: Endowing Unified Image Generation with Intrinsic 3D Geometric Awareness" [2604.26341], the paper describes a DGPG-like mechanism in which a Spatial Transformer derives a dense metric-depth map from semantic context and injects it into diffusion as an explicit geometric scaffold.

A useful synthesis is that DGPG systems treat depth as a source of structure rather than as a terminal prediction. The prior can be metric and incomplete, relative and dense, or feature-based and confidence-weighted. What makes these systems similar is that they transform such signals into a geometry-centric representation that is more suitable for the target task than the original input modality alone.

| Framework | Prior generation mechanism | Downstream use |
|---|---|---|
| Prior Depth Anything | Pixel-level metric alignment and distance-aware weighting | Conditioned MDE refinement |
| Geo-RepNet | Depth-derived positional priors and geometry masks | Geometry-aware cross-attention |
| SpatialFusion | Spatial Transformer predicts metric-depth map | Depth Adapter injects diffusion scaffold |
| G4Splat | Plane-aware metric-scale depth and aligned monocular depth | Visibility, view selection, inpainting |
| GPOcc | Surface priors extended inward along rays into Gaussians | Sparse occupancy inference |
| DPG-CD | Estimated depth prior gated into image features | Joint 2D semantic and 3D height change detection |

This suggests that DGPG is less a single algorithm than a recurrent abstraction for turning depth-related evidence into task-specific geometric guidance.

## 2. Canonical computational pattern

A representative formalization appears in Prior Depth Anything, which starts from an RGB image and an incomplete metric prior,
\[
\mathbf{I} \in \mathbb{R}^{3\times H \times W}, \qquad \mathbf{D}_\textrm{prior} \in \mathbb{R}^{H \times W},
\]
and aims to recover a dense metric output,
\[
\mathbf{D}_\textrm{output} \in \mathbb{R}^{H \times W}.
\]
To unify sparse points, low-resolution grids, masked holes, and mixed priors, valid pixels are represented as
\[
\mathbf{P} = \{x_i, y_i\}_{i=0}^N.
\]
A frozen monocular depth model provides a relative prediction \(\mathbf{D}_\textrm{pred}\), which supplies complete geometric structure but not metric scale [2505.10565].

In that formulation, coarse prior generation is performed by local alignment. For each missing pixel \((\hat{x}, \hat{y})\), the method finds \(K\) nearest valid prior pixels and solves
\[
s, t = \underset{s,t}{\arg\min} \sum_{k=1}^K \Vert s \cdot \mathbf{D}_\textrm{pred}(x_k, y_k) + t - \mathbf{D}_\textrm{prior}(x_k, y_k) \Vert_2,
\]
then fills the missing value with
\[
\hat{\mathbf{D}_\textrm{prior}(\hat{x}, \hat{y}) = s \cdot \mathbf{D}_\textrm{pred}(\hat{x}, \hat{y}) + t.
\]
A distance-aware variant reweights support points by inverse distance to the query pixel. The crucial property is that the generated prior is neither pure interpolation nor unconstrained hallucination; it is a locally metrically aligned transformation of a geometry-complete prediction.

Other DGPG systems instantiate the same logic with different operators. G4Splat computes exact plane depth by ray-plane intersection,
\[
D_i^{v}(\mathbf{u}) = \frac{-\mathbf{n}_{k_i}^\top \mathbf{o}^v - d_{k_i}}{\mathbf{n}_{k_i}^\top \mathbf{r}^v(\mathbf{u})},
\]
then aligns monocular depth in non-planar regions by
\[
D^v(\mathbf{u}) = a_v \hat{D}^v(\mathbf{u}) + b_v,
\]
using planes as metric anchors [2510.12099]. DPG-CD computes an estimated depth prior \(\mathbf{D}_{\mathrm{edm}} = \Phi_{\theta^\ast}(\mathbf{I}^{img})\), extracts hierarchical depth features, and gates them into image features by
\[
\mathbf{F}_{i}^{fused}= \tilde{\mathbf{F}_{i}^{img} + \mathbf{M}_{i} \odot \tilde{\mathbf{F}_{i}^{edm}},
\]
followed by residual refinement [2605.07151].

A plausible implication is that DGPG methods differ primarily in where the prior is generated—pixel space, feature space, latent space, or world space—while preserving the same operational sequence: derive geometry, regularize it or calibrate it, and inject it into a downstream computation.

## 3. Metric completion, refinement, and geometry-aware attention

The most direct DGPG formulation is Prior Depth Anything. Its two stages are explicitly separated: coarse metric alignment pre-fills the incomplete prior, and a conditioned monocular depth estimation model refines the resulting dense but noisy prior. The conditioned model receives the RGB image, the pre-filled dense prior, and the normalized relative depth prediction. The paper states that the prediction from the frozen MDE model is passed into the conditioned MDE model through a zero-initialized convolution, so the auxiliary geometry cue begins with no effect and is learned gradually during training [2505.10565].

This design addresses a recurring DGPG problem: the prior is informative but imperfect. The pre-filled prior is metric, yet local filling can propagate errors if sparse anchors are wrong; the learned refinement stage therefore acts as an error-correcting merger of metric fidelity, geometric structure, and image evidence. The same paper further emphasizes normalization of \(\mathbf{D}_\textrm{pred}\), which enables test-time model switching among different frozen predictors such as Depth Anything v2 or Depth Pro. The reported consequence is a flexible accuracy-efficiency trade-off and robustness to mixed priors.

Geo-RepNet presents a different but conceptually related use of DGPG. Here the task is surgical phase recognition rather than depth recovery, and the geometric prior is intentionally lightweight. DGPG takes a raw depth map
\[
\mathbf{d} \in \mathbb{R}^{B \times 1 \times H \times W}
\]
and produces sinusoidal positional priors, a visibility or geometry mask, and a combined geometric prior \(G\). Pairwise depth differences
\[
\left|\mathbf{d}_{i,j} - \mathbf{d}_{i',j'}\right|
\]
are modulated by a head-specific decay,
\[
\text{decay}(h) = \log\left(1 - 2^{-(\lambda_0 + \gamma \cdot \frac{h}{H})} \right),
\]
while relative positions are encoded by
\[
\text{PE}_{\sin}(i,j) = \sin(\Delta_{ij} \cdot \omega), \quad \text{PE}_{\cos}(i,j) = \cos(\Delta_{ij} \cdot \omega).
\]
These terms are fused into
\[
\mathbf{M}_{\text{geo} = w_1 \cdot \mathbf{M}_{\text{pos} + w_2 \cdot \mathbf{M}_{\text{depth}}.
\]
The resulting prior modulates attention rather than acting as a full depth feature stream [2507.09294].

A common misconception is that DGPG is equivalent to adding a second depth encoder. Geo-RepNet argues the opposite explicitly: DGPG is not a generic depth encoder, because it does not build a full depth hierarchy and does not treat depth as an equal semantic modality. Instead, it produces priors over interactions—where attention should be strong, where visibility is uncertain, and which spatial relations are geometrically plausible. That distinction is central to many later DGPG variants.

## 4. Generative modeling, view synthesis, and 3D reconstruction

SpatialFusion adapts the DGPG pattern to unified image generation. Its first component, described as semantics-guided geometric derivation, uses a parallel Spatial Transformer under a Mixture-of-Transformers design to infer a dense metric-depth map from multimodal semantic context. The geometric branch interacts with the semantic branch through shared self-attention:
\[
\mathbf{Attn}_{geo}^{(i)} = \text{softmax}\left( \frac{\mathbf{Q}_{geo}^{(i)} [\mathbf{K}_{sem}^{(j)} \circ \mathbf{K}_{geo}^{(i)}]^T}{\sqrt{d} } \right) [\mathbf{V}_{sem}^{(j)} \circ \mathbf{V}_{geo}^{(i)}].
\]
The final geometric states are decoded by a DPT head into
\[
\mathbf{D} \in \mathbb{R}^{H \times W \times 1}.
\]
That depth map is then encoded by a Depth Adapter,
\[
F_{depth} = \mathcal{E}_{\phi}(\mathbf{D}) \in \mathbb{R}^{h \times w \times c},
\]
and fused with the VAE latent by
\[
\hat{z}_t = z_t \oplus F_{depth}.
\]
The paper reports that addition consistently outperforms concatenation and that \(\lambda = 0.5\) is the best loss balance in the joint objective \(\mathcal{L}_{total} = \mathcal{L}_{diff} + \lambda \mathcal{L}_{depth}\) [2604.26341].

DAG implements a sampling-time version of DGPG inside diffusion models. It first mines depth estimates from intermediate diffusion U-Net decoder features using a shallow MLP,
\[
\mathbf{d}_{t} = \text{MLP}(\mathbf{g}_t, t),
\]
with depth supervision
\[
\mathcal{L}_\mathrm{depth}=\|\mathbf{d}_{t} - \mathbf{y}\|_1.
\]
During reverse diffusion, the sample is modified by gradients of depth-related losses. Depth Consistency Guidance uses
\[
\mathcal{L}_\mathrm{dc} = \|\mathrm{stopgrad}(\mathbf{d}^{S}_t)-\mathbf{d}^{W}_t\|^2_2,
\]
while Depth Prior Guidance uses a diffusion prior in depth space,
\[
\mathcal{L}_\mathrm{dp}=\|\eta - \epsilon_\phi(\mathbf{d}^{S}_\tau)) \|^2_2.
\]
The result is a guidance mechanism that biases sampling toward geometrically plausible images without retraining the image diffusion model itself [2212.08861].

In sparse-view 3D reconstruction, G4Splat and EDUS place DGPG directly in 3D world geometry. G4Splat first extracts plane masks from normal maps and SAM instance masks, fits global 3D planes
\[
\Phi_k:\ \mathbf{n}_k^\top \mathbf{x} + d_k = 0,
\]
uses RANSAC on high-confidence points, derives metric-scale depth on planar regions, and then propagates that geometry through visibility estimation, plane-aware novel view selection, and video-diffusion inpainting. The novel view camera center is chosen by
\[
\mathbf{c}^* = \arg\max_{\mathbf{c} \in \mathcal{C}} \Big( R(\mathbf{c}) + |\cos\theta(\mathbf{c},\mathbf{p},\mathbf{n})| - D(\mathbf{c},\mathbf{p},\mathbf{n}) \Big),
\]
and visibility is rendered from a voxel grid by
\[
V^v(\mathbf{u}) = \prod_{q=1}^{Q} v_q.
\]
The paper’s central claim is that accurate geometry is the prerequisite for making the generative prior useful [2510.12099].

EDUS uses predicted metric depth maps, unprojects them into world coordinates,
\[
\mathbf{x} = \left(d \mathbf{R}_i \mathbf{K}^{-1} \mathbf{u} + \mathbf{t}_i\right),
\]
filters them by depth consistency with threshold \(\sigma = 0.2\) m, voxelizes the resulting point cloud, and processes it by a 3D SPADE CNN. The model combines trilinearly sampled 3D features with 2D color features and supports fast test-time optimization by freezing the 3D CNN and fine-tuning the global feature volume, with convergence reported within about five minutes [2407.12395].

Taken together, these systems show that DGPG in generative and reconstructive settings is usually not a post hoc regularizer. It is the source of the scene scaffold, the latent structural prior, or the world-space initialization on which later synthesis depends.

## 5. Volumetric, temporal, and cross-modal extensions

GPOcc broadens DGPG from surface geometry to occupancy. A pretrained geometry prior model produces features and depth, after which each pixel is back-projected along a camera ray,
\[
\mathbf{x}^{\text{surf}}_{(u,v)} = \mathbf{d}_{(u,v)} \cdot \mathbf{r}_{(u,v)},
\]
and then extended inward along the same ray by
\[
\mathbf{x}_{(u,v,k)} = (\mathbf{d}_{(u,v)} + \delta_k)\,\mathbf{r}_{(u,v)}, \quad k=1,\dots,K.
\]
Each sampled point becomes a Gaussian primitive
\[
\mathcal{G}_i = \{\mu_i, s_i, r_i, a_i, c_i\},
\]
and occupancy is inferred by Gaussian aggregation,
\[
\hat{o}(p; \mathbf{G}) = \sum_{i \in \mathcal{N}(p)} g_i(p; \mu_i, s_i, r_i, a_i, c_i).
\]
For streaming input, a training-free incremental update fuses Gaussians into global memory by weighted averaging over matched neighbors [2602.21552]. Here DGPG is no longer only about depth completion; it is a mechanism for converting visible-surface priors into volumetric support.

In monocular video human mesh recovery, the same pattern appears in feature form rather than depth-map form. The framework extracts intermediate Depth Anything v2 encoder activations,
\[
d_t = U\!\big(\psi\!\big(E_{\mathrm{DA}}^{(k^{\ast})}(I_t)\big)\big),
\]
fuses them with RGB features through confidence-aware gating,
\[
\tilde{F}_t = \phi\!\big([\mathbf{q}_r \odot F_r \| \mathbf{q}_d \odot F_d]\big),
\]
and then calibrates bone lengths temporally using
\[
\tilde{B}_{(i,j)} = \frac{\sum_{t=1}^{T} w_t \|S^{3D}_{t,i} - S^{3D}_{t,j}\|}{\sum_{t=1}^{T} w_t}, \qquad
B^{Z}_{(i,j)} = \alpha \tilde{B}_{(i,j)} + (1-\alpha) \bar{B}_{(i,j)}.
\]
A further Motion-Depth Aligned Refinement stage updates pose and shape by causal filtering,
\[
\mathbf{x}_t = (1-\rho)\mathbf{x}_{t-1} + \rho\left(\mathbf{x}_0 + \mathbf{g}_t \odot \Delta\mathbf{x}(F'_t)\right).
\]
The paper explicitly states that raw depth values are not used directly because they may be noisy or poorly calibrated [2602.04257].

DPG-CD places DGPG in a cross-modal urban monitoring setting. A frozen Depth Anything V2 model estimates a depth prior from post-event aerial imagery, hierarchical features are extracted from DSM, image, and depth prior branches, and a gated auxiliary injection module selectively transfers geometry into the image features:
\[
\mathbf{M}_{i}= \sigma\bigl( \phi_{m}\bigl( \operatorname{Concat}(\tilde{\mathbf{F}_{i}^{edm}}, \tilde{\mathbf{F}_{i}^{img}}) \bigr) \bigr),
\]
\[
\hat{\mathbf{F}_{i}^{img}}= \phi_r(\mathbf{F}_{i}^{fused}) +  \mathbf{F}_{i}^{img}.
\]
The geometry-enhanced image representation is then fused with DSM features by CCAB and HCFEB and decoded jointly into 2D semantic change, 3D height change, and an auxiliary DSM estimate [2605.07151].

These extensions make clear that DGPG is not restricted to depth-map refinement. It includes volumetric lifting, temporal calibration, and modality-bridging feature construction whenever depth-derived structure is the intermediate representation that resolves ambiguities unavailable to RGB or semantics alone.

## 6. Empirical profile, misconceptions, and limitations

Across tasks, the reported evidence is consistently tied to the usefulness of the generated geometric prior. Prior Depth Anything showcases zero-shot generalization across depth completion, super-resolution, and inpainting over 7 real-world datasets and is reported to match or even surpass previous task-specific methods, including challenging unseen mixed priors [2505.10565]. SpatialFusion reaches a **46.33** average score on GenSpace for text-to-image generation, compared with **43.22** for GPT-4o and **31.78** for OmniGen2, and adds only **+0.26 s/image** for text-to-image and **+0.83 s/image** for editing, which the paper describes as under **3%** delay [2604.26341]. G4Splat reports, on Replica, **CD: 6.61** versus MAtCha **10.12**, **F-score: 65.14** versus **60.9**, **NC: 83.98** versus **79.33**, and **PSNR: 23.90** versus **17.81**, with the strongest gains in unobserved regions [2510.12099]. GPOcc reports **+9.99 mIoU** in the monocular setting and **+11.79** in the streaming setting over prior state of the art, while **Ours-DPT** runs at **28.22 FPS** versus **10.66 FPS** for EmbodiedOcc, approximately **2.65× faster** [2602.21552]. Geo-RepNet improves from **77.53%** accuracy, **71.88%** F1, and **83.74%** AUC in the baseline to **85.02%**, **81.74%**, and **93.10%** in the full model [2507.09294]. DPG-CD reports, for Hi-BCD, **mIoU 59.37**, **mF1 82.82**, **RMSE 1.104**, and **cRMSE 6.831** in the full system [2605.07151].

Several misconceptions are clarified by these results and designs. First, DGPG is not identical to raw-depth supervision: multiple systems explicitly avoid direct reliance on raw depth because of noise, calibration issues, or domain mismatch, and instead use intermediate features, normalized predictions, or gated injection [2602.04257]. Second, DGPG is not confined to dense depth estimation: the same pattern appears in diffusion guidance, Gaussian splatting, occupancy prediction, surgical recognition, urban view synthesis, and change detection [2212.08861]. Third, DGPG does not imply that the prior is trusted unconditionally: distance-aware weighting, confidence-aware gating, residual refinement, and auxiliary reconstruction losses are repeatedly used because the generated prior can itself be wrong [2505.10565].

The limitations are also task-dependent but structurally similar. DAG is sampling-time guidance only and is computationally expensive because it backpropagates through the diffusion U-Net at sampling time [2212.08861]. G4Splat remains dependent on diffusion quality, struggles in heavily occluded regions, and notes that the plane assumption is especially effective for man-made scenes but may be less adequate for non-planar geometry [2510.12099]. DPG-CD reports that too much gradient loss can amplify local noise [2605.07151]. EDUS characterizes its geometric priors as noisy predicted geometric priors and therefore couples them with consistency filtering and foreground retention [2407.12395].

A plausible general conclusion is that DGPG is most effective when the prior is neither treated as ground truth nor ignored as a weak auxiliary cue. Its empirical success comes from using depth-derived geometry as a calibrated intermediate representation—strong enough to structure downstream inference, but always paired with mechanisms that correct, gate, normalize, or refine it.

Source: https://www.emergentmind.com/topics/depth-guided-geometric-prior-generation-dgpg