Login / Signup

Efficient Multiple People Tracking Using Minimum Cost Arborescences.

Roberto HenschelLaura Leal-TaixéBodo Rosenhahn
Published in: GCPR (2014)
Keyphrases
  • minimum cost
  • np hard
  • approximation algorithms
  • simulated annealing
  • spanning tree
  • capacity constraints
  • network flow problem
  • edit operations