Changed the date.

[mtp.git] / README.txt

diff --git a/README.txt b/README.txt
index ba8e593..807f567 100644 (file)
--- a/README.txt
+++ b/README.txt
@@ -14,8 +14,9 @@ in
   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:
 
@@ -26,12 +27,12 @@ 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
 
@@ -46,7 +47,7 @@ tracker.dat, and print the optimal detected trajectories.
 
 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
@@ -74,9 +75,9 @@ computation is iterative.
 
 The MTPTracker takes as input
 
- (1) a spatial topology composed of
+ (1) a number of locations and a number of time steps
 
-     - a number of locations
+ (2) a spatial topology composed of
 
      - the allowed motions between them (a Boolean flag for each pair
        of locations from/to)
@@ -85,8 +86,6 @@ The MTPTracker takes as input
 
      - the exits (a Boolean flag for each location and time step)
 
- (2) a number of time steps
-
  (3) a detection score for every location and time, which stands for
 
              log( P(Y(l,t) = 1 | X) / P(Y(l,t) = 0 | X) )
@@ -96,7 +95,7 @@ The MTPTracker takes as input
      where the probability that the location is occupied is close to
      0, and positive when it is close to 1.
 
-From this parameters, an MTPTracker can compute the best set of
+From this parameters, the MTPTracker can compute the best set of
 disjoint trajectories consistent with the defined topology, which
 maximizes the overall detection score (i.e. the sum of the detection
 scores of the nodes visited by the trajectories). In particular, if no
@@ -150,4 +149,4 @@ structure
 
 --
 François Fleuret
-December 2012
+January 2013