Map-matched trajectory compression

Journal of Systems and Software

Volumn 86, Issue 6, 2013, Pages 1566-1579

  Kellaris, Georgios ^a   Pelekis, Nikos ^b   Theodoridis, Yannis ^b  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^b UNIVERSITY OF PIRAEUS   (Greece)

Author keywords

Compression; Map matching; Network trajectory

Indexed keywords

COMPRESSION TECHNIQUES; EXPERIMENTAL EVALUATION; LINE SIMPLIFICATION; MANAGEMENT CHALLENGES; MAP MATCHING; MAP-MATCHING ALGORITHM; MOVING OBJECT DATABASE; RESEARCH COMMUNITIES;

COMPACTION; DIGITAL STORAGE; IMAGE MATCHING; TRAJECTORIES;

DATA COMPRESSION;

EID: 84876415910     PISSN: 01641212     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jss.2013.01.071     Document Type: Article

References (28)

1. Agenzia Milanese Mobilitá Ambiente. URL: http://www.ama-mi.it/ (accessed 17.11.11).
2. M. Barbehenn A note on the complexity of Dijkstra's algorithm for graphs with weighted vertices IEEE Transactions on Computers 47 1998 263
3. Bernstein, D.; Kornhauser, A.; 1996. An introduction to map matching for personal navigation assistants. Technical report, New Jersey TIDE Center Technical Report.
4. S. Brakatsoulas, D. Pfoser, R. Salas, and C. Wenk On map-matching vehicle tracking data Proceedings of the 31st International Conference on Very Large Data Bases (VLDB) 2005
5. Brinkhoff, T.; Network-based Generator of Moving Objects. URL: http://www.fh-oow.de/institute/iapg/personen/brinkhoff/generator/ (accessed 17.11.09).
6. H. Cao, and O. Wolfson Nonmaterialized motion information in transport networks Proceedings of the 10th International Conference on Database Theory (ICDT) 2005 173 188
7. L. Chen, M. Tamer Özsu, and V. Oria Robust and fast similarity search for moving object trajectories Proceedings of ACM SIGMOD 2005
8. E.W. Dijkstra A note on two problems in connexion with graphs Numerische Mathematik 1 1 1959 269 271
9. D. Douglas, and T. Peucker Algorithms for the reduction of the number of points required to represent a digitized line or its caricature The Canadian Cartographer 10 2 1973 112 122
10. E. Frentzos, K. Gratsias, and Y. Theodoridis Index-based most similar trajectory search Proceedings of the 23rd International Conference on Data Engineering (ICDE) 2007
11. J. Greenfeld Matching GPS observations to locations on a digital map Proceedings of the 81st Annual Meeting of the Transportation Research Board 2002
12. P. Grünwald, I.J. Myung, and M. Pitt Advances in Minimum Description Length: Theory and Applications 2005 MIT Press
13. D.B. Johnson Efficient algorithms for shortest paths in sparse networks Journal of the ACM 24 1 1977 1 13
14. G. Kellaris, N. Pelekis, and Y. Theodoridis Trajectory compression under network constraints Proceedings of the 11th International Symposium on Spatial and Temporal Databases (SSTD) 2009
15. R.E. Korf Depth-first iterative-deepening: an optimal admissible tree search Artificial Intelligence 27 1 1985 97 109
16. J.-G. Lee, J. Han, and K.-Y. Whang Trajectory clustering: a partition-and-group framework Proceedings of ACM SIGMOD 2007
17. T.C.M. Lee An introduction to coding theory and the two-part minimum description length principle International Statistical Review 69 2 2001 169 184
18. N. Meratnia, and R.A. de By Spatiotemporal compression techniques for moving point objects Proceedings of the Extending Database Technology (EDBT) 2004
19. M. Migliore, V. Martorana, and F. Sciortino An algorithm to find all paths between two nodes in a graph Journal of Computational Physics 87 1990 231 236
20. N. Pelekis, I. Kopanakis, E.E. Kotsifakos, E. Frentzos, and Y. Theodoridis Clustering trajectories of moving objects in an uncertain world Proceedings of IEEE International Conference on Data Mining (ICDM) 2009
21. D. Pfoser, and C.S. Jensen Capturing the uncertainty of moving-object representations Proceedings of the 6th International Symposium on Spatial Databases (SSD) 1999
22. M. Potamias, K. Patroumpas, and T. Sellis Sampling trajectory streams with spatiotemporal criteria Proceedings of the Scientific and Statistical Database Management (SSDBM) 2006
23. M. Quddus, W. Ochieng, L. Zhao, and R. Noland A general map matching algorithm for transport telematics applications GPS Solutions Journal 7 3 2003 157 167
24. D. Sacharidis, K. Patroumpas, M. Terrovitis, V. Kantere, M. Potamias, K. Mouratidis, and T. Sellis Online discovery of hot motion paths Proceedings of the Extending Database Technology (EDBT) 2008
25. E. Tiakas, A.N. Papadopoulos, A. Nanopoulos, Y. Manolopoulos, D. Stojanovic, and S. Djordjevic-Kajan Searching for similar trajectories in spatial networks Journal of Systems and Software 82 5 2009 772 788
26. M. Vlachos, G. Kollios, and D. Gunopulos Discovering similar multidimensional trajectories Proceedings of the 18th International Conference on Data Engineering (ICDE) 2002
27. Y. Xu, and W. Lee Compressing moving object trajectory in wireless sensor networks International Journal of Distributed Sensor Networks 3 2 2007 151 174
28. H. Yin, and O. Wolfson A weight-based map matching method in moving objects databases Proceedings of the 16th Scientific and Statistical Database Management (SSDBM) 2004