OLGKAD / GraphTrack

A feature tracking algorithm implemented in C++.
0 stars 0 forks source link

candidate_selection() #2

Open OLGKAD opened 6 years ago

OLGKAD commented 6 years ago

Currently, only 250 candidate nodes are being selected in each frame, and the rest is thrown away.

What actually should be done is 250 candidate nodes should be placed up in the priority queue, and only nodes at a distance >= 72 from positive patches should be discarded.

OLGKAD commented 6 years ago

In "LiveSketch" they seem to be doing exactly that though: select a few candidates and disregard the rest. However, they might just be omitting some details.