Trajectory simplification method for location-based social networking services

Yukun Chen, Kai Jiang, Yu Zheng, Chunping Li, Nenghai Yu
{"title":"Trajectory simplification method for location-based social networking services","authors":"Yukun Chen, Kai Jiang, Yu Zheng, Chunping Li, Nenghai Yu","doi":"10.1145/1629890.1629898","DOIUrl":null,"url":null,"abstract":"The increasing availabilities of GPS-enabled devices have given rise to the location-based social networking services (LBSN), in which users can record their travel experiences with GPS trajectories and share these trajectories among each other on Web communities. Usually, GPS-enabled devices record far denser points than necessary in the scenarios of GPS-trajectory-sharing. Meanwhile, these redundant points will decrease the performance of LBSN systems and even cause the Web browser crashed. Existing line simplification algorithms only focus on maintaining the shape information of a GPS trajectory while ignoring the corresponding semantic meanings a trajectory implies. In the LBSN, people want to obtain reference knowledge from other users' travel routes and try to follow a specific travel route that interests them. Therefore, the places where a user stayed, took photos, or changed moving direction greatly, etc, would be more significant than other points in presenting semantic meanings of a trajectory. In this paper, we propose a trajectory simplification algorithm (TS), which considers both the shape skeleton and the semantic meanings of a GPS trajectory. The heading change degree of a GPS point and the distance between this point and its adjacent neighbors are used to weight the importance of the point. We evaluated our approach using a new metric called normalized perpendicular distance. As a result, our method outperforms the DP (Douglas-Peuker) algorithm, which is regarded as the best one for line simplification so far.","PeriodicalId":107369,"journal":{"name":"Workshop on Location-based Social Networks","volume":"106 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"90","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Workshop on Location-based Social Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1629890.1629898","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 90

Abstract

The increasing availabilities of GPS-enabled devices have given rise to the location-based social networking services (LBSN), in which users can record their travel experiences with GPS trajectories and share these trajectories among each other on Web communities. Usually, GPS-enabled devices record far denser points than necessary in the scenarios of GPS-trajectory-sharing. Meanwhile, these redundant points will decrease the performance of LBSN systems and even cause the Web browser crashed. Existing line simplification algorithms only focus on maintaining the shape information of a GPS trajectory while ignoring the corresponding semantic meanings a trajectory implies. In the LBSN, people want to obtain reference knowledge from other users' travel routes and try to follow a specific travel route that interests them. Therefore, the places where a user stayed, took photos, or changed moving direction greatly, etc, would be more significant than other points in presenting semantic meanings of a trajectory. In this paper, we propose a trajectory simplification algorithm (TS), which considers both the shape skeleton and the semantic meanings of a GPS trajectory. The heading change degree of a GPS point and the distance between this point and its adjacent neighbors are used to weight the importance of the point. We evaluated our approach using a new metric called normalized perpendicular distance. As a result, our method outperforms the DP (Douglas-Peuker) algorithm, which is regarded as the best one for line simplification so far.
基于位置的社交网络服务的轨迹简化方法
GPS设备的日益普及催生了基于位置的社交网络服务(LBSN),用户可以用GPS轨迹记录自己的旅行经历,并在网络社区中彼此分享这些轨迹。通常,在gps轨迹共享场景中,启用gps的设备记录的点比必要的要密集得多。同时,这些冗余点会降低LBSN系统的性能,甚至导致Web浏览器崩溃。现有的线化简算法只注重保持GPS轨迹的形状信息,而忽略了轨迹所隐含的相应语义。在LBSN中,人们希望从其他用户的旅行路线中获得参考知识,并尝试遵循自己感兴趣的特定旅行路线。因此,用户停留的地点、拍照的地点、移动方向发生较大变化的地点等,在呈现轨迹的语义意义上比其他点更为重要。本文提出了一种同时考虑GPS轨迹形状骨架和语义的轨迹简化算法(TS)。利用GPS点的航向变化程度和该点与相邻点之间的距离来加权该点的重要性。我们用一个叫做归一化垂直距离的新度量来评估我们的方法。结果表明,我们的方法优于DP (Douglas-Peuker)算法,DP算法被认为是目前线化简的最佳算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信