High-Fidelity and Generalizable Neural Surface Reconstruction with Sparse Feature Volumes
Aoxiang Fan, Corentin Dumery, Nicolas Talabot, Hieu Le, Pascal Fua

TL;DR
This paper introduces a sparse feature volume approach for neural surface reconstruction that significantly improves resolution and efficiency, enabling high-quality reconstructions with less memory and on standard hardware.
Contribution
The authors propose a novel sparse volume method with custom algorithms, allowing higher resolution reconstructions without performance loss, surpassing dense volume limitations.
Findings
Reduces storage by over 50 times
Enables $512^3$ resolution on standard hardware
Achieves superior reconstruction accuracy
Abstract
Generalizable neural surface reconstruction has become a compelling technique to reconstruct from few images without per-scene optimization, where dense 3D feature volume has proven effective as a global representation of scenes. However, the dense representation does not scale well to increasing voxel resolutions, severely limiting the reconstruction quality. We thus present a sparse representation method, that maximizes memory efficiency and enables significantly higher resolution reconstructions on standard hardware. We implement this through a two-stage approach: First training a network to predict voxel occupancies from posed images and associated depth maps, then computing features and performing volume rendering only in voxels with sufficiently high occupancy estimates. To support this sparse representation, we developed custom algorithms for efficient sampling, feature…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topics3D Shape Modeling and Analysis · Advanced Neural Network Applications · Generative Adversarial Networks and Image Synthesis
