Efficient 1-pass prediction for volume compression

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The aim is to compress and decompress structured volume graphics in a lossless way. Lossless compression is necessary when the original scans must be preserved. Algorithms must deliver a fair compression ratio, have low run-time and space complexity, and work numerically robust. We have developed PRO to meet the goals. PRO traces runs of voxels in 3D and compensates for noise in the least significant bits by way of using differential pulse-code modulation (DPCM). PRO reduces data to 46% of the original size at best, and 54% on average. A combination of PRO and Worst-Zip (Zip with weakest compression enabled) gives reductions of 34% at best, and 45% on average. The combination takes the same or less time than Best-Zip, and gives 13%, respectively 5%, better results. To conduct the tests, we have written a non-optimised, sequential prototype of PRO, processed CT and MRI scans of different size and content, and measured speed and compression ratio. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Jensen, N., Von Voigt, G., Nejdl, W., & Bernarding, J. (2005). Efficient 1-pass prediction for volume compression. In Lecture Notes in Computer Science (Vol. 3540, pp. 302–311). Springer Verlag. https://doi.org/10.1007/11499145_32

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free