Search arXivSearch

arXiv · 2607.02554

Reliability-Aware Monocular Depth Supervision for Sparse-View Neural Reconstruction

Abstract

Sparse-view neural reconstruction in outdoor driving is challenging due to narrow forward-facing trajectories and limited multi-view overlap, and monocular depth priors, though dense, are noisy and not uniformly reliable. We use Depth Anything V2 (DA-V2) as a dense monocular depth prior, align its per-image scale and shift to metric depth using sparse anchors (LiDAR and COLMAP) and apply depth supervision selectively through photometric masks generated from an RGB-only baseline model, and evaluate on Mip-NeRF-360 and Splatfacto. On KITTISeq02, masked depth supervision gives only marginal gains for Mip-NeRF-360 and does not improve geometry. In contrast, Splatfacto benefits clearly, improving PSNR from 14.903 to 15.932 and reducing RMSE from 0.542 to 0.100. Against global supervision, the proposed mask achieves 0.44-0.70,dB PSNR gains across KITTI sequences 00/02/05 at tied or better RMSE, while yielding no change on Mip-NeRF-360. This indicates the mask primarily enhances rendering fidelity rather than geometry. Matched-ratio ablations and two further KITTI fragments confirm the gains come from selecting reliable low-error regions, rather than from fewer pixels. On the Bicycle scene, depth supervision improves geometry but hurts RGB rendering quality when multi-view coverage is already strong. Using DA-V2 as a representative prior, results suggest that monocular depth priors are valuable for under-constrained sparse-view reconstruction when applied selectively with moderate weighting.

Explore related subjects

Keep this discovery

BibTeXRIS

Wei-Teng Chu, Yashasvini Gopalan, Changju Yuan. 2026-08-29. Reliability-Aware Monocular Depth Supervision for Sparse-View Neural Reconstruction. https://arxiv.org/abs/2607.02554

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

Real-Time Neural Hair G-Buffer Anti-Aliasing

We propose a lightweight real-time method for reconstructing strand-based hair G-Buffers from severely undersampled rasterized inputs. Our pipeline first applies neural spatial reconstruction and temporal accumulation to recover hair coverage, i.e., fractional hair visibility within a pixel, and tangent. It then uses a tangent-guided reconstruction step to complete the position, which is subsequently used for physically based deferred hair shading. We evaluate our method across a diverse set of hairstyles, including straight, wavy, afro, and ponytail styles, under both static and dynamic scenarios. Our method achieves higher hair reconstruction quality than general industrial neural reconstruction solutions such as DLSS and FSR.

cs.GR

Evaluating Constrained Iterative Refinement for Scalable Vector Graphics Generation with Off-the-Shelf VLMs

Scalable Vector Graphics (SVGs) power much of the modern visual ecosystem, yet state-of-the-art generative models focus almost entirely on rasterized images. We explore whether inference-time methods can unlock SVG generation capabilities in off-the-shelf vision-language models (VLMs). We systematically evaluate a constrained iterative refinement harness that combines visual feedback, structured editing, and constrained decoding to characterize the capabilities and limitations of current VLMs for SVG generation. Across multiple VLMs and generation settings, we find that constrained decoding improves compilation success rates, while iterative refinement reveals a deficit in visual reasoning and self-correction. Our results highlight both the promise and current limitations of using inference-time methods to adapt general-purpose VLMs for SVG generation.

cs.CV

Thread-Efficient Decoding for Neural Texture Compression

Neural texture compression (NTC) achieves higher compression ratios than BCn formats but suffers from GPU thread divergence, which significantly reduces runtime performance. In this work, we propose a shared decoder MLP architecture -- trained with a gradual decoder freezing schedule -- combined with texture clustering to reduce thread divergence by 25%-52% while preserving rendering quality. We evaluate our method on over 500 textures and multiple real rendering scenes, demonstrating up to 8.48x speedup on the Radeon RX 9070 XT GPU compared to non-shared baselines. Our key contributions include: (1) a unified shared decoder architecture that reduces divergence by grouping textures; (2) a training recipe with gradual decoder freezing that improves stability and reconstruction accuracy; (3) a semantic clustering strategy using CLIP embeddings that groups similar textures for effective decoder sharing; and (4) comprehensive performance and ablation studies validating our approach.

cs.CV