Login / Signup
Optimal-flow minimum-cost correspondence assignment in particle flow tracking.
Alexandre Matov
Marcus M. Edvall
Ge Yang
Gaudenz Danuser
Published in:
Comput. Vis. Image Underst. (2011)
Keyphrases
</>
minimum cost
network flow problem
np hard
approximation algorithms
network flow
network simplex algorithm
capacity constraints
minimum cost flow
flow field
spanning tree
flow rate
lower bound
dynamic programming
scheduling problem
worst case
particle filter