SAND: Spatially Adaptive Network Depth for Fast Sampling of Neural Implicit Surfaces
Chuanxiang Yang, Junhui Hou, Yuan Liu, Siyu Ren, Guangshun Wei, Taku Komura, Yuanfeng Zhou, Wenping Wang
Abstract
Implicit neural representations are powerful for geometric modeling, but their practical use is often limited by the high computational cost of network evaluations. We observe that implicit representations require progressively lower accuracy as query points move farther from the target surface, and that even within the same iso-surface, representation difficulty varies spatially with local geometric complexity. However, conventional neural implicit models evaluate all query points with the same network depth and computational cost, ignoring this spatial variation and thereby incurring substantial computational waste. Motivated by this observation, we propose an efficient neural implicit geometry representation framework with spatially adaptive network depth (SAND). SAND leverages a volumetric network-depth map together with a tailed multi-layer perceptron (T-MLP) to model implicit representation. The volumetric depth map records, for each spatial region, the network depth required to achieve sufficient accuracy, while the T-MLP is a modified MLP designed to learn implicit functions such as signed distance functions, where an output branch, referred to as a tail, is attached to each hidden layer. This design allows network evaluation to terminate adaptively without traversing the full network and directs computational resources to geometrically important and complex regions, improving efficiency while preserving high-fidelity representations. Extensive experimental results demonstrate that our approach can significantly improve the inference-time query speed of implicit neural representations.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext f047f8d0-e191-40b1-9358-334823bef4ceBuilds on31
- Instant neural graphics primitives with a multiresolution hash encodingThomas Müller, Alex Evans, Christoph Schied, Alexander KellerSIGGRAPH 2022 · 4,089 citations
- Fourier Features Let Networks Learn High Frequency Functions in Low Dimensional DomainsMatthew Tancik, Pratul P. Srinivasan, Ben Mildenhall, Sara Fridovich-Keil et al.NeurIPS 2020 · 4,036 citations
- Implicit Neural Representations with Periodic Activation FunctionsVincent Sitzmann, Julien N. P. Martel, Alexander W. Bergman, David B. Lindell et al.NeurIPS 2020 · 4,008 citations
- PlenOctrees for Real-time Rendering of Neural Radiance FieldsAlex Yu, Ruilong Li, Matthew Tancik, Hao Li et al.ICCV 2021 · 1,284 citations
- Implicit Geometric Regularization for Learning ShapesAmos Gropp, Lior Yariv, Niv Haim, Matan Atzmon et al.ICML 2020 · 1,001 citations
Related papers
- Spelunking the deep: guaranteed queries on general neural implicit surfaces via range analysisNicholas Sharp, Alec JacobsonSIGGRAPH 2022 · 45 citations
- Neural Geometric Level of Detail: Real-Time Rendering With Implicit 3D ShapesTowaki Takikawa, Joey Litalien, Kangxue Yin, Karsten Kreis et al.CVPR 2021
- Learning Compact Latent Space for Representing Neural Signed Distance Functions with High-fidelity Geometry DetailsQiang Bai, Bojian Wu, Xi Yang, Zhizhong HanAAAI 2026
- BNV-Fusion: Dense 3D Reconstruction using Bi-level Neural Volume FusionKejie Li, Yansong Tang, Victor Adrian Prisacariu, Philip H. S. TorrCVPR 2022 · 35 citations
- NeuroGF: A Neural Representation for Fast Geodesic Distance and Path QueriesQijian Zhang, Junhui Hou, Yohanes Yudhi Adikusuma, Wenping Wang et al.NeurIPS 2023 · 11 citations
