Abstract
Many devices nowadays record traveling routes, of users, as sequences of GPS locations. With the growing popularity of smartphones, millions of such routes are generated each day, and many routes have to be stored locally on the device or transmitted to a remote database. It is, thus, essential to encode the sequences, to decrease the volume of the stored or transmitted data. In this paper we study the problem of coding routes over a vectorial road network (map), where GPS locations can be associated with vertices or with road segments. We consider a three-step process of dilution, map-matching and coding. We present two methods to code routes. The first method represents the given route as a sequence of greedy paths. We provide two algorithms to generate a greedy-path code for a sequence of n vertices on the map. The first algorithm has O(n) time complexity, and the second one has O(n 2) time complexity, but it is optimal, meaning that it generates the shortest possible greedy-path code. Decoding a greedy-path code can be done in O(n) time. The second method codes a route as a sequence of shortest paths. We provide a simple algorithm to generate a shortest-path code in O(kn 2 logn) time, where k is the length of the produced code, and we prove that this code is optimal. Decoding a shortest-path code also requires O(kn 2 logn) time. Our experimental evaluation shows that shortest-path codes are more compact than greedy-path codes, justifying the larger time complexity.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Zheng, Y., Zhang, L., Ma, Z., Xie, X., Ma, W.Y.: Recommending friends and locations based on individual location history. ACM Trans. Web 5(1), 5:1–5:44 (2011)
Cao, X., Cong, G., Jensen, C.S.: Mining significant semantic locations from gps data. Proc. VLDB Endow. 3(1-2), 1009–1020 (2010)
Li, Q., Zheng, Y., Xie, X., Chen, Y., Liu, W., Ma, W.Y.: Mining user similarity based on location history. In: Proc. of the 16th ACM SIGSPATIAL GIS (2008)
Giannotti, F., Nanni, M., Pedreschi, D., Pinelli, F., Renso, C., Rinzivillo, S., Trasarti, R.: Unveiling the complexity of human mobility by querying and mining massive trajectory data. The VLDB Journal 20, 695–719 (2011)
Zheng, Y., Li, Q., Chen, Y., Xie, X., Ma, W.Y.: Understanding mobility based on gps data. In: Proceedings of the 10th International Conference on Ubiquitous Computing, pp. 312–321 (2008)
Meratnia, N., de By, R.A.: Spatiotemportal compression techniques for moving point objects. In: Proc. of the 9th International Conference on Extending Database Technology (2004)
Muckell, J., Hwang, J.H., Patil, V., Lawson, C.T., Ping, F., Ravi, S.S.: Squish: an online approach for gps trajectory compression. In: Proc. of the 2nd COM.Geo. COM.Geo 2011, pp. 13:1–13:8. ACM (2011)
Chen, Y., Jiang, K., Zheng, Y., Li, C., Yu, N.: Trajectory simplification method for location-based social networking services. In: Proc. of the 2009 International Workshop on Location Based Social Networks, LBSN 2009, pp. 33–40 (2009)
Zheng, Y., Zhou, X. (eds.): Computing with Spatial Trajectories. Springer (2011)
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: Inter. Journal for Geographic Information and Geovisualization 10(2), 112–122 (1973)
White, C.E., Bernstein, D., Kornhauser, A.L.: Some map matching algorithms for personal navigation assistants. In: Transportation Research Part C: Emerging Technologies, vol. 8, pp. 91–108 (2000)
Quddus, M.A., Ochieng, W., Zhao, L., Noland, R.B.: A general map matching algorithm for transport telematics applications. GPS Solution 7(3) (2003)
Quddus, M.A., Ochieng, W.Y., Noland, R.B.: Current map-matching algorithms for transport applications: State-of-the art and future research directions. In: Transportation Research Part C: Emerging Technologies, pp. 312–328 (2007)
Hummel, B.: Map matching for vehicle guidance. In: Dynamic and Mobile GIS: Investigating Space and Time, pp. 437–438. CRC Press (2006)
Viterbi, A.J.: Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. Transactions on Information Theory 13(2), 260–269 (1967)
Newson, P., Krumm, J.: Hidden markov map matching through noise and sparseness. In: Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, pp. 336–343 (2009)
Bose, P., Morin, P.: Online routing in triangulations. SIAM Journal of Computing 33, 937–951 (2004)
Imai, H., Iri, M.: Computational-geometric methods for polygonal approximations of a curve. Comp. Vision, Graphics, and Image Processing 36(1), 31–41 (1986)
Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. In: Proc. of the 25th Annual Symposium on Foundations of Computer Science, pp. 338–346. IEEE (1984)
Mehlhorn, K.: Unique shortest paths. In: Selected Topics in Algorithms: Course Notes (2009)
Bellman, R.: On a routing problem. Quarterly of Applied Mathematics 16(1), 87–90 (1958)
Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1(1), 269–271 (1959)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gotsman, R., Kanza, Y. (2013). Compact Representation of GPS Trajectories over Vectorial Road Networks. In: Nascimento, M.A., et al. Advances in Spatial and Temporal Databases. SSTD 2013. Lecture Notes in Computer Science, vol 8098. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40235-7_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-40235-7_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40234-0
Online ISBN: 978-3-642-40235-7
eBook Packages: Computer ScienceComputer Science (R0)