2011.
This implementation is not the reference implementation used for the
-experiments presented in this article. It uses a Dijkstra with a
-Binary Heap for the min-queue, and not the optimal Fibonacci heap.
+experiments presented in this article. It does not require any
+library, and uses a Dijkstra with a Binary Heap for the min-queue,
+instead of a Fibonacci heap.
This software package includes three commands:
- mtp_example creates a tracking toy example, and runs the tracking
algorithm on it. It gives an example of how to use MTPTracker on a
- configuration produced dynamically, and produce a test input file
+ configuration produced dynamically, and produces a test input file
for the mtp command.
- mtp_stress_test creates a larger problem with a lot of noise and
multiple trajectories, to check the behavior of the code under
- slightly more complex situation.
+ slightly more complex situations.
* INSTALLATION
If you now execute
- ./mtp --verbose --trajectory-file result.trj --graph-file graph.dot < tracker.dat
+ ./mtp --verbose --trajectory-file result.trj --graph-file graph.dot tracker.dat
It will load the file tracker.dat saved by the previous command, run
the detection, save the detected trajectories in result.trj, and the