Variable‐Rate Texture Compression: Real‐Time Rendering with JPEG
Abstract Although variable‐rate compressed image formats such as JPEG are widely used to efficiently encode images, they have not found their way into real‐time rendering due to special requirements such as random access to individual texels. In this paper, we investigate the feasibility of variable‐rate texture compression on modern GPUs using the ...
Elias Kristmann +2 more
wiley +1 more source
Deep learning-based caching optimization for VR 360° videos in vehicular edge computing. [PDF]
Khan S +5 more
europepmc +1 more source
Neural Local Inter‐reflection Modeling for Garment Fold Rendering
Abstract Realistic garment rendering requires simulating complex multi‐bounce light paths within intricate fold geometries. In these regions, conventional path tracing is computationally expensive as light becomes trapped, necessitating high bounce counts for convergence.
Jooeun Son +4 more
wiley +1 more source
Low-data cross-modal adaptation for remote sensing with proxy-enhanced multi-granularity feature caching. [PDF]
Sun Y, Cheng Q, Xie W, Huang H, Gu C.
europepmc +1 more source
Real‐time by‐example texture synthesis and filtering using local statistics exchange
Abstract Real‐time by‐example texture synthesis is used in interactive virtual worlds to generate the appearance of an unbounded surface from an exemplar texture with as few repetitions as possible. Currently, leading real‐time methods rely on a tiling and blending scheme which is known to synthesize well texture patterns with little spatial ...
Nicolas Lutz, Guillaume Gilet
wiley +1 more source
Integrated photonic 3D tensor processing engine. [PDF]
Wu Y +6 more
europepmc +1 more source
Real‐Time Rendering of Dynamic Line Sets using Voxel Ray Tracing
Abstract Real‐time rendering of dynamic line sets is relevant in many visualization tasks, including unsteady flow visualization and interactive white matter reconstruction from Magnetic Resonance Imaging. High‐quality global illumination and transparency are important for conveying the spatial structure of dense line sets, yet remain difficult to ...
B. Kraaijeveld +3 more
wiley +1 more source
Barcode activity in a recurrent network model of the hippocampus enables efficient memory binding. [PDF]
Fang C +4 more
europepmc +1 more source
Stochastic Pairwise MIS for Unbiased Large‐Kernel Reuse in Real‐Time
Abstract Spatiotemporal resampling methods such as ReSTIR decrease noise in Monte Carlo rendering of dynamic content by reusing paths across frames and pixels. Standard ReSTIR reuses spatially from a small number of randomly selected neighbors. This reuse suffers when few neighbors contain contributing samples, reducing quality toward that of the ...
Trevor Hedstrom +4 more
wiley +1 more source
Register‐Efficient Linear‐Time Evaluation in the Bernstein Basis
Abstract We investigate the evaluation of points and derivatives of Bézier curves and surfaces on modern architectures, focusing on performance and guided by numerical error bounds. While the de Casteljau algorithm remains the reference for numerical robustness, its linear working‐set size imposes substantial register pressure on GPUs.
Gábor Valasek, Anna Lili Horváth
wiley +1 more source

