一种多源轨迹实时相似度度量模型

Lu Sun, W. Zhou, Baichen Jiang, J. Guan
{"title":"一种多源轨迹实时相似度度量模型","authors":"Lu Sun, W. Zhou, Baichen Jiang, J. Guan","doi":"10.1109/CIIS.2017.60","DOIUrl":null,"url":null,"abstract":"In order to solve the problem that the similarity of asynchronous multi-source multi-track cannot be measured effectively, a new trajectory similarity model for asynchronous multi-source multi-track is proposed in this paper. Based on the idea of searching the potential matched data points under the spatial and temporal constraints, the optimal matched point is determined from the sets of nearly matched points by setting a certain spatial threshold and temporal threshold, and the similarity measure between multi-source trajectories is obtained. The spatial and temporal relation between potential matched points from multi-source trajectories has been totally considered. The temporal slots between potential mapped points are allowed, reducing the complexity sharply and ensuring the trajectory mapping accuracy. The application to a real data set shows that the model can evaluate the similarity of multi-source trajectory effectively, and its time cost is lower than traditional methods.","PeriodicalId":254342,"journal":{"name":"2017 International Conference on Computing Intelligence and Information System (CIIS)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A Real-Time Similarity Measure Model for Multi-source Trajectories\",\"authors\":\"Lu Sun, W. Zhou, Baichen Jiang, J. Guan\",\"doi\":\"10.1109/CIIS.2017.60\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In order to solve the problem that the similarity of asynchronous multi-source multi-track cannot be measured effectively, a new trajectory similarity model for asynchronous multi-source multi-track is proposed in this paper. Based on the idea of searching the potential matched data points under the spatial and temporal constraints, the optimal matched point is determined from the sets of nearly matched points by setting a certain spatial threshold and temporal threshold, and the similarity measure between multi-source trajectories is obtained. The spatial and temporal relation between potential matched points from multi-source trajectories has been totally considered. The temporal slots between potential mapped points are allowed, reducing the complexity sharply and ensuring the trajectory mapping accuracy. The application to a real data set shows that the model can evaluate the similarity of multi-source trajectory effectively, and its time cost is lower than traditional methods.\",\"PeriodicalId\":254342,\"journal\":{\"name\":\"2017 International Conference on Computing Intelligence and Information System (CIIS)\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 International Conference on Computing Intelligence and Information System (CIIS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIIS.2017.60\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 International Conference on Computing Intelligence and Information System (CIIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIIS.2017.60","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

为了解决异步多源多航迹相似度无法有效测量的问题,提出了一种新的异步多源多航迹轨迹相似度模型。基于在时空约束下寻找潜在匹配数据点的思路,通过设置一定的空间阈值和时间阈值,从接近匹配的数据点集合中确定最优匹配点,并获得多源轨迹之间的相似度度量。充分考虑了多源轨迹潜在匹配点之间的时空关系。允许潜在映射点之间的时间间隙,大大降低了复杂性,保证了轨迹映射的精度。在实际数据集上的应用表明,该模型能有效地评估多源轨迹的相似度,且时间成本低于传统方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A Real-Time Similarity Measure Model for Multi-source Trajectories
In order to solve the problem that the similarity of asynchronous multi-source multi-track cannot be measured effectively, a new trajectory similarity model for asynchronous multi-source multi-track is proposed in this paper. Based on the idea of searching the potential matched data points under the spatial and temporal constraints, the optimal matched point is determined from the sets of nearly matched points by setting a certain spatial threshold and temporal threshold, and the similarity measure between multi-source trajectories is obtained. The spatial and temporal relation between potential matched points from multi-source trajectories has been totally considered. The temporal slots between potential mapped points are allowed, reducing the complexity sharply and ensuring the trajectory mapping accuracy. The application to a real data set shows that the model can evaluate the similarity of multi-source trajectory effectively, and its time cost is lower than traditional methods.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Network Traffic Anomaly Detection Based on Dynamic Programming Study on the Robustness Based on PID Fuzzy Controller The Best Performance Evaluation of Encryption Algorithms to Reduce Power Consumption in WSN Non-redundant Distributed Database Allocation Technology Research Research and Implementation Based on Three-Dimensional Model Watermarking Algorithm
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1