Superpixels, Occlusion and Stereo

Graph-based energy minimization is now the state of the art in stereo matching methods. In spite of its outstanding performance, few efforts have been made to enhance its capability of occlusion handling. We propose an occlusion constraint, an iterative optimization strategy and a mechanism that proceeds on both the digital pixel level and the super pixel level. Our method explicitly handles occlusion in the framework of graph-based energy minimization. It is fast and outperforms previous methods especially in the matching accuracy of boundary areas.