一种时空数据压缩算法

Lei Wang, Yiming Guo, Chen Chen, Yaowei Yan
{"title":"一种时空数据压缩算法","authors":"Lei Wang, Yiming Guo, Chen Chen, Yaowei Yan","doi":"10.1109/MINES.2012.47","DOIUrl":null,"url":null,"abstract":"This paper introduces a new line-simplification algorithm to compress spatio-temporal data. Line-simplification is an effective method, which is generally applied in compressing linear features data by throwing away some redundant spatiotemporal points to preserve the shape of original line. We evaluate our algorithm's performance by comparing with some other line-simplification algorithms. By comprehensive analysis of experiments data, we find that our algorithm get a good result in compression ratio. Also, this algorithm costs less compression time and attains an excellent reconstruction in some situations.","PeriodicalId":208089,"journal":{"name":"2012 Fourth International Conference on Multimedia Information Networking and Security","volume":"56 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A Spatio-temporal Data Compression Algorithm\",\"authors\":\"Lei Wang, Yiming Guo, Chen Chen, Yaowei Yan\",\"doi\":\"10.1109/MINES.2012.47\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper introduces a new line-simplification algorithm to compress spatio-temporal data. Line-simplification is an effective method, which is generally applied in compressing linear features data by throwing away some redundant spatiotemporal points to preserve the shape of original line. We evaluate our algorithm's performance by comparing with some other line-simplification algorithms. By comprehensive analysis of experiments data, we find that our algorithm get a good result in compression ratio. Also, this algorithm costs less compression time and attains an excellent reconstruction in some situations.\",\"PeriodicalId\":208089,\"journal\":{\"name\":\"2012 Fourth International Conference on Multimedia Information Networking and Security\",\"volume\":\"56 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-11-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 Fourth International Conference on Multimedia Information Networking and Security\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MINES.2012.47\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Fourth International Conference on Multimedia Information Networking and Security","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MINES.2012.47","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

本文介绍了一种新的压缩时空数据的线化简算法。线化简是一种有效的压缩线性特征数据的方法,通常通过去除冗余的时空点来保持原始线的形状。我们通过与其他一些线化简算法的比较来评估我们的算法的性能。通过对实验数据的综合分析,我们发现我们的算法在压缩比方面取得了很好的效果。该算法压缩时间短,在某些情况下具有较好的重构效果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Spatio-temporal Data Compression Algorithm
This paper introduces a new line-simplification algorithm to compress spatio-temporal data. Line-simplification is an effective method, which is generally applied in compressing linear features data by throwing away some redundant spatiotemporal points to preserve the shape of original line. We evaluate our algorithm's performance by comparing with some other line-simplification algorithms. By comprehensive analysis of experiments data, we find that our algorithm get a good result in compression ratio. Also, this algorithm costs less compression time and attains an excellent reconstruction in some situations.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信