Jinkwan Park
ABSTRACT
This paper proposes a new method called Virtual Run for extracting the representative trajectories from a set of similar trajectories by readjusting the sequence of movements of vehicles. This method uses convex hull and Euclidean minimum spanning tree to move the trajectory sets, so that it can generate the representative trajectories. Those representative trajectories are used to generate the digital road map which is the final goal of this research. Generally, the well-known Fréchet distance measure is applied to estimate the similarity between a pair of trajectories. However, in this paper, we present that our new method is more effective than the previous methods on the basis of an experiment and evaluation. Also we show the application of generating the digital road map using the presented method. For the evaluation, we collected a set of actual trajectory data from 3,000 taxis in the Gangnam and Seongnam areas. The experimental results show that our approach can solve the problems associated with the special case of loops, which are not clearly solved by the previous approaches. The results also show that our method is capable of generating a digital road map from a set of trajectories.
- P. K. Agarwal, M. de Berg, J. Gao, L. J. Guibas, and S. Har-Peled. Staying in the middle: Exact and approximate medians in r1 and r2 for moving points. In CCCG, pages 43--46, 2005.Google Scholar
- M. Ahmed and C. Wenk. Constructing street networks from gps trajectories. In Algorithms--ESA 2012, pages 60--71. 2012. Google ScholarDigital Library
- H. Alt and M. Godau. Computing the fréchet distance between two polygonal curves. Int. J. of Computational Geometry & Applications, 5(01n02):75--91, 1995.Google ScholarCross Ref
- K. Buchin, M. Buchin, M. Van Kreveld, M. Löffler, R. I. Silveira, C. Wenk, and L. Wiratma. Median trajectories. Algorithmica, 66(3):595--614, 2013.Google ScholarCross Ref
- K. Buchin, M. Buchin, M. Van Kreveld, and J. Luo. Finding long and similar parts of trajectories. Computational Geometry, 44(9):465--476, 2011. Google ScholarDigital Library
- K. Buchin, M. Buchin, and Y. Wang. Exact algorithms for partial curve matching via the fréchet distance. In Proc. of the ACM-SIAM SODA, pages 645--654, 2009. Google ScholarDigital Library
- K. Buchin and W. Mulzer. Delaunay triangulations in o (sort (n)) time and more. J. of ACM, 58(2):6, 2011. Google ScholarDigital Library
- D. Chen, L. J. Guibas, J. Hershberger, and J. Sun. Road network reconstruction for organizing paths. In Proc. of ACM-SIAM SODA, pages 1309--1320, 2010. Google ScholarDigital Library
- A. Efrat, Q. Fan, and S. Venkatasubramanian. Curve matching, time warping, and light fields: New algorithms for computing similarity between curves. J. of Mathematical Imaging and Vision, 27(3):203--216, 2007. Google ScholarDigital Library
- T. Eiter and H. Mannila. Computing discrete fréchet distance. Technical Report 2, June 1991.Google Scholar
- R. L. Graham. An efficient algorith for determining the convex hull of a finite planar set. Information processing letters, 1(4):132--133, 1972.Google Scholar
- S. Karagiorgou and D. Pfoser. On vehicle tracking data-based road network generation. In Proc. of Advances in Geographic Information Systems, pages 89--98, 2012. Google ScholarDigital Library
- J.-G. Lee, J. Han, and K.-Y. Whang. Trajectory clustering: a partition-and-group framework. In Proc. of ACM SIGMOD, pages 593--604, 2007. Google ScholarDigital Library
- S. Sankararaman, P. K. Agarwal, T. Mølhave, and A. P. Boedihardjo. Computing similarity between a pair of trajectories. arXiv:1303.1585, 2013.Google Scholar
- S. Schroedl, K. Wagstaff, S. Rogers, P. Langley, and C. Wilson. Mining gps traces for map refinement. Data mining and knowledge Discovery, 9(1):59--87, 2004. Google ScholarDigital Library
- S. M. Seitz, B. Curless, J. Diebel, D. Scharstein, and R. Szeliski. A comparison and evaluation of multi-view stereo reconstruction algorithms. In IEEE CVPR, volume 1, pages 519--528, 2006. Google ScholarDigital Library
- M. van Kreveld and L. Wiratma. Median trajectories using well-visited regions and shortest paths. In Proc. of the 19th ACM SIGSPATIAL, pages 241--250, 2011. Google ScholarDigital Library
- L. Wiratma. Following the majority: A new algorithm for computing a median trajectory. Master's thesis, Utrecht University, 2010.Google Scholar
Index Terms
- Virtual running of vehicle trajectories for automatic map generation
Recommendations
An unsupervised learning framework for detecting adaptive cruise control operated vehicles in a vehicle trajectory data
AbstractThe traffic dynamics are expected to change with the widespread utilization of advanced driver assistance systems (ADAS). Currently, simulation tools are adopted to capture the impacts of ADAS technologies on traffic dynamics. Real-...
Highlights- An approach to detect Adaptive Cruise Control driven vehicles in trajectory data.
Road extraction method of vehicle trajectory data based on geo-referenced videos
HP3C '22: Proceedings of the 6th International Conference on High Performance Compilation, Computing and CommunicationsWith the increasing use of driving recorder equipment, people need new methods for the analysis of vehicle trajectories. The extraction of road information from vehicle trajectory data is one of the focuses in the field of geographic information. In ...
Prediction of lane change trajectory of autonomous vehicles based on vehicle-environment data fusion
ICBICC '22: Proceedings of the 2022 International Conference on Big Data, IoT, and Cloud ComputingAbstract. Vehicle lane changing is a current research hotspot in the field of autonomous driving. However, the current research does not consider the environmental data of a large number of vehicles as well as the lane change decision risk and lane ...
Comments