DP_NMS_16: Dynamic Programming

MOT16-01


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 (3 years ago)

Published:

February 29, 2016 at 00:49:34 CET

Submissions:

2

Open source:

Yes

Hardware:

2.6 GHz, 16 Cores

Runtime:

212.6 Hz

Benchmark performance:

Sequence MOTA IDF1 MOTP MT ML FP FN Recall Precision FAF ID Sw. Frag
MOT1626.231.276.331 (4.1)512 (67.5)3,689130,55728.493.30.6365 (12.9)638 (22.5)

Detailed performance:

Sequence MOTA IDF1 MOTP MT ML FP FN Recall Precision FAF ID Sw. Frag
MOT16-0120.227.373.9115195,05121.098.60.03138
MOT16-0337.734.476.396080963,84638.998.10.5490534
MOT16-0634.533.575.111131407,32636.599.10.0186106
MOT16-0727.228.475.04324811,74728.099.00.18693
MOT16-0827.523.980.463310111,95028.597.90.27770
MOT16-1238.832.177.3849674,97840.098.00.13334
MOT16-149.319.175.311374016,64710.097.90.17373

Raw data: