|
|
|
|
| LEADER |
01000naa a22002652 4500 |
| 001 |
NLM252627253 |
| 003 |
DE-627 |
| 005 |
20231224164518.0 |
| 007 |
cr uuu---uuuuu |
| 008 |
231224s2014 xx |||||o 00| ||eng c |
| 024 |
7 |
|
|a 10.1109/TVCG.2014.2346458
|2 doi
|
| 028 |
5 |
2 |
|a pubmed24n0842.xml
|
| 035 |
|
|
|a (DE-627)NLM252627253
|
| 035 |
|
|
|a (NLM)26356981
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 100 |
1 |
|
|a Lindstrom, Peter
|e verfasserin
|4 aut
|
| 245 |
1 |
0 |
|a Fixed-Rate Compressed Floating-Point Arrays
|
| 264 |
|
1 |
|c 2014
|
| 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 Completed 08.12.2015
|
| 500 |
|
|
|a Date Revised 11.09.2015
|
| 500 |
|
|
|a published: Print
|
| 500 |
|
|
|a Citation Status PubMed-not-MEDLINE
|
| 520 |
|
|
|a Current compression schemes for floating-point data commonly take fixed-precision values and compress them to a variable-length bit stream, complicating memory management and random access. We present a fixed-rate, near-lossless compression scheme that maps small blocks of 4(d) values in d dimensions to a fixed, user-specified number of bits per block, thereby allowing read and write random access to compressed floating-point data at block granularity. Our approach is inspired by fixed-rate texture compression methods widely adopted in graphics hardware, but has been tailored to the high dynamic range and precision demands of scientific applications. Our compressor is based on a new, lifted, orthogonal block transform and embedded coding, allowing each per-block bit stream to be truncated at any point if desired, thus facilitating bit rate selection using a single compression scheme. To avoid compression or decompression upon every data access, we employ a software write-back cache of uncompressed blocks. Our compressor has been designed with computational simplicity and speed in mind to allow for the possibility of a hardware implementation, and uses only a small number of fixed-point arithmetic operations per compressed value. We demonstrate the viability and benefits of lossy compression in several applications, including visualization, quantitative data analysis, and numerical simulation
|
| 650 |
|
4 |
|a Journal Article
|
| 773 |
0 |
8 |
|i Enthalten in
|t IEEE transactions on visualization and computer graphics
|d 1996
|g 20(2014), 12 vom: 26. Dez., Seite 2674-83
|w (DE-627)NLM098269445
|x 1941-0506
|7 nnns
|
| 773 |
1 |
8 |
|g volume:20
|g year:2014
|g number:12
|g day:26
|g month:12
|g pages:2674-83
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1109/TVCG.2014.2346458
|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 20
|j 2014
|e 12
|b 26
|c 12
|h 2674-83
|