Cosmetics.

[mtp.git] / README.txt

diff --git a/README.txt b/README.txt
index c3e14dd..aad4ca2 100644 (file)
--- a/README.txt
+++ b/README.txt
@@ -75,29 +75,27 @@ 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)
+     - the allowed motions between locations (a Boolean flag for each
+       pair of locations from/to)
 
      - the entrances (a Boolean flag for each location and time step)
 
      - 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) )
 
      where Y is the occupancy of location l at time t and X is the
-     available observation. Hence, this score is negative on locations
-     where the probability that the location is occupied is close to
-     0, and positive when it is close to 1.
+     available observation. In particular, this score is negative on
+     locations 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
@@ -151,4 +149,4 @@ structure
 
 --
 François Fleuret
-December 2012
+April 2013