Skip to main content
Log in

Spatio-temporal compression of trajectories in road networks

  • Published:
GeoInformatica Aims and scope Submit manuscript

Abstract

With the proliferation of wireless communication devices integrating GPS technology, trajectory datasets are becoming more and more available. The problems concerning the transmission and the storage of such data have become prominent with the continuous increase in volume of these data. A few works in the field of moving object databases deal with spatio-temporal compression. However, these works only consider the case of objects moving freely in the space. In this paper, we tackle the problem of compressing trajectory data in road networks with deterministic error bounds. We analyze the limitations of the existing methods and data models for road network trajectory compression. Then, we propose an extended data model and a network partitioning algorithm into long paths to increase the compression rates for the same error bound. We integrate these proposals with the state-of-the-art Douglas-Peucker compression algorithm to obtain a new technique to compress road network trajectory data with deterministic error bounds. The extensive experimental results confirm the appropriateness of the proposed approach that exhibits compression rates close to the ideal ones with respect to the employed Douglas-Peucker compression algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15

Similar content being viewed by others

Notes

  1. For simplicity, we use the term “in-network” to denote a road network or any other type of transportation network.

References

  1. Brinkhoff T (2002) A framework for generating network-based moving objects. GeoInformatica 6(2):153–180

    Article  Google Scholar 

  2. Cao H, Wolfson O (2005) Nonmaterialized motion information in transport networks. Proc. ICDT: 173–188

  3. Cao H, Wolfson O, Trajcevski G (2003) Spatio-temporal data reduction with deterministic error bounds. DIALM-POMC 2003: 33–42

  4. Cao H, Wolfson O, Trajcevski G (2006) Spatio-temporal data reduction with deterministic error bounds. VLDB J 15(3):211–228

    Article  Google Scholar 

  5. Chazal F, Chen D, Guibas LJ, Jiang X, Sommer C (2011) Data-driven trajectory smoothing. In: Proceedings of the 19th SIGSPATIAL International Conference on Advances in Geographic Information Systems (GIS 2011), pp. 251–260. Chicago, Illinois, USA

  6. Civilis A, Jensen CS, Pakalnis S (2005) Techniques for efficient road-network-based tracking of moving objects. IEEE Trans Knowl Data Eng 17(5):698–712

    Article  Google Scholar 

  7. de Almeida VT, Guting R (2005) Indexing the trajectories of moving objects in networks. GeoInformatica 9(1):30–60

    Article  Google Scholar 

  8. Douglas DH, Peucker TK (1973) Algorithms for the reduction of the number of points required to represent a digitized line or its caricature. The Canadian Cartographer 10:112–122

    Article  Google Scholar 

  9. Ehrlich J, Marchi M, Jarri P, Salesse L, Guichon D, Dominois D, Leverger C. LAVIA, the French ISA project: main issues and first results on technical tests. 10th World Congress & Exhibition on ITS – 16–20 November 2003, Madrid, Spain

  10. Ester M, Kriegel H-P, Sander J, Xu X (1996) A density-based algorithm for discovering clusters in large spatial databases with noise. In Proc. 2nd Int’l Conf. on Knowledge Discovery and Data Mining, Portland, Oregon, pp 226–231

  11. Frentzos E, Gratsias K, Theodoridis Y (2009) On the effect of location uncertainty in spatial querying. IEEE Trans Knowl Data Eng 21(3):366–383

    Article  Google Scholar 

  12. Garey MR, Johnson DS (1990) Computers and intractability; a guide to the theory of NP-completeness, New York

  13. Gudmundsson J, Katajainen J, Merrick D, Ong C, Wolle T (2007) Compressing Spatio-temporal Trajectories. In: Proceedings of the 18th International Symposium on Algorithms and Computation (ISAAC), pp. 763–775. Sendai, Japan

  14. Güting RH, de Almeida VT, Ding Z (2006) Modeling and querying moving objects in networks. VLDB J 15(2):165–190

    Article  Google Scholar 

  15. Han B, Liu L, Omiecinski E (2012) NEAT: road network aware trajectory clustering. ICDCS 2012: 142–151

  16. Hershberger J, Snoeyink J (1994) An O(n log n) implementation of the Douglas-Peucker algorithm for line simplification. In: Proceedings of the 10th Symposium on Computational Geometry, pp 383–384. Stony Brook, NY

  17. Imai H, Iri M (1988) Computational morphology, chapter polygonal approximations of a curve – formulations and algorithms, pp 71–86. North-Holland Publishing Company, Netherlands

  18. Kellaris G, Pelekis N, Theodoridis Y (2009) Trajectory compression under network constraints. Proc. SSTD: 392–398

  19. Kharrat A, Sandu Popa I, Zeitouni K, Faiz S (2008) Clustering algorithm for network constraint trajectories. SDH 2008: 631–647

  20. Koegel M, Baselt D, Mauve M, Scheuermann B (2011) A comparison of vehicular trajectory encoding techniques. In: Proceedings of the 10th Annual Mediterranean Ad Hoc Networking Workshop (MedHocNet ‘11), pp. 87–94. Favignana Island, Sicily, Italy

  21. Lange R, Dürr F, Rothermel K (2011) Efficient real-time trajectory tracking. VLDB J 20(5):671–694

    Article  Google Scholar 

  22. Lee J-G, Han J, Li X, Gonzalez H (2008) TraClass: trajectory classification using hierarchical region-based and trajectory-based clustering. PVLDB 1(1):1081–1094

    Google Scholar 

  23. Lee J-G, Han J, Whang K-Y (2007) Trajectory clustering: a partition-and-group framework. SIGMOD Conference 2007: 593–604

  24. Meratnia N, de By RA (2004) Spatiotemporal compression techniques for moving point objects. Proc. EDBT: 765–782

  25. Moustris G, Tzafestas SG (2008) Reducing a class of polygonal path tracking to straight line tracking via nonlinear strip-wise affine transformation. Math Comput Simul 79(2):133–148

    Article  Google Scholar 

  26. Potamias M, Patroumpas K, Sellis TK (2006) Sampling trajectory streams with spatiotemporal criteria. Proc. SSDBM: 275–284

  27. Richter K-F, Schmid F, Laube P (2012) Semantic trajectory compression: representing urban movement in a nutshell. J Spat Inf Sci 4(1):3–30

    Google Scholar 

  28. Roh G-P, Hwang S-W (2010) NNCluster: an efficient clustering algorithm for road network trajectories. DASFAA (2) 2010: 47–61

  29. Sandu Popa I, Zeitouni K, Oria V, Barth D, Vial S (2011) Indexing in-network trajectory flows. VLDB J 20(5):643–669

    Article  Google Scholar 

  30. Speicys L, Jensen CS (2008) Enabling location-based services - multi-graph representation of transportation networks. GeoInformatica 12(2):219–253

    Article  Google Scholar 

  31. Trajcevski G, Cao H, Scheuermann P, Wolfson O, Vaccaro D (2006) On-line data reduction and the quality of history in moving objects databases. MobiDE: 19–26

Download references

Acknowledgments

This work was partially supported by the KISS ANR-11-INSE-005 grant. The authors would also like to thank the reviewers for their valuable suggestions that improved significantly this journal article.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Iulian Sandu Popa.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Sandu Popa, I., Zeitouni, K., Oria, V. et al. Spatio-temporal compression of trajectories in road networks. Geoinformatica 19, 117–145 (2015). https://doi.org/10.1007/s10707-014-0208-4

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10707-014-0208-4

Keywords

Navigation