Abstract: Two main challenges of stereo matching algorithm via graph cuts global optimization are discontinuity and occlusion problems. Energy function with convex smooth term has a global optical solution but is over-smoothing at the boundary of scene object,while energy function with non-convex smooth term preserves discontinuity but just has a sccond global optical solution via iterative optimization, and problems of occlusion, orderingness, uniqueness are not dealt with appropriately as well. I}herefore, with the observation that disparity almost j umps at the color discontinuity, this paper proposed an approach of energy function presentation for dense stereo matching based on restrictions between region boundary pixels, which assured not only a global optimal solution but also discontinuity-preserving, meanwhile treated with issues of occlusion, orderingness, uniqueness and greatly improved computing efficiency.

Key words: Dense matching, Stereo matching, Region boundary, Graph cuts optimization