The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Fixed-Rate Compressed Floating-Point Arrays
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A new, fast, and efficient image codec based on set partitioning in hierarchical trees
Said, A., & Pearlman, W. A. (1996) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/76.499834 · Cited by 5,353
Embedded image coding using zerotrees of wavelet coefficients
Shapiro, J. M. (1993) · IEEE Transactions on Signal Processing · doi:10.1109/78.258085 · Cited by 4,815
Factoring wavelet transforms into lifting steps
Daubechies, I., & Sweldens, W. (2005) · Lecture Notes in Earth Sciences · doi:10.1007/bfb0011095 · Cited by 2,015
Factoring wavelet transforms into lifting steps
Daubechies, I., & Sweldens, W. (1998) · The Journal of Fourier Analysis and Applications · doi:10.1007/bf02476026 · Cited by 1,858
Comparing Clusterings by the Variation of Information
Meilă, M. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45167-9_14 · Cited by 604
Engel, K., Hadwiger, M., Kniss, J., Rezk-Salama, C., & Weiskopf, D. (2006) · A K Peters/CRC Press eBooks · doi:10.1201/b10629 · Cited by 575
Fast and Efficient Compression of Floating-Point Data
Lindstrom, P., & Isenburg, M. (2006) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2006.143 · Cited by 442
Self-citationExploring Traditional and Emerging Parallel Programming Models Using a Proxy Application
Karlin, I., Bhatele, A., Keasler, J., Chamberlain, B. L., Cohen, J., Devito, Z., Haque, R., Laney, D., Luke, E., Wang, F., et al. (2013) · 2013 IEEE 27th International Symposium on Parallel and Distributed Processing · doi:10.1109/ipdps.2013.115 · Cited by 194
Fast Lossless Compression of Scientific Floating-Point Data
Ratanaworabhan, P., Ke, J., & Burtscher, M. (2006) · Data Compression Conference (DCC'06) · doi:10.1109/dcc.2006.35 · Cited by 159
Compression domain volume rendering
Schneider, J., & Westermann, R. (2003) · Visualization · doi:10.1109/visual.2003.1250385 · Cited by 158
i PACKMAN: high-quality, low-complexity texture compression for mobile phones
Ström, J., & Akenine‐Möller, T. (2005) · Eurographics Conference on Graphics Hardware · doi:10.1145/1071866.1071877 · Cited by 122
A methodology for evaluating the impact of data compression on climate simulation data
Baker, A. H., Xu, H., Dennis, J. M., et al. (2014) · ACM International Symposium on High-Performance Parallel and Distributed Computing (HPDC) · doi:10.1145/2600212.2600217 · Cited by 95
Vector quantization for volume rendering
Ning, P., & Hesselink, L. (1992) · doi:10.1145/147130.147152 · Cited by 77
Graphics Processing Units for Handhelds
Akenine‐Möller, T., & Ström, J. (2008) · Proceedings of the IEEE · doi:10.1109/jproc.2008.917719 · Cited by 70
Transform Coding for Hardware-accelerated Volume Rendering
Fout, N., & Ma, K. (2007) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2007.70516 · Cited by 65
Computing Morse-Smale Complexes with Accurate Geometry
Gyulassy, A. G., Bremer, P., & Pascucci, V. (2012) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2012.209 · Cited by 51
Cited by
What is the State of Neural Network Pruning?
Blalock, D., Ortiz, J. J. G., Frankle, J., & Guttag, J. (2020) · arXiv · doi:10.48550/arxiv.2003.03033 · Cited by 560
Tao, D., Di, S., Chen, Z., & Cappello, F. (2017) · 2017 IEEE International Parallel and Distributed Processing Symposium (IPDPS) · doi:10.1109/ipdps.2017.115 · Cited by 292
Metadata
- Authors
- Lindstrom, P.
- Venue
- IEEE Transactions on Visualization and Computer Graphics
- Published
- 2014-12-31
- Volume
- 20
- Issue
- 12
- Pages
- 2674-2683
- ISSN
- 1077-2626 (ISSN-L)
- 1941-0506
- 2160-9306
- OpenAlex
- W2052440657
- Cited by
- 676
- References
- 16
- FWCI
- 14.24
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.