An Overview of Moving Object Trajectory Compression Algorithms

Compression technology is an efficient way to reserve useful and valuable data as well as remove redundant and inessential data from datasets. With the development of RFID and GPS devices, more and more moving objects can be traced and their trajectories can be recorded. However, the exponential increase in the amount of such trajectory data has caused a series of problems in the storage, processing, and analysis of data. Therefore, moving object trajectory compression undoubtedly becomes one of the hotspots in moving object data mining. To provide an overview, we survey and summarize the development and trend of moving object compression and analyze typical moving object compression algorithms presented in recent years. In this paper, we firstly summarize the strategies and implementation processes of classical moving object compression algorithms. Secondly, the related definitions about moving objects and their trajectories are discussed. Thirdly, the validation criteria are introduced for evaluating the performance and efficiency of compression algorithms. Finally, some application scenarios are also summarized to point out the potential application in the future. It is hoped that this research will serve as the steppingstone for those interested in advancing moving objects mining.

[1]  Bart Kranstauber,et al.  True navigation in migrating gulls requires intact olfactory nerves , 2015, Scientific Reports.

[2]  Zhen He,et al.  Trajic: An Effective Compression System for Trajectory Data , 2015, IEEE Transactions on Knowledge and Data Engineering.

[3]  J. Masero,et al.  When Siberia came to the Netherlands: the response of continental black-tailed godwits to a rare spring weather event. , 2015, The Journal of animal ecology.

[4]  Yu Zheng,et al.  Trajectory Data Mining , 2015, ACM Trans. Intell. Syst. Technol..

[5]  Wen Hu,et al.  SimpleTrack: Adaptive Trajectory Compression With Deterministic Projection Matrix for Mobile Sensor Networks , 2014, IEEE Sensors Journal.

[6]  S. Frick,et al.  Compressed Sensing , 2014, Computer Vision, A Reference Guide.

[7]  Kai Zheng,et al.  Compressing large scale urban trajectory data , 2014, CloudDP '14.

[8]  Weiwei Sun,et al.  PRESS: A Novel Framework of Trajectory Compression in Road Networks , 2014, Proc. VLDB Endow..

[9]  Karine Zeitouni,et al.  Spatio-temporal compression of trajectories in road networks , 2014, GeoInformatica.

[10]  X. Li,et al.  An Online Compression Algorithm for Positioning Data Acquisition , 2014, Informatica.

[11]  S. S. Ravi,et al.  Compression of trajectory data: a comprehensive evaluation and new approach , 2014, GeoInformatica.

[12]  Cheng Long,et al.  Direction-Preserving Trajectory Simplification , 2013, Proc. VLDB Endow..

[13]  Yanmei Zhang,et al.  Interesting Activities Discovery for Moving Objects Based on Collaborative Filtering , 2013 .

[14]  Jeong-Hyon Hwang,et al.  Similarity-Based Compression of GPS Trajectory Data , 2013, 2013 Fourth International Conference on Computing for Geospatial Research and Application.

[15]  Kaoru Sezaki,et al.  An Online Method for Trajectory Simplification Under Uncertainty of GPS , 2013 .

[16]  Nikos Pelekis,et al.  Map-matched trajectory compression , 2013, J. Syst. Softw..

[17]  Shazia Wasim Sadiq,et al.  An Effectiveness Study on Trajectory Similarity Measures , 2013, ADC.

[18]  Zhang Xinming.  A Spatiotemporal Compression Algorithm for GPS Trajectory Data , 2013 .

[19]  Lei Zhang,et al.  An efficient trajectory-clustering algorithm based on an index tree , 2012 .

[20]  Kai-Florian Richter,et al.  Semantic trajectory compression: Representing urban movement in a nutshell , 2012, J. Spatial Inf. Sci..

[21]  Pasi Fränti,et al.  A Fast $O(N)$ Multiresolution Polygonal Approximation Algorithm for GPS Trajectory Simplification , 2012, IEEE Transactions on Image Processing.

[22]  S. S. Ravi,et al.  SQUISH: an online approach for GPS trajectory compression , 2011, COM.Geo.

[23]  Wen Hu,et al.  An Adaptive Algorithm for Compressive Approximation of Trajectory (AACAT) for Delay Tolerant Networks , 2011, EWSN.

[24]  Kai-Florian Richter,et al.  Semantic Trajectory Compression , 2009, SSTD.

[25]  Jae-Gil Lee,et al.  Trajectory Outlier Detection: A Partition-and-Detect Framework , 2008, 2008 IEEE 24th International Conference on Data Engineering.

[26]  Joachim Gudmundsson,et al.  Compressing spatio-temporal trajectories , 2009, Comput. Geom..

[27]  Jae-Gil Lee,et al.  Trajectory clustering: a partition-and-group framework , 2007, SIGMOD '07.

[28]  Timos K. Sellis,et al.  Sampling Trajectory Streams with Spatiotemporal Criteria , 2006, 18th International Conference on Scientific and Statistical Database Management (SSDBM'06).

[29]  Ouri Wolfson,et al.  On-line data reduction and the quality of history in moving objects databases , 2006, MobiDE '06.

[30]  Vinny Cahill,et al.  Sensor networks for smart roads , 2006, Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06).

[31]  Lei Chen,et al.  Robust and fast similarity search for moving object trajectories , 2005, SIGMOD '05.

[32]  Nirvana Meratnia,et al.  Spatiotemporal Compression Techniques for Moving Point Objects , 2004, EDBT.

[33]  Dimitrios Gunopulos,et al.  Indexing Multidimensional Time-Series , 2004, The VLDB Journal.

[34]  Wu Xin.  Basic Conception, Function and Implementation of Temporal GIS , 2002 .

[35]  Eamonn J. Keogh,et al.  An online algorithm for segmenting time series , 2001, Proceedings 2001 IEEE International Conference on Data Mining.

[36]  J G Harper.  Traffic violation detection and deterrence: implications for automatic policing. , 1991, Applied ergonomics.

[37]  David H. Douglas,et al.  ALGORITHMS FOR THE REDUCTION OF THE NUMBER OF POINTS REQUIRED TO REPRESENT A DIGITIZED LINE OR ITS CARICATURE , 1973 .

[38]  R. Bellman.  On the approximation of curves by line segments using dynamic programming , 1961, CACM.