An Online Algorithm for Segmenting Time Series
ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
On-line data reduction and the quality of history in moving objects databases
MobiDE '06 Proceedings of the 5th ACM international workshop on Data engineering for wireless and mobile access
Sampling Trajectory Streams with Spatiotemporal Criteria
SSDBM '06 Proceedings of the 18th International Conference on Scientific and Statistical Database Management
Algorithms for compressing GPS trajectory data: an empirical evaluation
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
SQUISH: an online approach for GPS trajectory compression
Proceedings of the 2nd International Conference on Computing for Geospatial Research & Applications
Compact representation of GPS trajectories over vectorial road networks
SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases
A Framework for Efficient and Convenient Evaluation of Trajectory Compression Algorithms
COMGEO '13 Proceedings of the 2013 Fourth International Conference on Computing for Geospatial Research and Application
Hi-index | 0.00 |
Trajectory compression algorithms enable efficient transmission, storage, and processing of trajectory data by eliminating redundant information. While a large number of compression algorithms have been developed, there is no comprehensive and convenient benchmarking system for evaluating these algorithms. We will demonstrate TrajMetrix, our system that meets the above need. We will show how TrajMetrix can be used to gain insights into the benefits and drawbacks of various compression algorithms given different compression requirements. From the knowledge attained by using TrajMetrix, we developed SQUISH-E (Spatial QUalIty Simplification Heuristic - Extended). This algorithm uses a priority queue to preferentially remove points based on the error introduced by their removal. Through live demonstrations that use both synthetic and real data sets, we will show the ability of SQUISH-E to effectively bound compression error with low computational overhead.