Trajectory Reconnection : Différence entre versions
De Transport
m (NicolasSaunier a déplacé la page TrajectoryReconnection vers Trajectory Reconnection) |
|||
| Ligne 1 : | Ligne 1 : | ||
| − | As identified by Paul St-Aubin, there are three cases of split trajectories: | + | As identified by Paul St-Aubin, there are three cases of split or lost trajectories: |
| + | |||
| + | # objects disrupted because of foregroung occlusion, typically by static foreground objects | ||
| + | # objects tracked by different cameras, overlapping or not | ||
| + | # objects stopping and lost by the tracker (in the same camera view) | ||
| + | |||
| + | Reconnection methods: | ||
| + | |||
| + | # measure similarity of trajectory end and beginning, stored in a bipartite graph, then run an optimization matching algorithm such as the Hungarian algorithm | ||
| + | #* similarity: position, time, predicted position, volume, type (if classified), appearance | ||
| + | |||
| + | Regarding the method to store the result of reconnecting trajectories, it depends if the objects are initially stored in the same database or not. | ||
| + | |||
| + | * if stored in the same database, an option is to connect the features of the two objects to the same object. | ||
| + | ** if there is a time interval during which there is no feature, an artificial feature corresponding to the interpolated object position should be created and added to the feature group | ||
| + | * if stored in different databases, an option would be to merge both in a new database, with renumbering of objects and features | ||
Version du 23 mai 2016 à 00:46
As identified by Paul St-Aubin, there are three cases of split or lost trajectories:
- objects disrupted because of foregroung occlusion, typically by static foreground objects
- objects tracked by different cameras, overlapping or not
- objects stopping and lost by the tracker (in the same camera view)
Reconnection methods:
- measure similarity of trajectory end and beginning, stored in a bipartite graph, then run an optimization matching algorithm such as the Hungarian algorithm
- similarity: position, time, predicted position, volume, type (if classified), appearance
Regarding the method to store the result of reconnecting trajectories, it depends if the objects are initially stored in the same database or not.
- if stored in the same database, an option is to connect the features of the two objects to the same object.
- if there is a time interval during which there is no feature, an artificial feature corresponding to the interpolated object position should be created and added to the feature group
- if stored in different databases, an option would be to merge both in a new database, with renumbering of objects and features
