ACM Home Page
Please provide us with feedback. Feedback
A quadtree dictionary approach to multi-resolution compression
Full text PdfPdf (627 KB)
Source ACM Southeast Regional Conference archive
Proceedings of the 42nd annual Southeast regional conference table of contents
Huntsville, Alabama
SESSION: Special session on mobile computing #1 table of contents
Pages: 11 - 16  
Year of Publication: 2004
ISBN:1-58113-870-9
Author
Rion Dooley  Louisiana State University, Baton Rouge, LA
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 22,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/986537.986541
What is a DOI?

ABSTRACT

As we attempt to harness the power of tomorrow's mobile devices, intelligent information delivery becomes a primary concern. Getting the appropriate data to the resources that need it is referred to as the needs mismatch problem. In this paper we present a lossless multi-resolution compression technique based on a quadtree dictionary (QTD) that achieves 8:1 compression in the worst case. Test results show our method improves upon probabilistic, wavelet, and tree reduction techniques while providing 54:1 compression in the average case.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Dooley, A. Chatterjee, "Mobile ISAW." in Proceedings of the 1st Annual International Conference on Web Service, ICWS '03, June 23--26, Las Vegas, NV, CSREA Press 2003, pages 359--364.
 
2
Minos and Gibbons. Approximate Query Processing: Taming the Terabytes. VLDB 2001. Roma, Italy, September 2001. Available at <u>http://www.belllabs.com/user/minos/Talks/vldb01-tutorial.ppt.</u>
 
3
 
4
Olken, Frank. "Random Sampling from Databases." PhD Dissertation. University of California at Berkeley. 1993. Available at: <u>http://citeseer.nj.nec.com/cache/papers/cs/7292/http:zSzzSzwww.unfortu.netzSzpubzSzdbzSzpostgreszSzpaperszSzUCBPhD-olken.pdf/olken93random.pdf.</u>
 
5
Telephone Interview, Art Schultz of IPNS, Argonne National Lab. March 10, 2003.
 
6
Kopp, M., Lossless Wavelet Based Image Compression with Adaptive 2D Decomposition, Proceedings of the Fourth International Conference in Central Europe on Computer Graphics and Visualization 96 (WSCG96), pp. 141--149, Plzen, 1996. Available at: <u>http://www.cg.tuwien.ac.at/research/TR/95/TR-186-2-95-11Abstract.html.</u>
 
7
Polikar, Robi. "The Wavelet Tutorial." Iowa State University, 2000. Available at <u>http://engineering.rowan.edu/~polikar/WAVELETS/Wttutorial.html.</u>
 
8
 
9
 
10
Ole Moller Nielsen. Parallel Performance of Fast Wavelet Transforms. International Journal of High Speed Computing, June 2000. Available at <u>http://www.imm.dtu.dk/~omni/parwave.pdf.</u>
 
11
 
12
R. Lang, A. Spray. "The 2D Wavelet Transform on a Massively Parallel Machine". Proceedings of the Second Australasian Conference on Parallel and Real-Time Systems (PART'95), Perth, September 1995, pages 325--332. Available at: <u>http://murray.newcastle.edu.au/users/visitors/RobertL/www/files/maspar.ps.gz.</u>
13
14
 
15
J. Ziv and A. Lempel, "A Universal Algorithm for Sequential Data Compression," IEEE Transactions on Information Theory, Vol. 23, pp. 337--342, 1977.
 
16