Computer vision
author: Richard Hartley,
Australian National University
published: April 1, 2009, recorded: February 2009, views: 35988
published: April 1, 2009, recorded: February 2009, views: 35988
Related content
Report a problem or upload files
If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Description
A pseudo-boolean function is a function from the space B^n of boolean (0-1) vector to the real numbers. They occur naturally in problems in computer vision related to segmentation where every pixel in an image should be labelled 0 or 1 to minimize a certain cost function. Although the minimization of such functions in in general NP hard, many techniques have been develloped to minimize certain classes of such functions. This is the topic of pseudo-boolean optimization, which will be the subject of this talk. Useful methods include graph-cuts algorithms, message passing and linear programming relaxation. The extension to functions with a finite label set will also be considered.
Link this page
Would you like to put a link to this lecture on your homepage?Go ahead! Copy the HTML snippet !
Reviews and comments:
Poor speaker... Apparently far to be a master on the discussed topic!
This guy should get retired ASAP. At this point he brings no value by his poor explanations. Definitively not a skilled lecturer.
I don't know what you guys are talking about. I think he's a great lecturer. You have to have some knowledge on how MRFs and Graph Cuts work before hand, but nevertheless, the guy is great.
Write your own review or comment: