Context-Based Moving Object Trajectory Uncertainty Reduction and Ranking in Road Network

To support a large amount of GPS data generated from various moving objects, the back-end servers usually store low-sampling-rate trajectories. Therefore, no precise position information can be obtained directly from the back-end servers and uncertainty is an inherent characteristic of the spatio-temporal data. How to deal with the uncertainty thus becomes a basic and challenging problem. A lot of researches have been rigidly conducted on the uncertainty of a moving object itself and isolated from the context where it is derived. However, we discover that the uncertainty of moving objects can be efficiently reduced and effectively ranked using the context-aware information. In this paper, we focus on context- aware information and propose an integrated framework, Context-Based Uncertainty Reduction and Ranking （CURR）, to reduce and rank the uncertainty of trajectories. Specifically, given two consecutive samplings, we aim to infer and rank the possible trajectories in accordance with the information extracted from context. Since some context-aware information can be used to reduce the uncertainty while some context-aware information can be used to rank the uncertainty, to leverage them accordingly, CURR naturally consists of two stages： reduction stage and ranking stage which complement each other. We also implement a prototype system to validate the effectiveness of our solution. Extensive experiments are conducted and the evaluation results demonstrate the efficiency and high accuracy of CURR.

Automatic Lane-Level Intersection Map Generation using Low-Channel Roadside LiDAR

A lane-level intersection map is a cornerstone in high-definition(HD) traffic network maps for autonomous driving and high-precision intelligent transportation systems applications such as traffic management and control, and traffic accident evaluation and prevention. Mapping an HD intersection is time-consuming, labor-intensive, and expensive with conventional methods. In this paper, we used a low-channel roadside light detection and range sensor(LiDAR) to automatically and dynamically generate a lane-level intersection, including the signal phases, geometry, layout, and lane directions. First, a mathematical model was proposed to describe the topology and detail of a lane-level intersection. Second, continuous and discontinuous traffic object trajectories were extracted to identify the signal phases and times. Third, the layout, geometry, and lane direction were identified using the convex hull detection algorithm for trajectories. Fourth, a sliding window algorithm was presented to detect the lane marking and extract the lane, and the virtual lane connecting the inbound and outbound of the intersection were generated using the vehicle trajectories within the intersection and considering the traffic rules. In the field experiment, the mean absolute estimation error is 2 s for signal phase and time identification. The lane marking identification Precision and Recall are96% and 94.12%, respectively. Compared with the satellite-based,MMS-based, and crowdsourcing-based lane mapping methods,the average lane location deviation is 0.2 m and the update period is less than one hour by the proposed method with low-channel roadside LiDAR.

Efficient κ-Nearest-Neighbor Search Algorithms for Historical Moving Object Trajectories

Nearest Neighbor （κNN） search is one of the most important operations in spatial and spatio-temporal databases. Although it has received considerable attention in the database literature, there is little prior work on κNN retrieval for moving object trajectories. Motivated by this observation, this paper studies the problem of efficiently processing κNN （κ≥ 1） search on R-tree-like structures storing historical information about moving object trajectories. Two algorithms are developed based on best-first traversal paradigm, called BFPκNN and BFTκNN, which handle the κNN retrieval with respect to the static query point and the moving query trajectory, respectively. Both algorithms minimize the number of node access, that is, they perform a single access only to those qualifying nodes that may contain the final result. Aiming at saving main-memory consumption and reducing CPU cost further, several effective pruning heuristics are also presented. Extensive experiments with synthetic and real datasets confirm that the proposed algorithms in this paper outperform their competitors significantly in both efficiency and scalability.