Benchmark:
MOT16 |
Short name:
DP_NMS_16
Detector:
Public
Description:
A dynamic programming (DP) approximation to the successive shortest path (SSP) solution of a network flow framework.
Parameters:
Reference:
H. Pirsiavash, D. Ramanan, C. Fowlkes. Globally-Optimal Greedy Algorithms for Tracking a Variable Number of Objects. In CVPR, 2011.
Last submitted:
September 28, 2017 (7 years ago)
Published:
February 29, 2016 at 00:49:34 CET
Submissions:
2
Project page / code:
Open source:
Yes
Hardware:
2.6 GHz, 16 Cores
Runtime:
212.6 Hz
Benchmark performance:
Sequence | MOTA | IDF1 | HOTA | MT | ML | FP | FN | Rcll | Prcn | AssA | DetA | AssRe | AssPr | DetRe | DetPr | LocA | FAF | ID Sw. | Frag |
MOT16 | 26.2 | 31.2 | 24.9 | 31 (4.1) | 512 (67.5) | 3,689 | 130,557 | 28.4 | 93.3 | 28.7 | 21.8 | 30.9 | 70.0 | 22.5 | 73.9 | 79.3 | 0.6 | 365 (12.9) | 638 (22.5) |
Detailed performance:
Sequence | MOTA | IDF1 | HOTA | MT | ML | FP | FN | Rcll | Prcn | AssA | DetA | AssRe | AssPr | DetRe | DetPr | LocA | FAF | ID Sw. | Frag |
MOT16-01 | 20.2 | 27.3 | 22.8 | 1 | 15 | 19 | 5,051 | 21.0 | 98.6 | 33.1 | 15.8 | 37.3 | 63.6 | 16.0 | 74.1 | 78.1 | 0.0 | 31 | 38 |
MOT16-03 | 37.7 | 34.4 | 26.6 | 9 | 60 | 809 | 63,846 | 38.9 | 98.1 | 27.7 | 25.6 | 29.4 | 71.7 | 26.4 | 75.5 | 79.6 | 0.5 | 490 | 534 |
MOT16-06 | 34.5 | 33.5 | 27.4 | 11 | 131 | 40 | 7,326 | 36.5 | 99.1 | 34.2 | 22.1 | 41.3 | 60.0 | 23.3 | 68.4 | 77.8 | 0.0 | 186 | 106 |
MOT16-07 | 27.2 | 28.4 | 23.6 | 4 | 32 | 48 | 11,747 | 28.0 | 99.0 | 29.9 | 18.7 | 32.2 | 63.9 | 19.4 | 69.3 | 77.4 | 0.1 | 86 | 93 |
MOT16-08 | 27.5 | 23.9 | 20.6 | 6 | 33 | 101 | 11,950 | 28.5 | 97.9 | 25.9 | 16.5 | 28.7 | 69.5 | 16.9 | 76.4 | 82.0 | 0.2 | 77 | 70 |
MOT16-12 | 38.8 | 32.1 | 25.9 | 8 | 49 | 67 | 4,978 | 40.0 | 98.0 | 32.6 | 20.6 | 34.9 | 72.7 | 21.5 | 70.3 | 79.4 | 0.1 | 33 | 34 |
MOT16-14 | 9.3 | 19.1 | 17.2 | 1 | 137 | 40 | 16,647 | 10.0 | 97.9 | 29.7 | 10.0 | 31.7 | 66.0 | 10.2 | 68.8 | 76.1 | 0.1 | 73 | 73 |
Raw data: