共查询到20条相似文献，搜索用时 31 毫秒
1.
Lucas May Petry Carlos Andres Ferrero Luis Otavio Alvares Chiara Renso Vania Bogorny 《Transactions in GIS》2019,23(5):960-975
The large amount of semantically rich mobility data becoming available in the era of big data has led to a need for new trajectory similarity measures. In the context of multiple‐aspect trajectories, where mobility data are enriched with several semantic dimensions, current state‐of‐the‐art approaches present some limitations concerning the relationships between attributes and their semantics. Existing works are either too strict, requiring a match on all attributes, or too flexible, considering all attributes as independent. In this article we propose MUITAS, a novel similarity measure for a new type of trajectory data with heterogeneous semantic dimensions, which takes into account the semantic relationship between attributes, thus filling the gap of the current trajectory similarity methods. We evaluate MUITAS over two real datasets of multiple‐aspect social media and GPS trajectories. With precision at recall and clustering techniques, we show that MUITAS is the most robust measure for multiple‐aspect trajectories. 相似文献
2.
Yujia Xie Meizhen Wang Xuejun Liu Ziran Wang Bo Mao Feiyue Wang Xiaozhi Wang 《Transactions in GIS》2021,25(1):450-467
Current studies on video trajectory retrieval focus on the retrieval and analysis of image content, neglecting the gap between the spatiotemporal continuity of retrieval conditions and the spatiotemporal discontinuity of multi‐camera video trajectories. In this study, we propose a method for the spatiotemporal retrieval of dynamic video object trajectories in geographic scenes. Based on the camera calibration, the proposed method organizes the scene, cameras, and trajectories, constructs the spatiotemporal constraints, and queries the trajectories using two measures: camera‐by‐camera retrieval and global trajectory retrieval. The proposed method was verified through experiments, and the results demonstrate that both measures can query trajectories effectively and reduce the spatiotemporal video review range under different spatiotemporal constraints. Furthermore, compared with camera‐by‐camera retrieval, global trajectory retrieval can reduce the spatiotemporal video review range further and return more accurate results. The proposed method may provide support for the spatial analysis and understanding of surveillance video data. 相似文献
3.
In order to better understand the movement of an object with respect to a region, we propose a formal model of the evolving spatial relationships that transition between local topologies with respect to a trajectory and a region as well as develop a querying mechanism to analyze movement patterns. We summarize 12 types of local topologies built on trajectory‐region intersections, and derive their transition graph; then we capture and model evolving local topologies with two types of trajectory‐region strings, a movement string and a stop‐move string. The stop‐move string encodes the stop information further during a trajectory than the movement string. Such a string‐format expression of trajectory‐region movement, although conceptually simple, carries unprecedented information for effectively interpreting how trajectories move with respect to regions. We also design the corresponding Finite State Automations for a movement string as well as a stop‐move string, which are used not only to recognize the language of trajectory‐region strings, but also to deal effectively with trajectory‐region pattern queries. When annotated with the time information of stops and intersections, a trajectory‐region movement snapshot and its evolution during a time interval can be inferred, and even the relationships among trajectories with respect to the same region can be explored. 相似文献
4.
Integrated compression of vehicle spatio‐temporal trajectories under the road stroke network constraint 
下载免费PDF全文
下载免费PDF全文 With fast growth of all kinds of trajectory datasets, how to effectively manage the trajectory data of moving objects has received a lot of attention. This study proposes a spatio‐temporal data integrated compression method of vehicle trajectories based on stroke paths coding compression under the road stroke network constraint. The road stroke network is first constructed according to the principle of continuous coherence in Gestalt psychology, and then two types of Huffman tree—a road strokes Huffman tree and a stroke paths Huffman tree—are built, based respectively on the importance function of road strokes and vehicle visiting frequency of stroke paths. After the vehicle trajectories are map matched to the spatial paths in the road network, the Huffman codes of the road strokes and stroke paths are used to compress the trajectory spatial paths. An opening window algorithm is used to simplify the trajectory temporal data depicted on a time–distance polyline by setting the maximum allowable speed difference as the threshold. Through analysis of the relative spatio‐temporal relationship between the preceding and latter feature tracking points, the spatio‐temporal data of the feature tracking points are all converted to binary codes together, accordingly achieving integrated compression of trajectory spatio‐temporal data. A series of comparative experiments between the proposed method and representative state‐of‐the‐art methods are carried out on a real massive taxi trajectory dataset from five aspects, and the experimental results indicate that our method has the highest compression ratio. Meanwhile, this method also has favorable performance in other aspects: compression and decompression time overhead, storage space overhead, and historical dataset training time overhead. 相似文献
5.
Andre Salvaro Furtado Despina Kopanaki Luis Otavio Alvares Vania Bogorny 《Transactions in GIS》2016,20(2):280-298
Most existing approaches aiming at measuring trajectory similarity are focused on two‐dimensional sequences of points, called raw trajectories. However, recent proposals have used background geographic information and social media data to enrich these trajectories with a semantic dimension, giving rise to the concept of semantic trajectories. Only a few works have proposed similarity measures for semantic trajectories or multidimensional sequences, having limitations such as predefined weight of the dimensions, sensitivity to noise, tolerance for gaps with different sizes, and the prevalence of the worst dimension similarity. In this article we propose MSM, a novel similarity measure for multidimensional sequences that overcomes the aforementioned limitations by considering and weighting the similarity in all dimensions. MSM is evaluated through an extensive experimental study that, based on a seed trajectory, creates sets of semantic trajectories with controlled transformations to introduce different kinds and levels of dissimilarity. For each set, we compute the similarity between the seed and the transformed trajectories, using different measures. The results showed that MSM was more robust and efficient than related approaches in the domain of semantic trajectories. 相似文献
6.
Traditional local motion simulation focuses largely on avoiding collisions in the next frame. However, due to its lack of forward looking, the global trajectory of agents usually seems unreasonable. As a method of optimizing the overall reward, deep reinforcement learning (DRL) can better correct the problems that exist in the traditional local motion simulation method. In this article, we propose a local motion simulation method integrating optimal reciprocal collision avoidance (ORCA) and DRL, referred to as ORCA‐DRL. The main idea of ORCA‐DRL is to perform local collision avoidance detection via ORCA and smooth the trajectory at the same time via DRL. We use a deep neural network (DNN) as the state‐to‐action mapping function, where the state information is detected by virtual visual sensors and the action space includes two continuous spaces: speed and direction. To improve data utilization and speed up the training process, we use the proximal policy optimization based on the actor–critic (AC) framework to update the DNN parameters. Three scenes (circle, hallway, and crossing) are designed to evaluate the performance of ORCA‐DRL. The results reveal that, compared with the ORCA, our proposed ORCA‐DRL method can: (a) reduce the total number of frames, leading to less time for agents to reach their destination; and (b) effectively avoid local optima, evidenced by smoothed global trajectories. 相似文献
7.
This article studies the analysis of moving object data collected by location‐aware devices, such as GPS, using graph databases. Such raw trajectories can be transformed into so‐called semantic trajectories, which are sequences of stops that occur at “places of interest.” Trajectory data analysis can be enriched if spatial and non‐spatial contextual data associated with the moving objects are taken into account, and aggregation of trajectory data can reveal hidden patterns within such data. When trajectory data are stored in relational databases, there is an “impedance mismatch” between the representation and storage models. Graphs in which the nodes and edges are annotated with properties are gaining increasing interest to model a variety of networks. Therefore, this article proposes the use of graph databases (Neo4j in this case) to represent and store trajectory data, which can thus be analyzed at different aggregation levels using graph query languages (Cypher, for Neo4j). Through a real‐world public data case study, the article shows that trajectory queries are expressed more naturally on the graph‐based representation than over the relational alternative, and perform better in many typical cases. 相似文献
8.
With the increasing use of mobile devices, a lot of tracks of movement of objects are being collected. The advanced trajectory data mining research has allowed the discovery of many types of patterns from these data, like flocks, leadership, avoidance, frequent sequences, and other types of patterns. In this article we introduce a new kind of pattern: a chasing behavior between trajectories. We present the main characteristics of chasing and propose a new method that extracts this new kind of trajectory behavior pattern, considering time, distance, and speed as the main thresholds. Experimental results show that our method finds patterns that are not discovered by related approaches. 相似文献
9.
作为由多种异构终端密集部署在各个地方构成的一种协同自组织的网络应用系统,物联网具有规模巨大、形式复杂、实时异构、形式多样等特点。本文从异构网络互联、多源数据融合、物联数据模型和信息感知应用等4个方面讨论将物联网应用到GIS领域需要解决的基础理论和技术方法,并通过应用实例说明了物联网与GIS技术结合应用实现的技术方法。 相似文献
10.
Vania Bogorny Chiara Renso Artur Ribeiro de Aquino Fernando de Lucca Siqueira Luis Otavio Alvares 《Transactions in GIS》2014,18(1):66-88
Several works have been proposed in the last few years for raw trajectory data analysis, and some attempts have been made to define trajectories from a more semantic point of view. Semantic trajectory data analysis has received significant attention recently, but the formal definition of semantic trajectory, the set of aspects that should be considered to semantically enrich trajectories and a conceptual data model integrating these aspects from a broad sense is still missing. This article presents a semantic trajectory conceptual data model named CONSTAnT, which defines the most important aspects of semantic trajectories. We believe that this model will be the foundation for the design of semantic trajectory databases, where several aspects that make a trajectory “semantic” are taken into account. The proposed model includes the concepts of semantic subtrajectory, semantic points, geographical places, events, goals, environment and behavior, to create a general concept of semantic trajectory. The proposed model is the result of several years of work by the authors in an effort to add more semantics to raw trajectory data for real applications. Two application examples and different queries show the flexibility of the model for different domains. 相似文献
11.
由于数据传输和存储成本的限制,大多数轨迹数据采样率低且不确定,而城市精细模型往往需要高频轨迹数据,例如,微观交通碳排模型需要时间间隔为1 s的轨迹数据。因此,对低频轨迹数据进行高频重构有非常重要的意义。提出了一种顾及交叉路口和车辆模态的轨迹重构方法,采用高频轨迹数据训练车辆运动模态的理论概率模型,结合交叉路口来确定低频轨迹点之间的模态序列,并通过遗传算法求解理论概率模型来完成各模态时间和距离的分配,进而完成轨迹点的高频重构。结果表明,所提方法重构轨迹的均方根误差（root mean square error,RMSE）值相较于传统的数学插值方法降低了62.9%,相较于未考虑交叉路口的模态方法,降低了12.2%。因此,该方法在低频轨迹数据重构中具有很好的应用价值。 相似文献
12.
Providing Geographical Information Systems with mechanisms for processing geo‐data based on their semantics may help to solve problems like heterogeneity. This is because GIS could process geo‐data focusing on their meaning and not on their syntax and/or structure. An important aspect for achieving these objectives is the establishment of an automatic means of correspondence between geo‐data and their conceptualization in Higher Levels Ontologies (HLO). In this article, a new type of Ontology is proposed (Data‐Representation Ontology (DRO)). This Ontology describes the semantic embedded in geo‐data, which cannot be represented in current types of Ontologies. Across this Ontology, heterogeneous geographical data can be integrated in the semantic space contributing positively to the development of solutions for the problems of interoperability between heterogeneous systems. Likewise, we propose a new method for the automatic generation of the DRO and its interrelationships with HLO, based on pattern classification techniques. The experiments show that once the DRO is generated, the classifier can classify all data correctly. Thus, these data are semantically enriched. Moreover, this article shows how the topological relationships can enrich the semantics in the generated Ontology and increase the effectiveness of spatial analysis. 相似文献
13.
This article investigates how workout trajectories from a mobile sports tracking application can be used to provide automatic route suggestions for bicyclists. We apply a Hidden Markov Model (HMM)‐based method for matching cycling tracks to a “bicycle network” extracted from crowdsourced OpenStreetMap (OSM) data, and evaluate its effective differences in terms of optimal routing compared with a simple geometric point‐to‐curve method. OSM has quickly established itself as a popular resource for bicycle routing; however, its high‐level of detail presents challenges for its applicability to popularity‐based routing. We propose a solution where bikeways are prioritized in map‐matching, achieving good performance; the HMM‐based method matched correctly on average 94% of the route length. In addition, we show that the extremely biased nature of the trajectory dataset, which is typical of volunteered user‐generated data, can be of high importance in terms of popularity‐based routing. Most computed routes diverged depending on whether the number of users or number of tracks was used as an indicator of popularity, which may imply varying preferences among different types of cyclists. Revising the number of tracks by diversity of users to surmount local biases in the data had a more limited effect on routing. 相似文献
14.
Adrian A. Borsa Jean-Bernard Minster Bruce G. Bills Helen A. Fricker 《Journal of Geodesy》2007,81(2):157-170
We develop and test an algorithm for modeling and removing elevation error in kinematic GPS trajectories in the context of
a kinematic GPS survey of the salar de Uyuni, Bolivia. Noise in the kinematic trajectory ranges over 15 cm and is highly autocorrelated,
resulting in significant contamination of the topographic signal. We solve for a noise model using crossover differences at
trajectory intersections as constraints in a least-squares inversion. Validation of the model using multiple realizations
of synthetic/simulated noise shows an average decrease in root-mean-square-error (RMSE) by a factor of four. Applying the
model to data from the salar de Uyuni survey, we find that crossover differences drop by a factor of eight (from an RMSE of
5.6 to 0.7 cm), and previously obscured topographic features are revealed in a plan view of the corrected trajectory. We
believe that this algorithm can be successfully adapted to other survey methods that employ kinematic GPS for positioning. 相似文献
15.
In transportation, the trajectory data generated by various mobile vehicles equipped with GPS modules are essential for traffic information mining. However, collecting trajectory data is susceptible to various factors, resulting in the lack and even error of the data. Missing trajectory data could not correctly reflect the actual situation and also affect the subsequent research work related to the trajectory. Although increasing efforts are paid to restore missing trajectory data, it still faces many challenges: (1) the difficulty of data restoration because traffic trajectories are unstructured spatiotemporal data and show complex patterns; and (2) the difficulty of improving trajectory restoration efficiency because traditional trajectory interpolation is computationally arduous. To address these issues, a novel road network constrained spatiotemporal interpolation model, namely Traj2Traj, is proposed in this work to restore the missing traffic trajectory data. The model is constructed with a seq2seq network and integrates a potential factor module to extend environmental factors. Significantly, the model uses a spatiotemporal attention mechanism with the road network constraint to mine the latent information in time and space dimensions from massive trajectory data. The Traj2Traj model completes the road-level restoration according to the entire trajectory information. We present the first attempt to omit the map-matching task when the trajectory is restored to solve the time-consuming problem of map matching. Extensive experiments conducted on the provincial vehicle GPS data sets from April 2018 to June 2018 provided by the Fujian Provincial Department of Transportation show that the Traj2Traj model outperforms the state-of-the-art models. 相似文献
16.
轨迹停留蕴含重要语义信息,其有效提取是开展轨迹Stop/Move模型分析的前提。本文首先依据核密度思想,通过累计邻域点时空贡献来定义轨迹点的停留指数,在此基础上设计了停留指数图,以图形方式直观表达轨迹点的时空聚集程度变化。进一步针对源于停留指数的潜在停留段,提出了一种基于潜在停留段时空临近关系的逐级合并算法,以自动发现和提取停留。试验表明,该算法兼顾停留识别的完整性和准确性,可以有效识别复杂多样的轨迹停留,即使面对噪声严重的轨迹,停留提取的正确率依然较高。 相似文献
17.
Whether it be Smart Cities, Ambient Intelligence, or the Internet of Things, current visions for future urban spaces share a common core, namely the increasing role of distributed sensor networks and the on‐demand integration of their data to power real‐time services and analytics. Some of the greatest hurdles to implementing these visions include security risks, user privacy, scalability, the integration of heterogeneous data, and financial cost. In this work, we propose a crowdsensing mobile‐device platform that empowers citizens to collect and share information about their surrounding environment via embedded sensor technologies. This approach allows a variety of urban areas (e.g., university campuses, shopping malls, city centers, suburbs) to become equipped with a free ad‐hoc sensor network without depending on proprietary instrumentation. We present a framework, namely the GeoTracer application, as a proof‐of‐concept to conduct multiple experiments simulating use‐case scenarios on a university campus. First, we demonstrate that ambient sensors (e.g. temperature, pressure, humidity, magnetism, illuminance, and audio) can help determine a change in environment (e.g. moving from indoors to outdoors, or floor changes inside buildings) more accurately than typical positioning technologies (e.g. global navigation satellite system, Wi‐Fi, etc.). Furthermore, each of these sensors contributes a different amount of data to detecting events. for example, illuminance has the highest information gain when trying to detect changes between indoors and outdoors. Second, we show that through this platform it is possible to detect and differentiate place types on a university campus based on inferences made through ambient sensors. Lastly, we train classifiers to determine the activities that a place can afford at different times (e.g. good for studying or not, basketball courts in use or empty) based on sensor‐driven semantic signatures. 相似文献
18.
Crowdsourcing the character of a place: Character‐level convolutional networks for multilingual geographic text classification 下载免费PDF全文
下载免费PDF全文 This article presents a new character‐level convolutional neural network model that can classify multilingual text written using any character set that can be encoded with UTF‐8, a standard and widely used 8‐bit character encoding. For geographic classification of text, we demonstrate that this approach is competitive with state‐of‐the‐art word‐based text classification methods. The model was tested on four crowdsourced data sets made up of Wikipedia articles, online travel blogs, Geonames toponyms, and Twitter posts. Unlike word‐based methods, which require data cleaning and pre‐processing, the proposed model works for any language without modification and with classification accuracy comparable to existing methods. Using a synthetic data set with introduced character‐level errors, we show it is more robust to noise than word‐level classification algorithms. The results indicate that UTF‐8 character‐level convolutional neural networks are a promising technique for georeferencing noisy text, such as found in colloquial social media posts and texts scanned with optical character recognition. However, word‐based methods currently require less computation time to train, so currently are preferable for classifying well‐formatted and cleaned texts in single languages. 相似文献
19.
Mobile user identification aims at matching different mobile devices of the same user using trajectory data, which has attracted extensive research in recent years. Most of the previous work extracted trajectory features based on regular grids, which will lead to incorrect feature representation due to lack of geographic information. Besides, most trajectory similarity models only considered one single distance measure to calculate the similarity between users, which ignore the connection between different distance measures and may lead to some false matches. In light of this, we present a novel user identification method based on road networks and multiple distance measures in this article. The proposed method segments a city map into several grids and road segments based on road networks. Then it extracts location and road information of trajectories to jointly construct user features. Multiple distance measures are fused by a discriminant model to improve the effect of user identification. Experiments on real GPS trajectory datasets show that our proposed method outperforms related similarity measure methods and is stable for mobile user identification. Meanwhile, our method can also achieve good identification results even on sparse trajectory datasets. 相似文献
20.
个体位置预测在传染病精准防控、公共设施科学规划等应用中具有重要意义,既有位置预测算法主要侧重对个体纵向历史轨迹特征进行挖掘建模,从而实现位置预测,对横向相似性用户的规律特性考虑较少。因此,基于图卷积和长短期记忆模型（long short-term memory,LSTM）框架,提出顾及横向相似用户轨迹特征以及纵向历史规律性特征的个体位置预测算法。首先,构建用户轨迹相似性算法并筛选高相似度用户;然后,利用图卷积模型提取待预测用户相似高的用户轨迹特征;最后,利用LSTM框架提取历史轨迹特征,集成相似用户轨迹特征,从而实现个体位置预测。基于某市8万多个用户连续4个工作日的数据进行实验,结果表明,所提算法的准确率随预测时间步长增加而下降,而夜间预测准确率明显高于白天,但相比于既有模型均有10%以上提高;以15 min为预测时间步长时,模型准确率达80.45%。 相似文献