March 25, Wednesday
12:00 – 13:00
In this presentation, I will present several selected papers in computer graphics that attempt to solve the mentioned reconstruction problem. The papers were presented in top rated conferences related to computer graphics (SIGGRAPH2007, SIGGRAPH2008, EUROGRAPHICS2009). Some elementary backgroundis required in the following research areas: random algorithms, probability, numerical analysis, graphs algorithms, and linear algebra, however all the algorithms will be represented clearly (first degree background in related courses should be sufficient).
Topics and approaches that will be presented as time and interest allow: The efficient RANSAC approach, TheGRAPH-CUT as an optimization problem, The "4 is less than 3" approach for random validation and scoring algorithms, Advanced approach for cleaningnoisy datasets.