A Quadtree-based Progressive Lossless Compression Technique for Volumetric Data Sets
BibTeX
@MISC{Klajnsek_aquadtree-based,
author = {Gregor Klajnsek and Borut Zalik and Franc Novak and Gregor Papa},
title = {A Quadtree-based Progressive Lossless Compression Technique for Volumetric Data Sets},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
An efficient technique for progressive lossless compression of volumetric data is described. It is based on the quadtree data structure and exploits the expected similarities between the neighboring slices. The proposed approach has better compression ratio than the octree method. A small amount of memory is required since only two slices need to be located in the memory at a time, which makes it suitable for hardware implementation. A built-in compression in volumetric scanners could considerably reduce the transfer and storage requirements for volumetric medical data.
Keyphrases
volumetric data set quadtree-based progressive lossless compression technique neighboring slice octree method expected similarity small amount volumetric medical data progressive lossless compression compression ratio hardware implementation volumetric scanner storage requirement quadtree data structure efficient technique built-in compression volumetric data
