Improving for Persistence based Trajectory Computing

Persistence with beta pruning and Segment Distance simplification

This is a post on our paper Improving persistence based Trajectory Simplification.

Trajectory Simplification here means, to reduce the number of points in a trajectory in way that preserves the shape of the trajectory. In other words we reduce the number of points while trying to keep a minimal distance between the new trajectory and the old one.

The Persistence algorithm with the our improvement shows good performance and simplifies trajectories without introducing too much error, given the right parameters.

Video presentation explaining the algorithm

Open source Implementation here:

We also provide an open source implementation in c++ here:

https://github.com/mlaass/persistence-open/