![]() |
COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. | ![]() |
University of Cambridge > Talks.cam > dsu21's list > Graph algorithms for more efficient inference in 1st-order and higher-order MRF's
Graph algorithms for more efficient inference in 1st-order and higher-order MRF'sAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact dsu21. Efficient inference is a major challenge for the MRF ’s that arise in computer vision. Most such MRF ’s are 1st-order, and are typically solved with methods like message passing or graph cuts. I will present a new preprocessing technique for 1st-order MRF ’s that makes widely used graph cut methods an order of magnitude more efficient. Higher-order MRF ’s are very powerful, but present a much more difficult challenge; I will describe techniques based on a variant of submodular flow that can perform efficient inference over some important higher-order priors. This talk is part of the dsu21's list series. This talk is included in these lists:Note that ex-directory lists are not shown. |
Other listsPeterhouse Theory Group Cambridge Tech Talks DAMTP Fluids TalksOther talksAssessing the Impact of Open IP in Emerging Technologies Slaying (or at least taming) a dreadful monster: Louis de Serres' treatise of 1625 for women suffering from infertility Saving our bumblebees Open IP in Emerging and Developing Economies A domain-decomposition-based model reduction method for convection-diffusion equations with random coefficients |