Modeling local and global behavior for trajectory classification using graph based algorithm

Abstract Understanding motion patterns is of great importance to analyze the behavior of objects in the vigilance area. Grouping the motion patterns into clusters in such a way that similar motion patterns lie in same cluster and the inter-cluster variance is maximized in a challenging work. Variation in the duration of trajectory patterns in terms of time or number of points in them (even in the trajectories from same cluster) makes it more difficult to correctly classify in respective clusters while using full length trajectories, local clue can be used along with the global information. Trajectories can be segmented into distinctive parts and local contribution of these parts can be used to improve the performance of the system. In this work, we have formulated the trajectory classification problem into graph based similarity problem using Douglas–Peucker (DP) algorithm, Complete Bipartite Graphs (CBG), and Minimum Spanning Tree (MST). Local behavior of objects has been analyzed using their motion segments and Dynamic Time Warping (DTW) has been used for finding similarity among motion trajectories. Class-wise global and local costs have been computed using DTW, CBG, and MST and their fusion has been done using Particle Swarm Optimization (PSO) to improve the classification rate. Trajectory datasets, namely T15, LabOmni, and CROSS have been used in experiments. The proposed method yields encouraging results and outperforms the state of the art techniques.