Trajectory similarity of network constrained moving objects and applications to traffic security

  • Authors:
  • Sajimon Abraham;Paulose Sojan Lal

  • Affiliations:
  • School of Management & Business Studies, Mahatma Gandhi University, Kerala, India;Mar Beselios Institute of Technology and Science, Kothamangalam, Kerala, India

  • Venue:
  • PAISI'10 Proceedings of the 2010 Pacific Asia conference on Intelligence and Security Informatics
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Spatio-Temporal data analysis plays a central role in many security-related applications including those relevant to transportation infrastructure, border and inland security. In several applications, data objects move on pre-defined spatial networks such as road segments, railways, and invisible air routes, which provides the possibility of representing the data in reduced dimension. This dimensionality reduction gives additional advantages in spatio-temporal data management like indexing, query processing, similarity and clustering of trajectory data etc. There are many proposals concerning trajectory similarity problem which includes Euclidian, network, time based measures and concepts known as Position of Interest(POI), Time of Interest(TOI) etc. This paper demonstrates how these POI and TOI methods could be advantages in security informatics domain suitable to work with road network constrained moving object data, stored using a binary encoding scheme proposed in a previous PAISI paper.