Type of Publication: | Journal article |
URI (citable link): | http://nbn-resolving.de/urn:nbn:de:bsz:352-223778 |
Author: | Nguyen, Ky Giang; Saupe, Dietmar |
Year of publication: | 2001 |
Published in: | Computer Graphics Forum ; 20 (2001), 3. - pp. 49-57. - ISSN 0167-7055. - eISSN 1467-8659 |
DOI (citable link): | https://dx.doi.org/10.1111/1467-8659.00497 |
Summary: |
Volume data sets resulting from, e.g., computerized tomography (CT) or magnetic resonance (MR) imaging modalities require enormous storage capacity even at moderate resolution levels. Such large files may require compression for processing in CPU memory which, however, comes at the cost of decoding times and some loss in reconstruction quality with respect to the original data. For many typical volume visualization applications (rendering of volume slices, subvolumes of interest, or isosurfaces) only a part of the volume data needs to be decoded. Thus, efficient compression techniques are needed that provide random access and rapid decompression of arbitrary parts the volume data. We propose a technique which is block based and operates in the wavelet transformed domain. We report performance results which compare favorably with previously published methods yielding large reconstruction quality gains from about 6 to 12 dB in PSNR for a5123 -volume extracted from the Visible Human data set. In terms of compression our algorithm compressed the data 6 times as much as the previous state-of-the-art block based coder for a given PSNR quality.
|
Subject (DDC): | 004 Computer Science |
Link to License: | In Copyright |
NGUYEN, Ky Giang, Dietmar SAUPE, 2001. Rapid high quality compression of volume data for visualization. In: Computer Graphics Forum. 20(3), pp. 49-57. ISSN 0167-7055. eISSN 1467-8659. Available under: doi: 10.1111/1467-8659.00497
@article{Nguyen2001Rapid-22377, title={Rapid high quality compression of volume data for visualization}, year={2001}, doi={10.1111/1467-8659.00497}, number={3}, volume={20}, issn={0167-7055}, journal={Computer Graphics Forum}, pages={49--57}, author={Nguyen, Ky Giang and Saupe, Dietmar} }
<rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:void="http://rdfs.org/ns/void#" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/rdf/resource/123456789/22377"> <dc:language>eng</dc:language> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dcterms:title>Rapid high quality compression of volume data for visualization</dcterms:title> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-04-03T10:11:04Z</dcterms:available> <dc:contributor>Nguyen, Ky Giang</dc:contributor> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:contributor>Saupe, Dietmar</dc:contributor> <dcterms:abstract xml:lang="eng">Volume data sets resulting from, e.g., computerized tomography (CT) or magnetic resonance (MR) imaging modalities require enormous storage capacity even at moderate resolution levels. Such large files may require compression for processing in CPU memory which, however, comes at the cost of decoding times and some loss in reconstruction quality with respect to the original data. For many typical volume visualization applications (rendering of volume slices, subvolumes of interest, or isosurfaces) only a part of the volume data needs to be decoded. Thus, efficient compression techniques are needed that provide random access and rapid decompression of arbitrary parts the volume data. We propose a technique which is block based and operates in the wavelet transformed domain. We report performance results which compare favorably with previously published methods yielding large reconstruction quality gains from about 6 to 12 dB in PSNR for a5123 -volume extracted from the Visible Human data set. In terms of compression our algorithm compressed the data 6 times as much as the previous state-of-the-art block based coder for a given PSNR quality.</dcterms:abstract> <dc:rights>terms-of-use</dc:rights> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-04-03T10:11:04Z</dc:date> <dcterms:bibliographicCitation>Computer Graphics Forum ; 20 (2001), 3. - S. 49-57</dcterms:bibliographicCitation> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/22377/1/Saupe_223778.pdf"/> <dc:creator>Nguyen, Ky Giang</dc:creator> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/> <dcterms:issued>2001</dcterms:issued> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/22377"/> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/22377/1/Saupe_223778.pdf"/> <dc:creator>Saupe, Dietmar</dc:creator> </rdf:Description> </rdf:RDF>
Saupe_223778.pdf | 385 |