{"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}
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.