Skip to main content

2018 | OriginalPaper | Buchkapitel

An Online GPS Trajectory Data Compression Method Based on Motion State Change

verfasst von : Hui Wang, Shuang Liu, Chengcheng Qian

Erschienen in: Knowledge Science, Engineering and Management

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Aiming to the problem of insufficient consideration to the cumulative error and offset which online Global Positioning System (GPS) trajectory data compression based on motion state change and the key point insufficient evaluation of online GPS trajectory data compression based on the offset calculation, an online compression of GPS trajectory data based on motion state change named Synchronous Euclidean Distance (SED) Limited Thresholds Algorithm (SLTA) was proposed. This algorithm used steering angle value and speed change value to evaluate information of trajectory point. At the same time, SLTA introduced the SED to limit offset of trajectory point. So SLTA could reach better information retention. The experiment results show that the trajectory compression ratio can reach about 50%. Compared with Thresholds Algorithm (TA), the average SED error of SLTA can be negligible. For other trajectory data compression algorithms, SLTA’s average angel error is minimum. SLTA can effectively do online GPS trajectory data compression.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Chen, M., Xu, M., Franti, P.: Compression of GPS trajectories. In: Proceedings of the 2012 Data Compression Conference (DCC), pp. 62–71. IEEE, Piscataway (2012) Chen, M., Xu, M., Franti, P.: Compression of GPS trajectories. In: Proceedings of the 2012 Data Compression Conference (DCC), pp. 62–71. IEEE, Piscataway (2012)
2.
Zurück zum Zitat Chen, M., Xu, M., Franti, P.: Compression of GPS trajectories using optimized approximation. In: Proceedings of the 2012 21st International Conference on Pattern Recognition (ICPR), pp. 3180–3183. IEEE, Piscataway (2012) Chen, M., Xu, M., Franti, P.: Compression of GPS trajectories using optimized approximation. In: Proceedings of the 2012 21st International Conference on Pattern Recognition (ICPR), pp. 3180–3183. IEEE, Piscataway (2012)
3.
Zurück zum Zitat Douglas, D.H., Peucker, T.K.: Algorithms for the reduction of the number of points required to represent a digitized line or its caricature. Cartographica: Int. J. Geograph. Inf. Geovis. 10(2), 112–122 (1973)CrossRef Douglas, D.H., Peucker, T.K.: Algorithms for the reduction of the number of points required to represent a digitized line or its caricature. Cartographica: Int. J. Geograph. Inf. Geovis. 10(2), 112–122 (1973)CrossRef
4.
Zurück zum Zitat Hershberger, J., Snoeyink, J.: Speeding up the Douglas-Peucker Line-Simplification Algorithm, pp. 134–143. University of British Columbia, Department of Computer Science (1992) Hershberger, J., Snoeyink, J.: Speeding up the Douglas-Peucker Line-Simplification Algorithm, pp. 134–143. University of British Columbia, Department of Computer Science (1992)
5.
Zurück zum Zitat Hershberger, J., Snoeyink, J.: An O(nlogn) implementation of the Douglas-Peucker algorithm for line simplification. In: Proceedings of the Tenth Annual Symposium on Computational Geometry, pp. 383–384. ACM, New York (1994) Hershberger, J., Snoeyink, J.: An O(nlogn) implementation of the Douglas-Peucker algorithm for line simplification. In: Proceedings of the Tenth Annual Symposium on Computational Geometry, pp. 383–384. ACM, New York (1994)
6.
Zurück zum Zitat Agarwal, P.K., Har-Peled, S., Mustafa, N.H., et al.: Near-linear time approximation algorithms for curve simplification. Algorithmica 42(3–4), 203–219 (2005)MathSciNetCrossRef Agarwal, P.K., Har-Peled, S., Mustafa, N.H., et al.: Near-linear time approximation algorithms for curve simplification. Algorithmica 42(3–4), 203–219 (2005)MathSciNetCrossRef
7.
Zurück zum Zitat Ma, J., Xu, S., Pu, Y., et al.: A real-time parallel implementation of Douglas-Peucker polyline simplification algorithm on shared memory multi-core processor computers. In: Proceedings of the 2010 International Conference on Computer Application and System Modeling (ICCASM), pp. V4-647–V4-652. IEEE, Piscataway (2010) Ma, J., Xu, S., Pu, Y., et al.: A real-time parallel implementation of Douglas-Peucker polyline simplification algorithm on shared memory multi-core processor computers. In: Proceedings of the 2010 International Conference on Computer Application and System Modeling (ICCASM), pp. V4-647–V4-652. IEEE, Piscataway (2010)
8.
Zurück zum Zitat Keogh, E., Chu, S., Hart, D., et al.: An online algorithm for segmenting time series. In: ICDM 2001: Proceedings IEEE International Conference on Data Mining, pp. 289–296. IEEE, Piscataway (2001) Keogh, E., Chu, S., Hart, D., et al.: An online algorithm for segmenting time series. In: ICDM 2001: Proceedings IEEE International Conference on Data Mining, pp. 289–296. IEEE, Piscataway (2001)
9.
Zurück zum Zitat Muckell, J., Hwang, J.H., Patil, V., et al.: SQUISH: an online approach for GPS trajectory compression. In: Proceedings of the 2nd International Conference on Computing for Geospatial Research and Applications, p. 13. ACM, New York (2011) Muckell, J., Hwang, J.H., Patil, V., et al.: SQUISH: an online approach for GPS trajectory compression. In: Proceedings of the 2nd International Conference on Computing for Geospatial Research and Applications, p. 13. ACM, New York (2011)
10.
Zurück zum Zitat Muckell, J., Olsen Jr., P.W., Hwang, J.H., et al.: Compression of trajectory data: a comprehensive evaluation and new approach. GeoInformatica 18(3), 435–460 (2014)CrossRef Muckell, J., Olsen Jr., P.W., Hwang, J.H., et al.: Compression of trajectory data: a comprehensive evaluation and new approach. GeoInformatica 18(3), 435–460 (2014)CrossRef
Metadaten
Titel
An Online GPS Trajectory Data Compression Method Based on Motion State Change
verfasst von
Hui Wang
Shuang Liu
Chengcheng Qian
Copyright-Jahr
2018
DOI
https://doi.org/10.1007/978-3-319-99365-2_22

Premium Partner