Revision history [back]

naa, no bug here ;)

if you look at the src, the algorithm is like this:

1. sort by score
2. cut off top_k elems
3. compute overlaps (cluster)

so, step 3 will reduce the list of boxes even further, since several boxes will collapse to a single one.

again, you get at most top_k items (and only if it does not find any significant overlaps)