Skip to content

Structural-Similarity-Preserving Lossy Data Compression for CPUs and GPUs

· 0 citations · 40 references

TL;DR

The minSSIM metric and SBLC, the first SSIM-bounded compressor, are introduced, which is fully CPU-GPU compatible and guarantees the user-provided minSSIM bound, which it enforces by strategically tightening the error bound on specific values in the data.

View source

Similar papers

Preprint Aug 2026

FaCTz: Fast Critical-Point and Topology-Aware GPU Compression for Scientific Vector Fields

FaCTz is presented, the first GPU-based error-bounded lossy compressor that guarantees critical-point preservation and provides a block-wise mode optimized for throughput and a speculative per-point mode optimized for compression ratio.

Mingze Xia, Yu-Xiao Li, Sheng Di et al. · 0 citations

Cortado: Progressive Retrieval of Lossily Compressed Data with Guaranteed Error Bounds

Cortado is compared with state-of-the-art approaches and it is found that it is the only progressive compressor that guarantees the evaluated error bounds on all tested inputs while achieving the highest throughputs, comparable reconstruction quality, and on-par compression ratios.

B. Burtchell, Martin Burtscher · 0 citations
Preprint Aug 2026

BlockMGARD: Accelerating Adaptive Scientific Data Reduction with Region-of-Interest Error Control on GPUs

BlockMGARD is proposed, an adaptive, Region-of-Interest (ROI)-supported GPU lossy compressor, with four contributions: an In-cache Block decomposition leveraging GPU on-chip memory and constant lookup tables to accelerate decomposition; a hybrid hierarchy combining In-cache Block and global decomposition to balance spe...

Yan-Liang Li, Qian Gong, Qing Liu et al. · 0 citations
Book Open access Sep 2026

A Low-Overhead, Lightweight, Lossless GPU Compression Algorithm for Numerical Simulations

HPC (High Performance Computing) applications such as numerical simulations are memory-intensive. As memory grows scarce compared to compute power, compression could alleviate hardware demands by reducing memory footprint at runtime, especially on GPU. Existing compression algorithms for scientific data are not specifi...

T. Hovi, François Letierce, L. Lucas · 0 citations
Preprint Sep 2026

The Price of Random Access: Measuring Block Granularity Across Four Compressed Formats

Random access into compressed data is normally bought with density. We measure the exchange rate. Across four formats and nine axes on a common corpus, the cost of cutting a 254 MB archive into independently addressable 16 KiB units is 1.632% of the archive for an absolute-offset format against 6.57% for seekable zstd,...

Yakiv Shavidze · 0 citations
Preprint Oct 2026

OSFP4: Joint Optimization of Diagonal Smoothing and Block Scales for NVFP4 Quantization

NVFP4 is an attractive datatype for large language model (LLM) inference, offering compact storage and native tensor-core acceleration. However, preserving accuracy using NVFP4 requires careful quantization. In this work we develop a novel quantization scheme called Optimized Smoothing and Scaling for NVFP4 (OSFP4). Fo...

N. B. Ben-David, Or Meir, Or Ordentlich · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.