An Adaptive Attention-Driven Quadruplet Deep Hashing Method for Retrieving Histopathological Images. [PDF]
Alizadeh SM, Müller H, Helfroush MS.
europepmc +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
A hybrid feature hashing approach with temporal validation for efficient forgery detection of frame duplication. [PDF]
Ali MM, Ghali NI, Hamza HM, Hosny KM.
europepmc +1 more source
LeafFit: Plant Assets Creation from 3D Gaussian Splatting
Abstract We propose LeafFit, a pipeline that converts 3D Gaussian Splatting (3DGS) of individual plants into editable, instanced mesh assets. While 3DGS faithfully captures complex foliage, its high memory footprint and lack of mesh topology make it incompatible with traditional game production workflows. We address this by leveraging the repetition of
Chang Luo, Nobuyuki Umetani
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
DBpHash: a blockchain-based dual-band perceptual hashing framework for copyright protection of purely chromatic background images. [PDF]
Nainar M +2 more
europepmc +1 more source
NAADF: Globally Illuminated Voxel Worlds Accelerated with Nested Axis‐Aligned Distance Fields
Abstract Achieving realistic rendering of 3D scenes in real time using path tracing is challenging due to the high sample count required, with ray tracing as the bottleneck. Focusing on voxels as a geometry representation offers significant opportunities for optimizations, especially for tracing the rays, but also for computing the samples.
A. Ulschmid +4 more
wiley +1 more source
Enhancing image retrieval via Siamese network-based hashing with gated residual connections. [PDF]
Nazari A +3 more
europepmc +1 more source
BloomTree: Dynamic Coloring Techniques for Exploring Deep and Wide Tree Structures
Abstract This study introduces BloomTree, an interactive Sunburst system for visualizing massive hierarchical datasets, such as the Tree of Life. Traditional static color schemes fail to maintain perceptual distinguishability when applied to millions of nodes, and managing the full tree in memory is computationally costly.
A. Tanaka, K. Wakita
wiley +1 more source
A practical algorithm for weighted k‐hulls
Abstract The convex hull is a central concept in computational geometry, geometry processing, and generally for summarizing sampled data. Its descriptive power suffers significantly in the presence of noise. The k‐hull, also known as the k‐depth contour in statistics, is the intersection of all half‐spaces that contain all but k data points, i.e. it is
N. Look, H. Meyer, M. Alexa
wiley +1 more source

