Encoding network–constrained travel trajectories using routing algorithms. (19th March 2013)

• Record Type: Journal Article
• Authors: Lerin, Pablo Martinez; Yamamoto, Daisuke; Takahashi, Naohisa
• Is Part Of: International journal of knowledge and web intelligence. Volume 4:Number 1(2013)
• Page Start: 34
• Page End: 49
• Publication Date: 2013-03-19
• Subjects: network constrained trajectories -- travel trajectories -- trajectory encoding -- lossless trajectory compression -- shortest path -- following path -- routing algorithms -- map matching -- GPS -- global positioning systems -- GIS -- geographical information systems -- roads -- road sequences; Information retrieval -- Periodicals; Web site development -- Periodicals; Internet programming -- Periodicals; 004.67805
• Languages: English
• ISSNs: 1755-8255

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.