Dictionary Design Algorithms for Vector Map Compression
2002-01-05
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
Dictionary Design Algorithms for Vector Map Compression
Authors
Published Date
2002-01-05
Publisher
Type
Report
Abstract
Vector maps (e.g. road maps) are important in a variety ofapplications including mobile computing. Due to the large size of vector maps, only a small part of maps (e.g. relevant to current location of the vehicle) can be cached in hand-held or in-vehicle devices used for mobile computing. Compression techniques for vector maps can help cache larger subsets of maps and reduce the communicationcosts of downloading newer subsets of maps during travel.Dictionary-based compression technique one common means of data compression. This paper explores the problem of designing dictionaries for dictionary based compression techniques for vector maps. We propose a novel clustering-based dictionary design. The proposed approach adapts the dictionary to a given dataset, yielding better approximation. Experimental evaluation shows that when the dictionary size is fixed, the proposed clustering-based technique achieves better accuracy compared with conventional approaches.
Keywords
Description
Related to
Replaces
License
Series/Report Number
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
Suggested citation
Shekhar, Shashi; Huang, Yan; Djugash, Judy. (2002). Dictionary Design Algorithms for Vector Map Compression. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/215505.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.