Dense stereo matching using local cues with optimal per pixel plane assignment

 In this talk we show how the classic problem of stereo matching using global optimization can be improved by using a cost function that combines both pixel wise and block matching costs, modifying the smoothness term, including information about surface direction, and optimally assigning a plane per pixel.