Encoding network-constrained travel trajectories using routing algorithms
by Pablo Martinez Lerin; Daisuke Yamamoto; Naohisa Takahashi
International Journal of Knowledge and Web Intelligence (IJKWI), Vol. 4, No. 1, 2013

Abstract: This study proposes a generic encoder for network-constrained travel trajectories, and it implements two encoders by combining the proposed generic encoder with two routing algorithms, which reduce the size of a travel trajectory's path along a road network without modifying it. Although most previous trajectory compression methods introduce an error in the spatial component of trajectories to achieve compression, we argue that the path of a travel trajectory, i.e. the sequence of roads travelled, is crucial information for many applications. Experimental results obtained using a large-data set of real travel trajectories show that the two proposed encoders achieve high compression, outperforming a general purpose data compression method.

Online publication date: Mon, 18-Mar-2013

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Knowledge and Web Intelligence (IJKWI):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com