• Title/Summary/Keyword: Trajectory information

Search Result 875, Processing Time 0.03 seconds

Background Subtraction for Moving Cameras based on trajectory-controlled segmentation and Label Inference

  • Yin, Xiaoqing;Wang, Bin;Li, Weili;Liu, Yu;Zhang, Maojun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.10
    • /
    • pp.4092-4107
    • /
    • 2015
  • We propose a background subtraction method for moving cameras based on trajectory classification, image segmentation and label inference. In the trajectory classification process, PCA-based outlier detection strategy is used to remove the outliers in the foreground trajectories. Combining optical flow trajectory with watershed algorithm, we propose a trajectory-controlled watershed segmentation algorithm which effectively improves the edge-preserving performance and prevents the over-smooth problem. Finally, label inference based on Markov Random field is conducted for labeling the unlabeled pixels. Experimental results on the motionseg database demonstrate the promising performance of the proposed approach compared with other competing methods.

Semantic Trajectory Based Behavior Generation for Groups Identification

  • Cao, Yang;Cai, Zhi;Xue, Fei;Li, Tong;Ding, Zhiming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.12
    • /
    • pp.5782-5799
    • /
    • 2018
  • With the development of GPS and the popularity of mobile devices with positioning capability, collecting massive amounts of trajectory data is feasible and easy. The daily trajectories of moving objects convey a concise overview of their behaviors. Different social roles have different trajectory patterns. Therefore, we can identify users or groups based on similar trajectory patterns by mining implicit life patterns. However, most existing daily trajectories mining studies mainly focus on the spatial and temporal analysis of raw trajectory data but missing the essential semantic information or behaviors. In this paper, we propose a novel trajectory semantics calculation method to identify groups that have similar behaviors. In our model, we first propose a fast and efficient approach for stay regions extraction from daily trajectories, then generate semantic trajectories by enriching the stay regions with semantic labels. To measure the similarity between semantic trajectories, we design a semantic similarity measure model based on spatial and temporal similarity factor. Furthermore, a pruning strategy is proposed to lighten tedious calculations and comparisons. We have conducted extensive experiments on real trajectory dataset of Geolife project, and the experimental results show our proposed method is both effective and efficient.

Improvement of OPW-TR Algorithm for Compressing GPS Trajectory Data

  • Meng, Qingbin;Yu, Xiaoqiang;Yao, Chunlong;Li, Xu;Li, Peng;Zhao, Xin
    • 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.

Storing and Querying Trajectory Information on PostgreSQL/PostGIS (PostgreSQL/PostGIS 기반의 궤적 정보 저장 및 질의)

  • Yang, Pyoung-Woo;Lee, Yong-Mi;Lee, Yon-Sik;Nam, Kwang-Woo
    • Spatial Information Research
    • /
    • v.19 no.2
    • /
    • pp.57-64
    • /
    • 2011
  • This paper describes how to storing and querying trajectory information on PostgreSQL/PostGIS. Recently as technology of mobile devices is advancing, many researches for location-based services and moving object's trajectory have been studied. Trajectory is the set of information of the location by the time, and is one of the most im portant information for location-based services. Traditional spatial database systems do not support trajectory data types and functions. In this paper, we propose a trajectory data type and query functions for moving objects on PostgreSQL/PostGIS.

aCN-RB-tree: Constrained Network-Based Index for Spatio-Temporal Aggregation of Moving Object Trajectory

  • Lee, Dong-Wook;Baek, Sung-Ha;Bae, Hae-Young
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.3 no.5
    • /
    • pp.527-547
    • /
    • 2009
  • Moving object management is widely used in traffic, logistic and data mining applications in ubiquitous environments. It is required to analyze spatio-temporal data and trajectories for moving object management. In this paper, we proposed a novel index structure for spatio-temporal aggregation of trajectory in a constrained network, named aCN-RB-tree. It manages aggregation values of trajectories using a constraint network-based index and it also supports direction of trajectory. An aCN-RB-tree consists of an aR-tree in its center and an extended B-tree. In this structure, an aR-tree is similar to a Min/Max R-tree, which stores the child nodes' max aggregation value in the parent node. Also, the proposed index structure is based on a constrained network structure such as a FNR-tree, so that it can decrease the dead space of index nodes. Each leaf node of an aR-tree has an extended B-tree which can store timestamp-based aggregation values. As it considers the direction of trajectory, the extended B-tree has a structure with direction. So this kind of aCN-RB-tree index can support efficient search for trajectory and traffic zone. The aCN-RB-tree can find a moving object trajectory in a given time interval efficiently. It can support traffic management systems and mining systems in ubiquitous environments.

