2019/02/15 by Nikolaus Binder, Binder, Nikolaus, Sascha Fricke +3
Computer Science · #Advanced Vision and Imaging #Computer Graphics and Visualization Techniques #FOS: Computer and information sciences #Graphics (cs.GR) #Image Enhancement Techniques
paper · pdf · doi:10.48550/arxiv.1902.05942
openalex publication_date 2019/02/15 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Restricting path tracing to a small number of paths per pixel for performance reasons rarely achieves a satisfactory image quality for scenes of interest. However, path space filtering may dramatically improve the visual quality by sharing information across vertices of paths classified as proximate. Unlike screen space-based approaches, these paths neither need to be present on the screen, nor is filtering restricted to the first intersection with the scene. While searching proximate vertices had been more expensive than filtering in screen space, we greatly improve over this performance penalty by storing, updating, and looking up the required information in a hash table. The keys are constructed from jittered and quantized information, such that only a single query very likely replaces costly neighborhood searches. A massively parallel implementation of the algorithm is demonstrated on a graphics processing unit (GPU).