TTHRESH: Tensor Compression for Multidimensional Visual Data. Ballester-Ripoll, R., Lindstrom, P., & Pajarola, R. IEEE Transactions on Visualization and Computer Graphics, 4, 2019.
TTHRESH: Tensor Compression for Multidimensional Visual Data [link]Website  doi  abstract   bibtex   8 downloads  
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 N-dimensional data over regular grids. It leverages the higher-order singular value decomposition (HOSVD), a generalization of the SVD to 3 and more dimensions, together with adaptive quantization, run-length and arithmetic coding to store the HOSVD transform coefficients' relative positions as sorted by their absolute magnitude. Our scheme degrades the data particularly smoothly and outperforms other state-of-the-art volume compressors at low-to-medium bit rates, as required in data archiving and management for visualization purposes. Further advantages of the proposed algorithm include extremely fine bit rate selection granularity, bounded resulting l^2 error, and the ability to manipulate data at very small cost in the compression domain, for example to reconstruct subsampled or filtered-resampled versions of all (or selected parts) of the data set.
@article{
 title = {TTHRESH: Tensor Compression for Multidimensional Visual Data},
 type = {article},
 year = {2019},
 pages = {1},
 websites = {http://arxiv.org/abs/1806.05952,https://ieeexplore.ieee.org/document/8663447/},
 month = {4},
 id = {42be9489-0a16-33a0-83cb-d7f6a51e32f6},
 created = {2021-04-09T15:23:37.189Z},
 file_attached = {false},
 profile_id = {75799766-8e2d-3c98-81f9-e3efa41233d0},
 group_id = {c9329632-2a50-3043-b803-cadc8dbdfc3f},
 last_modified = {2021-04-09T15:23:37.189Z},
 read = {false},
 starred = {false},
 authored = {false},
 confirmed = {false},
 hidden = {false},
 source_type = {article},
 private_publication = {false},
 abstract = {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 N-dimensional data over regular grids. It leverages the higher-order singular value decomposition (HOSVD), a generalization of the SVD to 3 and more dimensions, together with adaptive quantization, run-length and arithmetic coding to store the HOSVD transform coefficients' relative positions as sorted by their absolute magnitude. Our scheme degrades the data particularly smoothly and outperforms other state-of-the-art volume compressors at low-to-medium bit rates, as required in data archiving and management for visualization purposes. Further advantages of the proposed algorithm include extremely fine bit rate selection granularity, bounded resulting l^2 error, and the ability to manipulate data at very small cost in the compression domain, for example to reconstruct subsampled or filtered-resampled versions of all (or selected parts) of the data set.},
 bibtype = {article},
 author = {Ballester-Ripoll, Rafael and Lindstrom, Peter and Pajarola, Renato},
 doi = {10.1109/TVCG.2019.2904063},
 journal = {IEEE Transactions on Visualization and Computer Graphics}
}

Downloads: 8