DeepPTP: A Deep Pedestrian Trajectory Prediction Model for Traffic Intersection

  • Lv, Zhiqiang;Li, Jianbo;Dong, Chuanhao;Wang, Yue;Li, Haoran;Xu, Zhihao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.7
    • /
    • pp.2321-2338
    • /
    • 2021
  • Compared with vehicle trajectories, pedestrian trajectories have stronger degrees of freedom and complexity, which poses a higher challenge to trajectory prediction tasks. This paper designs a mode to divide the trajectory of pedestrians at a traffic intersection, which converts the trajectory regression problem into a trajectory classification problem. This paper builds a deep model for pedestrian trajectory prediction at intersections for the task of pedestrian short-term trajectory prediction. The model calculates the spatial correlation and temporal dependence of the trajectory. More importantly, it captures the interactive features among pedestrians through the Attention mechanism. In order to improve the training speed, the model is composed of pure convolutional networks. This design overcomes the single-step calculation mode of the traditional recurrent neural network. The experiment uses Vulnerable Road Users trajectory dataset for related modeling and evaluation work. Compared with the existing models of pedestrian trajectory prediction, the model proposed in this paper has advantages in terms of evaluation indicators, training speed and the number of model parameters.

OPTIMAL ROUTE DETERMINATION TECHNOLOGY BASED ON TRAJECTORY QUERYING MOVING OBJECT DATABASE

  • Min Kyoung-Wook;Kim Ju-Wan;Park Jong-Hyun
    • Proceedings of the KSRS Conference
    • /
    • 2005.10a
    • /
    • pp.317-320
    • /
    • 2005
  • The LBS (Location-Based Services) are valuable information services combined the location of moving object with various contents such as map, POI (point of Interest), route and so on. The must general service of LBS is route determination service and its applicable parts are FMS (Fleet Management System), travel advisory system and mobile navigation system. The core function of route determination service is determination of optimal route from source to destination in various environments. The MODB (Moving Object Database) system, core part of LBS composition systems, is able to manage current or past location information of moving object and massive trajectory information stored in MODB is value-added data in CRM, ERP and data mining part. Also this past trajectory information can be helpful to determine optimal route. In this paper, we suggest methods to determine optimal route by querying past trajectory information in MODB system and verify the effectiveness of suggested method.

  • PDF

A Study of Trajectory Mapping Method as a User Interface Design Tool for Mobile Devices (모바일 기기의 사용자 인터페이스 설계 도구로서 Trajectory Mapping 방법에 관한 연구)

  • Lee, Suk-Won;Myung, Ro-Hae
    • IE interfaces
    • /
    • v.22 no.1
    • /
    • pp.17-25
    • /
    • 2009
  • In mobile device's user interface, menu organization is very important as well as menu structure because small display of mobile device. Menu items should be organized based on user knowledge structure to design user-centered interface. Traditionally, MDS (Multidimensional Scaling) have been most often used to expose users' perceived organization of menu items. But, information that MDS reveals is just relative spatial location of concepts and not relevant to concepts connection. Unlike MDS, Trajectory Mapping explicitly finds users' cognitive links between perceived concepts. This study proposes a Trajectory Mapping technique for eliciting knowledge structure, especially a set of cognitive pathways linking menu items, from end user. With twelve participants, MDS and Trajectory Mapping were conducted using cellular phone's menu items. And user knowledge structure was analyzed through Visual Concept Map that combination of results of MDS and Trajectory Mapping. After then, menu items were organized according to users' perceived organization. Empirical usability test was also conducted. The results of usability test showed that usability, in terms of task performance time, number of errors, and satisfaction, for newly organized interface was significantly improved compare to original interface. The methodology of this study is expected to be applicable to design a user-centered interface. In other words, Trajectory Mapping technique can be used as a design tool of user interface for imposing user knowledge structure on the interface.

Trajectory-prediction based relay scheme for time-sensitive data communication in VANETs

  • Jin, Zilong;Xu, Yuxin;Zhang, Xiaorui;Wang, Jin;Zhang, Lejun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.8
    • /
    • pp.3399-3419
    • /
    • 2020
  • In the Vehicular Ad-hoc Network (VANET), the data transmission of time-sensitive applications requires low latency, such as accident warnings, driving guidance, etc. However, frequent changes of topology in VANET will result in data transmission failures. In order to improve the efficiency of VANETs data transmission and increase the timeliness of data, this paper proposes a relay scheme based on Recurrent Neural Network (RNN) trajectory prediction, which can be used to select the optimal relay vehicle to transmit data. The proposed scheme learns vehicle trajectory in a distributed manner and calculates the predicted trajectory, and then the optimal vehicle can be selected to complete the data transmission, which ensures the timeliness of the data. Finally, we carry out a set of simulations to demonstrate the performance of the algorithm. Simulation results show that the proposed scheme enhances the timeliness of the data and the accuracy of the predicted driving trajectory.

The Method of Continuous Nearest Neighbor Search on Trajectory of Moving Objects

  • Park, Bo-Yoon;Kim, Sang-Ho;Nam, Kwang-Woo;Ryo, Keun-Ho
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2003.09a
    • /
    • pp.467-470
    • /
    • 2003
  • When user wants to find objects which have the nearest position from him, we use the nearest neighbor (NN) query. The GIS applications, such as navigation system and traffic control system, require processing of NN query for moving objects (MOs). MOs have trajectory with changing their position over time. Therefore, we should be able to find NN object continuously changing over the whole query time when process NN query for MOs, as well as moving nearby on trajectory of query. However, none of previous works consider trajectory information between objects. Therefore, we propose a method of continuous NN query for trajectory of MOs. We call this CTNN (continuous trajectory NN) technique. It ran find constantly valid NN object on the whole query time by considering of trajectory information.

  • PDF