This week, continuing the theme of MAP inference, we’ll look at graph cut methods for energy minimization.

This will be the main paper: What Energy Functions Can Be Minimized via Graph Cuts? Komogorov, Zabih

This additional paper may help in understanding graph cuts: Fast Approximate Energy Minimization via Graph Cuts. Boykov, Veksler, Zabih.

There is no paper set yet for this week. Some possibilities:

Variable Elimination, Constructing the Pseudo-tree, Min-fill, and Mini-bucket heuristic

A two week sequence of:

- (CVPR 2008 best paper) Beyond Sliding Windows: Object Localization by Efficient Subwindow Search, Christoph H. Lampert, Matthew B.Blaschko,Thomas Hofmann – http://www.kyb.mpg.de/publications/pdfs/pdf5070.pdf
- (ECCV 2008 best student paper) Matthew B. Blaschko and Christoph H. Lampert. Learning to Localize Objects with Structured Output Regression. – http://www.kyb.mpg.de/publications/attachments/ECCV2008-Blaschko_5247%5B0%5D.pdf

The first paper would be related to our previous reading, in that they do search with branch and bound.

Anything else on this page – https://umassliving.wordpress.com/2009/09/03/fall-2009-organization/#comments

Post your suggestions soon, with the aim of settling on a paper by mid-day Monday.