Title : 
A distributed quadtree dictionary approach to multi-resolution compression
         
        
        
            Author_Institution : 
Dept. of Comput. Sci., Louisiana State Univ., Baton Rouge, LA, USA
         
        
        
        
        
        
            Abstract : 
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.
         
        
            Keywords : 
data compression; image coding; image resolution; quadtrees; redundancy; wavelet transforms; Argonne National Laboratory; SCD datasets; distributed quadtree dictionary approach; multiresolution compression; single-crystal diffractometer; square wavelet transform; Dictionaries; Diffraction; Energy conservation; Energy resolution; Laboratories; Neutrons; Partitioning algorithms; Upper bound; Visualization; Wavelet transforms;
         
        
        
        
            Conference_Titel : 
Information Technology: Coding and Computing, 2004. Proceedings. ITCC 2004. International Conference on
         
        
            Print_ISBN : 
0-7695-2108-8
         
        
        
            DOI : 
10.1109/ITCC.2004.1286619