{"title":"矢量映射压缩累进传输","authors":"Alexander Kolesnikov","doi":"10.1109/ICDIM.2007.4444204","DOIUrl":null,"url":null,"abstract":"Problem of progressive transmission of large vector maps from spatial information systems to clients by channels with narrow bandwidth is considered. At first, the simplified version of the vector map is sent to client and the client can manipulate with the data at the coarse resolution level and request finer version of the map. The proposed algorithm includes optimal multiresolution polygonal approximation with quantization and lossless compression of quantized data with arithmetic codes. Proposed approach demonstrated high compression performance with heuristic Douglas-Peucker and optimal minimal-bitrate algorithms.","PeriodicalId":198626,"journal":{"name":"2007 2nd International Conference on Digital Information Management","volume":"102 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Vector maps compression for progressive transmission\",\"authors\":\"Alexander Kolesnikov\",\"doi\":\"10.1109/ICDIM.2007.4444204\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Problem of progressive transmission of large vector maps from spatial information systems to clients by channels with narrow bandwidth is considered. At first, the simplified version of the vector map is sent to client and the client can manipulate with the data at the coarse resolution level and request finer version of the map. The proposed algorithm includes optimal multiresolution polygonal approximation with quantization and lossless compression of quantized data with arithmetic codes. Proposed approach demonstrated high compression performance with heuristic Douglas-Peucker and optimal minimal-bitrate algorithms.\",\"PeriodicalId\":198626,\"journal\":{\"name\":\"2007 2nd International Conference on Digital Information Management\",\"volume\":\"102 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 2nd International Conference on Digital Information Management\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICDIM.2007.4444204\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 2nd International Conference on Digital Information Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDIM.2007.4444204","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Vector maps compression for progressive transmission
Problem of progressive transmission of large vector maps from spatial information systems to clients by channels with narrow bandwidth is considered. At first, the simplified version of the vector map is sent to client and the client can manipulate with the data at the coarse resolution level and request finer version of the map. The proposed algorithm includes optimal multiresolution polygonal approximation with quantization and lossless compression of quantized data with arithmetic codes. Proposed approach demonstrated high compression performance with heuristic Douglas-Peucker and optimal minimal-bitrate algorithms.