TTHRESH: Tensor Compression for Multidimensional Visual Data

@article{BallesterRipoll2020TTHRESHTC,
  title={TTHRESH: Tensor Compression for Multidimensional Visual Data},
  author={Rafael Ballester-Ripoll and Peter Lindstrom and Renato Pajarola},
  journal={IEEE Transactions on Visualization and Computer Graphics},
  year={2020},
  volume={26},
  pages={2891-2903}
}
Memory and network bandwidth are decisive bottlenecks when handling high-resolution multidimensional data sets in visualization applications, and they increasingly demand suitable data compression strategies. We introduce a novel lossy compression algorithm for multidimensional data over regular grids. It leverages the higher-order singular value decomposition (HOSVD), a generalization of the SVD to three dimensions and higher, together with bit-plane, run-length and arithmetic coding to… Expand
Error-Controlled Lossy Compression Optimized for High Compression Ratios of Scientific Datasets
TLDR
Evaluation results confirm that the new adaptive solution can significantly improve the rate distortion for the lossy compression with fairly high compression ratios. Expand
Optimizing Error-Bounded Lossy Compression for Scientific Data by Dynamic Spline Interpolation
TLDR
A novel error-bounded lossy compressor based on a state-of-the-art prediction-based compression framework with a dynamic spline interpolation approach with a series of optimization strategies that can significantly improve the data prediction accuracy, substantially improving the compression quality in turn. Expand
ATC: an Advanced Tucker Compression library for multidimensional data
TLDR
A novel expression is derived to approximate the error of truncated Tucker decompositions in the case of core and factor perturbations and a Householder-reflector-based approach is proposed to compress the orthogonal Tucker factors. Expand
Lossy Geometry Compression for High Resolution Voxel Scenes
Sparse Voxel Directed Acyclic Graphs (SVDAGs) losslessly compress highly detailed geometry in a high-resolution binary voxel grid by identifying matching elements. This representation is suitable forExpand
Tensor Decomposition Learning for Compression of Multidimensional Signals
TLDR
A novel tensor decomposition learning method is proposed for the compression of high dimensional signals, surpassing competing compression methods while offering the flexibility to handle arbitrary high dimensional data structures. Expand
Identifying Latent Reduced Models to Precondition Lossy Compression
  • Huizhang Luo, Dan Huang, +7 authors Z. Qin
  • Computer Science
  • 2019 IEEE International Parallel and Distributed Processing Symposium (IPDPS)
  • 2019
TLDR
This paper proposes and evaluates the idea that data need to be preconditioned prior to compression, such that they can better match the design philosophies of a compressor, and identifies a reduced model that can be utilized to transform the original data to a more compressible form. Expand
Cherry-Picking Gradients: Learning Low-Rank Embeddings of Visual Data via Differentiable Cross-Approximation
TLDR
An end-to-end trainable framework that processes large-scale visual data tensors by looking at a fraction of their entries only and combining a neural network encoder with a tensor train decomposition to learn a low-rank latent encoding and cross-approximation to learn the representation through a subset of the original samples. Expand
Compression Ratio Modeling and Estimation across Error Bounds for Lossy Compression
TLDR
The compression ratios of two modern lossy compressors that achieve superior performance, SZ and ZFP, on HPC scientific datasets at various error bounds are predicted, based upon the compressors’ intrinsic metrics collected under a given base error bound. Expand
Lossy Compression for Large Scale PDE Problems
TLDR
This paper surveys data compression challenges and corresponding solution approaches for PDE problems, covering all levels of the memory hierarchy from mass storage up to main memory. Expand
TuckerMPI: A Parallel C++/MPI Software Package for Large-scale Data Compression via the Tucker Tensor Decomposition
TLDR
This work describes TuckerMPI, a parallel C++/MPI software package for compressing distributed data based on the implementation of the truncated Tucker decomposition, including details of the data distribution and in-memory layouts, the parallel and serial implementations of the key kernels, and analysis of the storage, communication, and computational costs. Expand
...
1
2
3
4
...

References

SHOWING 1-10 OF 50 REFERENCES
Lossy volume compression using Tucker truncation and thresholding
TLDR
This work proposes a Tucker compression alternative based on coefficient thresholding and zigzag traversal, followed by logarithmic quantization on both the transformed tensor core and its factor matrices that is theoretically and empirically better than the commonly used tensor rank truncation method. Expand
Multiresolution Volume Filtering in the Tensor Compressed Domain
TLDR
A novel and fast multiscale compression-domain volume filtering approach integrated into an interactive multiresolution volume visualization framework that filters accurately at the full spatial volume resolution at a very low cost in the compressed domain and reconstructs and displays the filtered result at variable level ofdetail. Expand
Tensor Decompositions for Integral Histogram Compression and Look-Up
TLDR
This work proposes a new compression and approximate retrieval algorithm to reduce the overall IH memory usage by several orders of magnitude at a user-defined accuracy and proposes an incremental tensor decomposition algorithm that allows to compress integral histograms of hundreds of gigabytes. Expand
Analysis of tensor approximation for compression-domain volume visualization
TLDR
This work discusses alternative incremental variations of the CANDECOMP/PARAFAC and Tucker models, and demonstrates the superiority of the Tucker model for most visualization purposes, while canonical-based models offer benefits only in limited situations. Expand
Rapid High Quality Compression of Volume Data for Visualization
TLDR
This work proposes a compression technique which is block based and operates in the wavelet transformed domain yielding large reconstruction quality gains from about 6 to 12 dB in PSNR for a5123 ‐volume extracted from the Visible Human data set. Expand
COVRA: A compression‐domain output‐sensitive volume rendering architecture based on a sparse representation of voxel blocks
TLDR
A novel multiresolution compression‐domain GPU volume rendering architecture designed for interactive local and networked exploration of rectilinear scalar volumes on commodity platforms and demonstrated on massive static and time‐varying datasets. Expand
Fast and Effective Lossy Compression Algorithms for Scientific Datasets
TLDR
This paper focuses on developing effective and efficient algorithms for compressing scientific simulation data computed on structured and unstructured grids in which the data is modeled as a graph, which gets decomposed into sets of vertices which satisfy a user defined error constraint. Expand
Hierarchical Tensor Approximation of Multi-Dimensional Visual Data
TLDR
This paper develops a compact data representation technique based on a hierarchical tensor-based transformation that can achieve higher compression ratios and quality than previous methods, including wavelet transforms, wavelet packet transforms, and single-level tensor approximation. Expand
Real-time decompression and visualization of animated volume data
TLDR
An algorithm running at interactive frame rates using 3D wavelet transforms that allows for any wavelet, motion compensation techniques and various encoding schemes of the resulting wavelet coefficients to be used, which enables very high compression ratios while still being able to reconstruct the volume with as few visual artifacts as possible. Expand
Compressing the Incompressible with ISABELA: In-situ Reduction of Spatio-temporal Data
TLDR
This work proposes an effective method for In-situ Sort-And-B-spline Error-bounded Lossy Abatement (ISABELA) of scientific data that is widely regarded as effectively incompressible and significantly outperforms existing lossy compression methods, such as Wavelet compression. Expand
...
1
2
3
4
5
...