t
$ and t+1
, we assume that for every object o* i,t
in frame t
, the object o* i, t+1
in frame t+1
with the highest IOU to o* i, t
should have the same objectHash.
For every object in frame t
, the algorithm works by computing the IOU between that object and every object in frame t+1
to select the one with the highest IOU. If those two objects have the same objectHash, all good, score will be zero. There’s nothing to flag. If, on the other hand, the two objects do not share the same objectHash, it’s flagged by setting the score to the IOU between the two.
Think of o* i, t
as the best match (highest IOU) in the following frame.
o i,t. ID
as a shorthand for objectHash.
In turn,
hYK5AFR6
for a while, and suddenly it changes to H1ca7QwH
. Also indicated here by color (which would not actually be the case in the editor).