%0 Journal Article
%T Dense Matching Algorithm Based on Region Boundary Restriction via Graph Cuts Optimization<br>基于区域边界约束和图割优化的稠密匹配算法
%A CHEN Wang
%A ZHANG Mao-jun
%A XIONG Zhi-hui
%A <br>陈旺
%A 张茂军
%A 熊志辉
%J 计算机科学
%D 2009
%I 
%X 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.
%K Dense matching
%K Stereo matching
%K Region boundary
%K Graph cuts optimization<br>稠密匹配
%K 立体匹配
%K 区域边界
%K 图割优化
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=55C2A04ED356821C7E588E7C3F5F0601&yid=DE12191FBD62783C&vid=933658645952ED9F&iid=708DD6B15D2464E8&sid=B799C1769FCACDC8&eid=4D7D059FFBF006B9&journal_id=1002-137X&journal_name=计算机科学&referenced_num=0&reference_num=20