• Journal of the Korea Institute of Military Science and Technology
• /
• v.20 no.6
• /
• pp.774-780
• /
• 2017

The techniques for driving trajectory calculation and driving trajectory distribution calculation are proposed to analyze the durability of ground vehicles effectively. To achieve this aim, the driving trajectory of a vehicle and the driving trajectory distribution of that are needed, in addition to road profile. The road profiles can be measured by a profilometer but a driving trajectory of a vehicle cannot be acquired effectively due to a large position error from a conventional GPS sensor. Therefore two techniques are proposed to reduce the position error of a vehicle and achieve the distribution of driving trajectory of that. The driving trajectory calculation technique produces relative positions by using the velocity, time and heading of a vehicle. The driving trajectory distribution calculation technique produces distributions of the driving trajectory by using axis transformation, estimating reference line, dividing sectors and plotting a histogram of the sectors. As a results of this study, we can achieve the considerably accurate driving trajectory and driving trajectory distribution of a vehicle.

• Journal of the Korea Society of Computer and Information
• /
• v.27 no.8
• /
• pp.61-68
• /
• 2022

In this paper, we propose a system to predict the GPS trajectory of a pedestrian based on a deep learning model. Pedestrian trajectory prediction is a study that can prevent pedestrian danger and collision situations through notifications, and has an impact on business such as various marketing. In addition, it can be used not only for pedestrians but also for path prediction of unmanned transportation, which is receiving a lot of spotlight. Among various trajectory prediction methods, this paper is a study of trajectory prediction using GPS data. It is a deep learning model-based study that predicts the next route by learning the GPS trajectory of pedestrians, which is time series data. In this paper, we presented a data set construction method that allows the deep learning model to learn the GPS route of pedestrians, and proposes a trajectory prediction deep learning model that does not have large restrictions on the prediction range. The parameters suitable for the trajectory prediction deep learning model of this study are presented, and the model's test performance are presented.

• Journal of Korea Multimedia Society
• /
• v.19 no.8
• /
• pp.1636-1645
• /
• 2016

In navigation systems that use collected trajectory for routing, the number and diversity of trajectory data are crucial despite the infeasible limitation which is that all routes should be collected in person. This paper suggests an algorithm combining trajectories only by collected GPS data and generating new routes for solving this problem. Using distance between two trajectories, the algorithm estimates road intersection, in which it also predicts the correlated direction of them with geographical coordinates and makes a decision to combine them by the correlated direction. With combined and generated trajectory data, this combination way allows trajectory-based navigation to guide more and better routes. In our study, this solution has been introduced. However, the ways in which correlated direction is decided and post-process works have been revised to use the sequential pattern of triangles' area GPS information between two trajectories makes in road intersection and intersection among sets comprised of GPS points. This, as a result, reduces unnecessary combinations resulting redundant outputs and enhances the accuracy of estimating correlated direction than before.

• Journal of KIISE
• /
• v.43 no.1
• /
• pp.40-46
• /
• 2016

Digital road map generation is primarily based on artificial satellite photographing or in-site manual survey work. Therefore, these map generation procedures require a lot of time and a large budget to create and update road maps. Consequently, people have tried to develop automated map generation systems using GPS trajectory data sets obtained by public vehicles. A fundamental problem in this road generation procedure involves the extraction of representative trajectory such as main roads. Extracting a representative trajectory requires the base data set of piecewise line segments(GPS-trajectories), which have close starting and ending points. So, geometrically similar trajectories are selected for clustering before extracting one representative trajectory from among them. This paper proposes a new divide- and-conquer approach by partitioning the whole map region into regular grid sub-spaces. We then try to find similar trajectories by sweeping. Also, we applied the $Fr{\acute{e}}chet$ distance measure to compute the similarity between a pair of trajectories. We conducted experiments using a set of real GPS data with more than 500 vehicle trajectories obtained from Gangnam-gu, Seoul. The experiment shows that our grid partitioning approach is fast and stable and can be used in real applications for vehicle trajectory clustering.

• Journal of KIISE
• /
• v.43 no.4
• /
• pp.404-410
• /
• 2016

