DP_NMS: Dynamic Programming

TUD-Crossing


Benchmark:

Short name:

DP_NMS

Detector:

Public

Description:

A dynamic programming (DP) approximation to the successive shortest path (SSP) solution of a network flow framework.

Parameters:
c_en=18.2882
c_ex=16.8287
c_ij=0.42473
betta=0.24366
max_it=Inf
thr_cost=9.0096

Reference:

H. Pirsiavash, D. Ramanan, C. Fowlkes. Globally-Optimal Greedy Algorithms for Tracking a Variable Number of Objects. In CVPR, 2011.

Last submitted:

September 23, 2017 (2 years ago)

Published:

November 01, 2014 at 03:09:33 CET

Submissions:

3

Open source:

Yes

Hardware:

2.6 GHz, 16 Cores

Runtime:

444.8 Hz

Benchmark performance:

Sequence MOTA IDF1 MOTP MT ML FP FN Recall Precision FAF ID Sw. Frag
2D MOT 201514.519.770.843 (6.0)294 (40.8)13,17134,81443.366.92.34,537 (104.7)3,090 (71.3)

Detailed performance:

Sequence MOTA IDF1 MOTP MT ML FP FN Recall Precision FAF ID Sw. Frag
ADL-Rundle-1-2.220.369.9684,2135,05845.650.28.4241336
ADL-Rundle-323.727.072.0392,1935,40746.868.53.5158189
AVG-TownCentre13.415.068.88931,2064,68234.567.22.7299414
ETH-Crossing21.122.375.50152775724.590.10.1716
ETH-Jelmoli34.831.073.38133141,28049.580.00.75986
ETH-Linthescher12.415.574.731571647,60914.889.00.149102
KITTI-1626.319.468.50229089647.373.51.467116
KITTI-1917.718.268.34161,3882,81847.364.51.3191242
PETS09-S2L238.315.771.6461,0164,61152.283.22.3320417
TUD-Crossing57.233.671.7428134868.490.30.44349
Venice-112.712.671.7086863,24029.065.91.556114

Raw data: