Next: Salari and Sethi SS90
Up: The Algorithms
Previous: Sethi and Jain SJ87
Hwang HW89
Original reference: [7].
Additional assumptions: A speed limit is given. No exit.
Initialization: Within the speed limit,
all links between
and
are considered.
Cost function: As in SJ87 (eq. (1)), but with
different weights
,
.
The cost is
averaged in 3 consecutive frames.
Linking strategy: Multiple extensions of a trajectory are ranked
according to their costs. A few top-ranked are kept for final selection
in the last frame. Multiple solutions are possible.
A point can be assigned no trajectory at all.
Occlusion handling: An occluded point is indicated if
a vicinity of the predicted location is empty. The vicinity is defined
by the speed limit.
Dmitry Chetverikov
1998-11-24