Automated road map generation poses significant research challenges since GPS-based navigation systems prevail in most general vehicles. This paper proposes an automated detecting method for intersection points using GPS vehicle trajectory data without any background digital map information. The proposed method exploits the fact that the trajectories are generally split into several branches at an intersection point. One problem in previous work on this intersection detecting is that those approaches require stopping points and direction changes for every testing vehicle. However our approach does not require such complex auxiliary information for intersection detecting. Our method is based on partial trajectory matching among trajectories since a set of incoming trajectories split other trajectory cluster branches at the intersection point. We tested our method on a real GPS data set with 1266 vehicles in Gangnam District, Seoul. Our experiment showed that the proposed method works well at some bigger intersection points in Gangnam. Our system scored 75% sensitivity and 78% specificity according to the test data. We believe that more GPS trajectory data would make our system more reliable and applicable in a practice.

• Journal of Information Processing Systems
• /
• v.13 no.3
• /
• pp.533-545
• /
• 2017

Massive volumes of GPS trajectory data bring challenges to storage and processing. These issues can be addressed by compression algorithm which can reduce the size of the trajectory data. A key requirement for GPS trajectory compression algorithm is to reduce the size of the trajectory data while minimizing the loss of information. Synchronized Euclidean distance (SED) as an important error measure is adopted by most of the existing algorithms. In order to further reduce the SED error, an improved algorithm for open window time ratio (OPW-TR) called local optimum open window time ratio (LO-OPW-TR) is proposed. In order to make SED error smaller, the anchor points are selected by calculating point's accumulated synchronized Euclidean distance (ASED). A variety of error metrics are used for the algorithm evaluation. The experimental results show that the errors of our algorithm are smaller than the existing algorithms in terms of SED and speed errors under the same compression ratio.

• KIPS Transactions on Software and Data Engineering
• /
• v.4 no.10
• /
• pp.439-446
• /
• 2015

Recently, semantic trajectories which combine GPS positions and POIs(Point of Interests) become more popular in order to expand location based services. To construct semantic trajectories, the existing algorithms exploit the extent information of POIs described as polygons and find overlapping regions between GPS positions and the extents. However, the algorithms are not applicable in the condition where the extent information is not provided such as in Google Map, Naver Map, OpenStreetMap and most of the open geographic information systems. In this paper, we provide a novel algorithm to construct semantic trajectories only with GPS positions and POI points but without POI extents.

• The Journal of the Convergence on Culture Technology
• /
• v.1 no.1
• /
• pp.79-85
• /
• 2015

According to the growing use of the personal GPS in the mobile device recently, the LBS (Local bases service), which processes and refines the GPS information, such as a position-tracking service, a public safety service, a local based information service, has increased steadily. Due to the refraction or reflection of GPS, however, it is impossible to use GPS around or in buildings. Therefore, it is necessary to correct the errors of GPS. We propose the method which corrects the errors of GPS and creates the refined trajectory using intersection region indexing. After analyzing the trajectory, receiving trajectories from many people and identifying the similarity between of trajectories, we will recommend the favorite route and useful information such as restaurant, convenience store, bus station and emergency call service.

• Journal of Positioning, Navigation, and Timing
• /
• v.4 no.3
• /
• pp.123-130
• /
• 2015

In this study, a carrier smoothed global positioning system / dead reckoning (CSGPS/DR) integrated system for high-precision trajectory estimation for the purpose of vehicle navigation was proposed. Existing code-based GPS has a low position accuracy, and carrier-phase differential global positioning system (CPDGPS) has a long waiting time for high-precision positioning and has a problem of high cost due to the establishment of infrastructure. To resolve this, the continuity of a trajectory was guaranteed by integrating CSGPS and DR. The results of the experiment indicated that the trajectory precision of the code-based GPS showed an error performance of more than 30cm, while that of the CSGPS/DR integrated system showed an error performance of less than 10cm. Based on this, it was found that the trajectory precision of the proposed CSGPS/DR integrated system is superior to that of the code-based GPS.

• KIISE Transactions on Computing Practices
• /
• v.22 no.9
• /
• pp.419-425
• /
• 2016

In navigator systems, keeping map data up-to-date is an important task. Manual update involves a substantial cost and it is difficult to achieve immediate reflection of changes with manual updates. In this paper, we present a method for trajectory-center extraction, which is essential for automatic road map generation with GPS data. Though clustered trajectories are necessary to extract the center road, real trajectories are not clustered. To address this problem, this paper proposes a new method using the maximum overlapping interval and trajectory clustering. Finally, we apply the Virtual Running method to extract the center road from the clustered trajectories. We conducted experiments on real massive taxi GPS data sets collected throughout Gang-Nam-Gu, Sung-Nam city and all parts of Seoul city. Experimental results showed that our method is stable and efficient for extracting the center trajectory of real roads.