Results 111 to 120 of about 2,022 (254)
UNIQAT: An open‐source toolkit for reproducible image quality assessment in marine surveys
Abstract Modern marine surveys generate tens of thousands of underwater images per expedition, yet many are unusable due to image quality deterioration. Manual quality screening is labour‐intensive, subjective and inconsistent across observers and teams, hindering reproducible science, creating large backlogs of unprocessed imagery, and limiting real ...
Alzayat Saleh, Arjun Chennu
wiley +1 more source
Local Search and the Evolution of World Models
Abstract An open question regarding how people develop their models of the world is how new candidates are generated for consideration out of infinitely many possibilities. We discuss the role that evolutionary mechanisms play in this process. Specifically, we argue that when it comes to developing a global world model, innovation is necessarily ...
Neil R. Bramley +3 more
wiley +1 more source
Fused Collapsing for Wide BVH Construction
Abstract We propose a novel approach for constructing wide bounding volume hierarchies on the GPU by integrating a simple bottom‐up collapsing procedure within an existing binary bottom‐up BVH builder. Our approach directly constructs a wide BVH without traversing a temporary binary BVH as done by previous approaches and achieves 1.4 – 1.6 × lower ...
Wilhem Barbier, Mathias Paulin
wiley +1 more source
Encoding Occupancy in Memory Location for Efficient and Compact High‐Resolution Voxel Structures
We encode information about geometric structure into the pointers of a sparse voxel directed acyclic graph (SVDAG). Each pointer carries information about the structure of the node it points to. Our encoding improves ray tracing performance and reduces model size in memory.
Jaina Modisett, Markus Billeter
wiley +1 more source
TABI: Tight and Balanced Interactive Atlas Packing
Abstract Atlas packing is a key step in many computer graphics applications. Packing algorithms seek to arrange a set of charts within a fixed‐size atlas with as little downscaling as possible. Many packing applications such as content creation tools, dynamic atlas generation for video games, and texture space shading require on‐the‐fly interactive ...
F. Gu, N. Vining, A. Sheffer
wiley +1 more source
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
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
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
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

