• International Journal of Computer Science & Network Security
• /
• v.21 no.6
• /
• pp.207-212
• /
• 2021

Clustering Unlabeled Spatial-datasets to convert them to Labeled Spatial-datasets is a challenging task specially for geographical information systems. In this research study we investigated the NYC Taxi Limousine Commission dataset and discover that all of the spatial-temporal trajectory are unlabeled Spatial-datasets, which is in this case it is not suitable for any data mining tasks, such as classification and regression. Therefore, it is necessary to convert unlabeled Spatial-datasets into labeled Spatial-datasets. In this research study we are going to use the Clustering Technique to do this task for all the Trajectory datasets. A key difficulty for applying machine learning classification algorithms for many applications is that they require a lot of labeled datasets. Labeling a Big-data in many cases is a costly process. In this paper, we show the effectiveness of utilizing a Clustering Technique for labeling spatial data that leads to a high-accuracy classifier.

• KIISE Transactions on Computing Practices
• /
• v.21 no.2
• /
• pp.101-108
• /
• 2015

This paper presents the implementation of a system that recommends empirical best routes based on classification of large trajectory data. As many location-based services are used, we expect the amount of location and trajectory data to become big data. Then, we believe we can extract the best empirical routes from the large trajectory repositories. Large trajectory data is clustered into similar route groups using Hadoop MapReduce framework. Clustered route groups are stored and managed by a DBMS, and thus it supports rapid response to the end-users' request. We aim to find the best routes based on collected real data, not the ideal shortest path on maps. We have implemented 1) an Android application that collects trajectories from users, 2) Apache Hadoop MapReduce program that can cluster large trajectory data, 3) a service application to query start-destination from a web server and to display the recommended routes on mobile phones. We validated our approach using real data we collected for five days and have compared the results with commercial navigation systems. Experimental results show that the empirical best route is better than routes recommended by commercial navigation systems.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.8
• /
• pp.3328-3349
• /
• 2020

With rapid development of ubiquitous computing and location-based services (LBSs), human trajectory data and associated activities are increasingly easily recorded. Inappropriately publishing trajectory data may leak users' privacy. Therefore, we study publishing trajectory data while preserving privacy, denoted privacy-preserving activity trajectories publishing (PPATP). We propose S-PPATP to solve this problem. S-PPATP comprises three steps: modeling, algorithm design and algorithm adjustment. During modeling, two user models describe users' behaviors: one based on a Markov chain and the other based on the hidden Markov model. We assume a potential adversary who intends to infer users' privacy, defined as a set of sensitive information. An adversary model is then proposed to define the adversary's background knowledge and inference method. Additionally, privacy requirements and a data quality metric are defined for assessment. During algorithm design, we propose two publishing algorithms corresponding to the user models and prove that both algorithms satisfy the privacy requirement. Then, we perform a comparative analysis on utility, efficiency and speedup techniques. Finally, we evaluate our algorithms through experiments on several datasets. The experiment results verify that our proposed algorithms preserve users' privay. We also test utility and discuss the privacy-utility tradeoff that real-world data publishers may face.

• Korean Journal of Remote Sensing
• /
• v.30 no.1
• /
• pp.13-24
• /
• 2014

Satellite remote sensing data have been valuable tool for volcanic ash monitoring. In this study, we present the results of application of satellite remote sensing data for monitoring of volcanic ash for three major volcanic eruption cases (2008 Chait$\acute{e}$n, 2010 Eyjafjallaj$\ddot{o}$kull, and 2011 Shinmoedake volcanoes). Volcanic ash detection products based on the Moderate Resolution Imaging Spectro-radiometer (MODIS) observation data using infrared brightness temperature difference technique were compared to the forward air mass trajectory analysis by the HYbrid Single-Particle Lagrangian Integrated Trajectory (HYSPLIT) model. There was good correlation between MODIS volcanic ash image and trajectory lines after the volcanic eruptions, which support the feasibility of using the integration of satellite observed and model derived data for volcanic ash forecasting.

• Journal of Korea Society of Industrial Information Systems
• /
• v.19 no.6
• /
• pp.53-61
• /
• 2014

