ICVGIP 2010 Full-Day Tutorial
9:30 - 17:30
Markov Models for Computer Vision
Speakers: Pushmeet Kohli (Microsoft Research, Cambridge) and Pawan Mudigonda (Stanford University)
Many problems in Computer Vision are formulated using Markov models. Solution under this model involves computing the most probable values of certain random variables. This problem, known as Maximum a Posteriori (MAP) estimation has been widely studied in Computer Science and the resulting algorithms have led to accurate and reliable solutions for many problems in computer vision and information engineering. This tutorial is aimed at researchers who wish to use and understand these algorithms. The tutorial will answer the following questions: How to formalize and solve some known vision problems using MAP inference of a random field? What are the different genres of MAP inference algorithms, and how do they work? Which algorithm is suitable for which problem? and lastly, what are the recent developments and open questions in this field.
About the speakers
Pushmeet Kohli is a researcher in the Machine Learning and Perception group at Microsoft Research Cambridge, and a post-doctoral associate of Trinity Hall, University of Cambridge. He completed his PhD studies at Oxford Brookes University under the supervision of Prof. Philip Torr. His PhD thesis, titled "Minimizing Dynamic and Higher Order Energy Functions using Graph Cuts", was the winner of the British Machine Vision Association's Sullivan Doctoral Thesis Award, and was a runner-up for the British Computer Society's Distinguished Dissertation Award. Before joining Microsoft Research Cambridge, Pushmeet was a visiting researcher at Microsoft Research Bangalore. He previously worked in the Foundation of Software Engineering Group at MSR Redmond. Pushmeet has worked on a number of problems in Computer Vision, Machine Learning and Discrete Optimization. His papers have appeared in SIGGRAPH, PAMI, IJCV, ICCV, CVPR, ICML and ECCV.
M. Pawan Kumar