Efficient 1-pass prediction for volume compression

Research output: Chapter in book/report/conference proceedingConference contributionResearchpeer review

Authors

External Research Organisations

  • Otto-von-Guericke University Magdeburg
View graph of relations

Details

Original languageEnglish
Title of host publicationSCIA 2005
Subtitle of host publicationImage Analysis
Pages302-311
Number of pages10
ISBN (electronic)978-3-540-31566-7
Publication statusPublished - 2005
Event14th Scandinavian Conference on Image Analysis, SCIA 2005 - Joensuu, Finland
Duration: 19 Jun 200522 Jun 2005

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Verlag
Volume3540
ISSN (Print)0302-9743

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.

ASJC Scopus subject areas

Cite this

Efficient 1-pass prediction for volume compression. / Jensen, Nils; Von Voigt, Gabriele; Nejdl, Wolfgang et al.
SCIA 2005: Image Analysis. 2005. p. 302-311 (Lecture Notes in Computer Science; Vol. 3540).

Research output: Chapter in book/report/conference proceedingConference contributionResearchpeer review

Jensen, N, Von Voigt, G, Nejdl, W & Bernarding, J 2005, Efficient 1-pass prediction for volume compression. in SCIA 2005: Image Analysis. Lecture Notes in Computer Science, vol. 3540, pp. 302-311, 14th Scandinavian Conference on Image Analysis, SCIA 2005, Joensuu, Finland, 19 Jun 2005. https://doi.org/10.1007/11499145_32
Jensen, N., Von Voigt, G., Nejdl, W., & Bernarding, J. (2005). Efficient 1-pass prediction for volume compression. In SCIA 2005: Image Analysis (pp. 302-311). (Lecture Notes in Computer Science; Vol. 3540). https://doi.org/10.1007/11499145_32
Jensen N, Von Voigt G, Nejdl W, Bernarding J. Efficient 1-pass prediction for volume compression. In SCIA 2005: Image Analysis. 2005. p. 302-311. (Lecture Notes in Computer Science). doi: 10.1007/11499145_32
Jensen, Nils ; Von Voigt, Gabriele ; Nejdl, Wolfgang et al. / Efficient 1-pass prediction for volume compression. SCIA 2005: Image Analysis. 2005. pp. 302-311 (Lecture Notes in Computer Science).
Download
@inproceedings{331e66103c7145b684063c7a9af8ab2a,
title = "Efficient 1-pass prediction for volume compression",
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.",
author = "Nils Jensen and {Von Voigt}, Gabriele and Wolfgang Nejdl and Johannes Bernarding",
year = "2005",
doi = "10.1007/11499145_32",
language = "English",
isbn = "978-3-540-26320-3",
series = "Lecture Notes in Computer Science",
publisher = "Springer Verlag",
pages = "302--311",
booktitle = "SCIA 2005",
note = "14th Scandinavian Conference on Image Analysis, SCIA 2005 ; Conference date: 19-06-2005 Through 22-06-2005",

}

Download

TY - GEN

T1 - Efficient 1-pass prediction for volume compression

AU - Jensen, Nils

AU - Von Voigt, Gabriele

AU - Nejdl, Wolfgang

AU - Bernarding, Johannes

PY - 2005

Y1 - 2005

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

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

UR - http://www.scopus.com/inward/record.url?scp=26444486894&partnerID=8YFLogxK

U2 - 10.1007/11499145_32

DO - 10.1007/11499145_32

M3 - Conference contribution

AN - SCOPUS:26444486894

SN - 978-3-540-26320-3

T3 - Lecture Notes in Computer Science

SP - 302

EP - 311

BT - SCIA 2005

T2 - 14th Scandinavian Conference on Image Analysis, SCIA 2005

Y2 - 19 June 2005 through 22 June 2005

ER -

By the same author(s)