Results 71 to 80 of about 3,329 (203)

Splatshop: Efficiently Editing Large Gaussian Splat Models

open access: yesComputer Graphics Forum, EarlyView.
Abstract We present Splatshop, a highly optimized toolbox for interactive editing (selection, deletion, painting, transformation, …) of 3D Gaussian Splatting models. Utilizing a comprehensive collection of heuristic approaches, we carefully balance between exact and fast rendering to enable precise editing without sacrificing real‐time performance. Our
Markus Schütz   +5 more
wiley   +1 more source

Low-Power Lossless Data Compression for Wireless Brain Electrophysiology. [PDF]

open access: yesSensors (Basel), 2022
Cuevas-López A   +4 more
europepmc   +1 more source

Image‐Based Spatio‐Temporal Interpolation for Split Rendering

open access: yesComputer Graphics Forum, EarlyView.
Abstract Low‐powered devices – such as small form factor head‐mounted displays (HMDs) – struggle to deliver a smooth and high‐quality viewing experience, due to their limited power and rendering capabilities. Cloud rendering attempts to solve the quality issue, but leads to prohibitive latency and bandwidth requirements, hindering use with HMDs over ...
M. Steiner   +4 more
wiley   +1 more source

The Sample Complexity of Lossless Data Compression

open access: yesCoRR
A new framework is introduced for examining and evaluating the fundamental limits of lossless data compression, that emphasizes genuinely non-asymptotic results. The {\em sample complexity} of compressing a given source is defined as the smallest blocklength at which it is possible to compress that source at a specifically constrained rate and to ...
Terence Viaud, Ioannis Kontoyiannis
openaire   +2 more sources

Encoding Occupancy in Memory Location for Efficient and Compact High‐Resolution Voxel Structures

open access: yesComputer Graphics Forum, EarlyView.
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

Pixelated: A Lossless Data Transformation Framework Built on PNG Compression

open access: yesAlgorithms
The rapid growth of digital data has created an urgent need for innovative storage solutions. Transactional data, with its diverse formats and row-based structure, is a significant contributor to this challenge.
Zina Abohaia, Patrick Mukala
doaj   +1 more source

Variable‐Rate Texture Compression: Real‐Time Rendering with JPEG

open access: yesComputer Graphics Forum, EarlyView.
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

Mesh Processing Non‐Meshes via Neural Displacement Fields

open access: yesComputer Graphics Forum, EarlyView.
Abstract Mesh processing pipelines are mature, but adapting them to newer non‐mesh surface representations—which enable fast rendering with compact file size—requires costly meshing or transmitting bulky meshes, negating their core benefits for streaming applications.
Yuta Noma   +4 more
wiley   +1 more source

A Comprehensive Review on Hyperspectral Image Lossless Compression Algorithms

open access: yesRemote Sensing
The rapid advancement of imaging sensors and optical filters has significantly increased the number of spectral bands captured in hyperspectral images, leading to a substantial rise in data volume.
Shumin Liu   +3 more
doaj   +1 more source

Noisy Graph Patterns via Ordered Matrices

open access: yesComputer Graphics Forum, EarlyView.
Abstract The high‐level structure of a graph is a crucial ingredient for the analysis and visualization of relational data. However, discovering the salient graph patterns that form this structure is notoriously difficult for two reasons. (1) Finding important patterns, such as cliques and bicliques, is computationally hard.
J. Wulms, W. Meulemans, B. Speckmann
wiley   +1 more source

Home - About - Disclaimer - Privacy