• Article
  • | |
  • Metrics
  • |
  • Reference [10]
  • |
  • Related
  • |
  • Cited by [1]
  • | |
  • Comments
    Abstract:

    Recent progress on location aware services, GPS and wireless technologies has made it possible to real-timely track moving object and collect a large quarlity of trajectories data. As a result, how to effectively discover the knowledge from these trajectory data becomes an attractive and interesting research topic. The new trajectory outlier detection, proposed in this paper, can be used to determine whether two trajectories are globally matched by calculating the local matching degree between every base comparing unit pairs. Firstly, this paper proposes a new distance measure approach, which treats k consecutive points as a local comparing unit to depict the local features in terms of trajectories, via calculating the matching degree between trajectory segments. In addition, the critical concepts as local match, global match and trajectory outlier are presented. Secondly, based on this distance measure method, a new trajectory outlier detection algorithm based on R-tree is proposed to improve the efficiency of outlier detection. The main idea behind this algorithm is to eliminate unnecessary distance computation by R-tree and distance characteristic matrix between every trajectory pair. Extensive experiments demonstrate the efficiency and effectiveness of the proposed algorithm for trajectory outlier detection.

    Reference
    [1] Knorr EM, Ng RT, Tucakov V. Distance-Based outliers: Algorithms and applications. VLDB Journal, 2000,8(3):237-253.
    [2] Ramaswamy S, Rastogi R, Shim K. Efficient algorithms for mining outliers from large data sets. In: Chen WD, Jeffrey FN, Philip AB, eds. Proc. of the SIGMOD 2000. New York: ACM, 2000. 427-438.
    [3] Breunig MM, Kriegel HP, Ng RT, Sander J. LOF: Identifying density-based local outliers. In: Chen WD, Jeffrey FN, Philip AB, eds. Proc. of the SIGMOD 2000. New York: ACM, 2000. 93-104.
    [4] Papadimitriou S, Kitagawa H, Gibbons PB, Faloutsos C. LOCI: Fast outlier detection using the local correlation integral. In: Dayal U, Ramamritham K, Vijayaraman TM, eds. Proc. of the ICDE 2003. New York: IEEE Computer Society, 2003. 315-326.
    [5] Aggarwal CC, Yu PS. Outlier detection for high dimensional data. In: Aref WG, ed. Proc. of the SIGMOD 2001. New York: ACM, 2001. 37-46.
    [6] Lee J, Han J, Li X. Trajectory outlier detection: A partition-and-detect framework. In: Proc. of the ICDE 2008. New York: IEEE Computer Society, 2008. 140-149.
    [7] Chen J, Maylor K. Leung, Gao Y. Noisy logo recognition using line segment hausdorff distance. Pattern Recognition, 2003,36(4): 943-955.
    [8] Huttenlocher DP, Klanderman GA, Rucklidge WA. Comparing images using the hausdorff distance. IEEE Trans. on Pattern Analysis and Machine Intelligence, 1993,15(9):850-863.
    [9] Huttenlocher DP, Kedem K, Sharir M. The upper envelope of voronoi surfaces and its applications. Discrete and Computational Geometry, 1993,9(1):267-291.
    [10] Beckmann N, Kriegel HP, Schneider R, Seeger B. The R*-tree: An efficient and robust access method for points and rectangles. In: Hector GM, ed. Proc. of the SIGMOD’90. New York: ACM, 1990. 322-331.
    Related
Get Citation

刘良旭,乔少杰,刘宾,乐嘉锦,唐常杰.基于R-Tree的高效异常轨迹检测算法.软件学报,2009,20(9):2426-2435

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:August 13,2008
  • Revised:January 15,2009
You are the first2051323Visitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063