Multi-target Tracking by Lagrangian Relaxation to Min-cost Network Flow.
Asad A. ButtRobert T. CollinsPublished in: CVPR (2013)
Keyphrases
- min cost
- lagrangian relaxation
- network flow
- integer programming
- linear programming
- np hard
- column generation
- feasible solution
- branch and bound algorithm
- lower bound
- dynamic programming
- constraint programming
- lower and upper bounds
- network flow formulation
- valid inequalities
- integer program
- optimization model
- linear program
- upper bound
- pairwise
- convex hull
- particle filter