Fast Random Access to Wavelet Compressed Volumetric Data Using Hashing
AbstractWe present a new approach to lossy storage of the coefficients of wavelet transformed data. While it is common to store the coefficients of largest magnitude (and let all other coefficients be zero), we allow a slightly different set of coefficients to be stored. This brings into play a recently proposed hashing technique that allows space efficient storage and very efficient retrieval of coefficients. Our approach is applied to compression of volumetric data sets. For the ``Visible Man'' volume we obtain up to 80% improvement in compression ratio over previously suggested schemes. Further, the time for accessing a random voxel is quite competitive.
How to Cite
Rodler, F. F., & Pagh, R. (2001). Fast Random Access to Wavelet Compressed Volumetric Data Using Hashing. BRICS Report Series, 8(34). https://doi.org/10.7146/brics.v8i34.21694
Articles published in DAIMI PB are licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.