A minimum cost flow formulation for approximated MLC segmentation.

Thomas Kalinowski

Published in: Networks (2011)

Keyphrases

minimum cost flow
network simplex algorithm
segmentation algorithm
level set
shortest path
image segmentation
bi objective
segmentation method
shortest path algorithm
minimum cost
shape prior
strongly polynomial
search algorithm