Dynamic Programming

MOT16-01 MOT16-03 MOT16-06 MOT16-07 MOT16-08 MOT16-12 MOT16-14

Short name:

DP_NMS_16

Benchmark:

Description:

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

Parameters:

Hardware:

2.6 GHz, 16 Cores

Detector:

Public

Processing:

Batch

Last submitted:

September 28, 2017 (9 months ago)

Published:

February 29, 2016 at 00:49:34 CET

Submissions:

2

Open source:

Yes

Project page / code:

Reference:

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

Benchmark performance:

MOTAMOTPFAFMTMLFPFNID Sw.FragSpecificationsDetector
26.276.30.64.1 % 67.5 % 3,689130,5573656382.6 GHz, 16 CoresPublic
IDF1ID PrecisionID Recall
31.266.920.3

Detailed performance:

Sequence MOTA IDF1 MOTP FAF GT MT ML FP FN ID Sw Frag
MOT16-0120.627.373.70.1238.7 % 56.5 % 305,042715
MOT16-0331.834.476.61.11485.4 % 44.6 % 1,59069,563160241
MOT16-0624.333.574.90.42214.5 % 70.6 % 5328,1475692
MOT16-0721.128.474.51.1543.7 % 70.4 % 54812,29343116
MOT16-0817.823.980.30.5633.2 % 68.3 % 34213,3754045
MOT16-1222.832.176.80.3863.5 % 69.8 % 3126,0702438
MOT16-1411.119.172.90.41642.4 % 82.9 % 33516,0673591

Raw data:


DP_NMS_16