By Topic

A distributed quadtree dictionary approach to multi-resolution compression

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
R. Dooley ; Dept. of Comput. Sci., Louisiana State Univ., Baton Rouge, LA, USA

We have developed a distributed quadtree dictionary (DQTD) algorithm, which allows lossless, multiresolution compression of single-crystal diffractometer (SCD) datasets from the Argonne National Laboratory in Chicago, IL. This is of prime importance to high-energy physicists who need to manipulate and visualize SCD datasets, but cannot due to their overwhelming memory requirements. Distributing a quadtree dictionary necessarily introduces redundancy to what was previously a minimal QTD. We have developed a method to reduce the tree redundancy in the QTD, thereby providing a tighter upper bound on the size of our QTD. We compare the DQTD algorithm with a distributed square wavelet transform (SWT). Experimental results on three sample 1GB SCD datasets show that, on a level-by-level basis, our algorithm performs no worse than SWT in terms of energy conservation and adjusted energy conservation, while providing 59:1 overall compression in the average case.

Published in:

Information Technology: Coding and Computing, 2004. Proceedings. ITCC 2004. International Conference on  (Volume:2 )

Date of Conference:

5-7 April 2004