Continuous Maximal Flows (CMF) were recently introduced as the continuous equivalent to graph cuts, allowing for the globally optimal computation of minimal implicit surfaces. In this talk, we will expose the derivation of CMF from graph cuts, discuss implementation and recent work concerning reformulation and convergence. We will also show some image segmentation applications involving shape priors.
*Talk with Laszlo Marak
Additional Presentation Files (Zip Archive)
Copyright. All Rights Reserved.