Compression of GPS trajectories using optimized approximation

A large number of GPS trajectories, which include users' spatial and temporal information, are collected by geo-positioning mobile phones in recent years. The massive volumes of trajectory data bring about heavy burdens for both network transmission and data storage. To overcome these difficult...

Full description

Saved in:
Bibliographic Details
Published inProceedings of the 21st International Conference on Pattern Recognition (ICPR2012) pp. 3180 - 3183
Main Authors Minjie Chen, Mantao Xu, Franti, P.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.11.2012
Subjects
Approximation methods
Compression algorithms
Encoding
Global Positioning System
Image coding
Time complexity
Trajectory
Online AccessGet full text

Cover

More Information
Summary:A large number of GPS trajectories, which include users' spatial and temporal information, are collected by geo-positioning mobile phones in recent years. The massive volumes of trajectory data bring about heavy burdens for both network transmission and data storage. To overcome these difficulties, GPS trajectory compression algorithm (GTC) was proposed recently that optimizes both the data reduction by trajectory simplification and the coding procedure using the quantized data. In this paper, instead of using greedy solution in GTC algorithm, the approximation process is optimized jointly with the encoding step via dynamic programming. In addition, Bayes' theorem is applied to improve the robustness of probability estimation for encoded values. The proposed solution has the same time complexity with GTC algorithm in the decoding procedure and experimental results show that its bitrate is around 80% comparing with GTC algorithm.
ISBN:9781467322164
1467322164
ISSN:1051-4651
2831-7475