TTHRESH : Tensor Compression for Multidimensional Visual Data

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 gri...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on visualization and computer graphics. - 1996. - 26(2020), 9 vom: 11. Sept., Seite 2891-2903
1. Verfasser: Ballester-Ripoll, Rafael (VerfasserIn)
Weitere Verfasser: Lindstrom, Peter, Pajarola, Renato
Format: Online-Aufsatz
Sprache:English
Veröffentlicht: 2020
Zugriff auf das übergeordnete Werk:IEEE transactions on visualization and computer graphics
Schlagworte:Journal Article
LEADER 01000naa a22002652 4500
001 NLM294927476
003 DE-627
005 20231225082538.0
007 cr uuu---uuuuu
008 231225s2020 xx |||||o 00| ||eng c
024 7 |a 10.1109/TVCG.2019.2904063  |2 doi 
028 5 2 |a pubmed24n0983.xml 
035 |a (DE-627)NLM294927476 
035 |a (NLM)30869621 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Ballester-Ripoll, Rafael  |e verfasserin  |4 aut 
245 1 0 |a TTHRESH  |b Tensor Compression for Multidimensional Visual Data 
264 1 |c 2020 
336 |a Text  |b txt  |2 rdacontent 
337 |a ƒaComputermedien  |b c  |2 rdamedia 
338 |a ƒa Online-Ressource  |b cr  |2 rdacarrier 
500 |a Date Revised 30.07.2020 
500 |a published: Print-Electronic 
500 |a Citation Status PubMed-not-MEDLINE 
520 |a 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 compress the HOSVD transform coefficients. Our scheme degrades the data particularly smoothly and achieves lower mean squared error than other state-of-the-art algorithms at low-to-medium bit rates, as it is required in data archiving and management for visualization purposes. Further advantages of the proposed algorithm include very fine bit rate selection granularity and the ability to manipulate data at very small cost in the compression domain, for example to reconstruct filtered and/or subsampled versions of all (or selected parts) of the data set 
650 4 |a Journal Article 
700 1 |a Lindstrom, Peter  |e verfasserin  |4 aut 
700 1 |a Pajarola, Renato  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t IEEE transactions on visualization and computer graphics  |d 1996  |g 26(2020), 9 vom: 11. Sept., Seite 2891-2903  |w (DE-627)NLM098269445  |x 1941-0506  |7 nnns 
773 1 8 |g volume:26  |g year:2020  |g number:9  |g day:11  |g month:09  |g pages:2891-2903 
856 4 0 |u http://dx.doi.org/10.1109/TVCG.2019.2904063  |3 Volltext 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_NLM 
912 |a GBV_ILN_350 
951 |a AR 
952 |d 26  |j 2020  |e 9  |b 11  |c 09  |h 2891-2903