The reviewed record of science sign in
Pith

arxiv: 2404.14044 · v2 · pith:F2QNUQB7 · submitted 2024-04-22 · cs.CV

HashPoint: Accelerated Point Searching and Sampling for Neural Rendering

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:F2QNUQB7record.jsonopen to challenge →

classification cs.CV
keywords renderingpointsamplingsearchinghashpointmethodsefficientmethod
0
0 comments X
read the original abstract

In this paper, we address the problem of efficient point searching and sampling for volume neural rendering. Within this realm, two typical approaches are employed: rasterization and ray tracing. The rasterization-based methods enable real-time rendering at the cost of increased memory and lower fidelity. In contrast, the ray-tracing-based methods yield superior quality but demand longer rendering time. We solve this problem by our HashPoint method combining these two strategies, leveraging rasterization for efficient point searching and sampling, and ray marching for rendering. Our method optimizes point searching by rasterizing points within the camera's view, organizing them in a hash table, and facilitating rapid searches. Notably, we accelerate the rendering process by adaptive sampling on the primary surface encountered by the ray. Our approach yields substantial speed-up for a range of state-of-the-art ray-tracing-based methods, maintaining equivalent or superior accuracy across synthetic and real test datasets. The code will be available at https://jiahao-ma.github.io/hashpoint/.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.