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:

February 29, 2016 (1 year ago)

Published:

February 29, 2016 at 00:49:34 CET

Submissions:

1

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
32.276.40.25.4 % 62.1 % 1,123121,5799729442.6 GHz, 16 CoresPublic

Detailed performance:

Sequence MOTA MOTP FAF GT MT ML FP FN ID Sw Frag
MOT16-0120.273.90.0234.3 % 65.2 % 195,0513138
MOT16-0337.776.30.51486.1 % 40.5 % 80963,873490534
MOT16-0634.675.10.02215.4 % 63.3 % 407,326182102
MOT16-0727.275.00.1547.4 % 61.1 % 4811,7478693
MOT16-0827.580.40.2639.5 % 52.4 % 10011,9587770
MOT16-1238.777.30.1869.3 % 57.0 % 674,9823334
MOT16-149.375.30.11640.6 % 86.0 % 4016,6427373

Raw data:


DP_NMS_16