For monitoring the flight trajectory and the status of a launch vehicle, the mission control system in NARO space center process data acquired from the ground tracking system, which consists of two tracking radars, four telemetry stations, and one electro-optical tracking system. Each tracking unit exhibits its own tracking error mainly due to multi-path, clutter and radio refraction, and by utilizing only one among transmitted informations, it is not possible to determine the actual vehicle trajectory. This paper presents a way of generating flight trajectory via post-processing the data received from the ground tracking system. The post-processing algorithm is divided into two parts: compensation for atmosphere radio refraction and multi-sensor fusion, for which a decentralized Kalman filter was adopted and implemented based on constant acceleration model. Applications of the present scheme to real data resulted in the flight trajectory where the tracking errors were minimized than done by any one sensor.

• 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 KIISE:Databases
• /
• v.35 no.2
• /
• pp.169-181
• /
• 2008

Because moving objects usually move on spatial networks, efficient trajectory index structures are required to achieve good retrieval performance on their trajectories. However, there has been little research on trajectory index structures for spatial networks such as FNR-tree and MON-tree. But, because FNR-tree and MON-tree are stored by the unit of the moving object's segment, they can't support the whole moving objects' trajectory. In this paper, we propose an efficient trajectory index structure, named Trajectory of Moving objects on Network Tree(TMN Tree), for moving objects. For this, we divide moving object data into spatial and temporal attribute, and preserve moving objects' trajectory. Then, we design index structure which supports not only range query but trajectory query. In addition, we divide user queries into spatio-temporal area based trajectory query, similar-trajectory query, and k-nearest neighbor query. We propose query processing algorithms to support them. Finally, we show that our trajectory index structure outperforms existing tree structures like FNR-Tree and MON-Tree.

• Journal of The Korean Association For Science Education
• /
• v.36 no.6
• /
• pp.835-849
• /
• 2016

The purpose of the present study is to analyze the trajectory of science core school students' STEM career motivation and to examine the relationship between the trajectory patterns and students' tracks. Longitudinal STEM career motivation data with seven constructs were collected from 256 students for five semesters and the data were analyzed by using group-based trajectory modelling analysis. In order to examine the relationship between trajectory pattern groups and the tracks, chi-square tests were conducted. Based on our findings, we found that students are likely to have similar trajectory patterns in STEM career education experience and in their perception towards STEM career value. In terms of parents' support, academic self-efficacy and STEM career motivation aspects are divided into two distinctive trajectory groups ('high' and 'low' group), while two other variables, STEM career self-efficacy and STEM career interest, are divided into three trajectory groups ('moderate declining', 'high declining', 'increasing' group). Most of the trajectory groups are shown the pattern that the level of each constructs increase until their second academic year, then after that, the patterns started going down. Moreover, there are significant relationship between track and each trajectory groups. Science track and science-core track students have similar trajectory patterns. In contrast, humanities track students have different trajectory groups in some constructs. Based on these findings, we suggest that STEM career education environment should consider various patterns of students' STEM career development.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.2033-2036
• /
• 2004

A novel approach to estimate the real time moving trajectory of an object is proposed in this paper. The object position is obtained from the image data of a CCD camera, while a state estimator predicts the linear and angular velocities of the moving object. To overcome the uncertainties and noises residing in the input data, a Kalman filter and neural networks are utilized. Since the Kalman filter needs to approximate a non-linear system into a linear model to estimate the states, there always exist errors as well as uncertainties again. To resolve this problem, the neural networks are adopted in this approach, which have high adaptability with the memory of the input-output relationship. Kohonen Network(Self-Organized Map) is selected to learn the motion trajectory since it is spatially oriented. The superiority of the proposed algorithm is demonstrated through the real experiments.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.1 no.2
• /
• pp.134-143
• /
• 1993

The trajectory planning for the manipulator installed on "the automatic pothole repair vehicle" is discussed and the final surface of the patched pot hole is simulated in this work. The relationship between the accumulation data of the mixture with and without the movement of the manipulator is identified to utilize the latter data for the calculation of the former one. Based on this relationship, the method to calculate the accumulation of the mixture when the manipulator changes the speed and the direction is also introduced. The trajectory is determined to make the final surface smooth under the condition that the pothole is cut to hexahedron before patching and only the spacing and the shifting of the manipulator is controllable. Final surface is simulated by the computer to prove the adequacy of the determined trajectory.