A graph-cut based algorithm for approximate MRF optimization.

Aymen Shabou Florence Tupin Jérôme Darbon

Published in: ICIP (2009)

Keyphrases

mrf optimization
dynamic programming
np hard
expectation maximization
optimal solution
search space
graph cuts
segmentation algorithm
lower bound
simulated annealing
energy function
monte carlo
max flow