Compression and Region-of-Interest Extraction for Large Incomplete Data Sets

Thursday, February 1, 2001 - 3:30pm - 4:30pm
Lind 409
Nicholas Coult (Universität Augsburg)
In this talk I will present an algorithm for the compression of incomplete volumetric data sets. As is often the case with scientific or other real-world data, one must handle three-dimensional volumes of data in which part of the data is missing or invalid; I refer to such data as incomplete. Standard methods for compression of real data would normally perform poorly in this situation. The algorithm I present introduces an extra step of processing to improve the compression performance. This algorithm also has the property that after compression, one may extract a small subset of the data from the compressed file without having to uncompress the whole file simultaneously, an obvious advantage for data sets that are too large too fit in main memory.