%0 Journal Article
%T Stereo Matching and Large Occlusion Detection Based on Disparity Points<br>基于视差点的大遮挡检测和立体匹配方法
%A WEN Gong-Jian
%A ZHOU Xiu-Zhi
%A <br>文贡坚
%A 周秀芝
%J 软件学报
%D 2005
%I 
%X An algorithm based on disparity points to solve the occlusion problem in the process of building high-quality stereo disparity map is presented in this paper. It is firstly proved that the disparity curve corresponding to a pair of epipolar-line images may be approximated by a group of piece-wise straight lines, and then the definition of disparity point is introduced. In the parameterization of a disparity point, two parameters are used to describe left and right occlusions so that the occlusion problem can be successfully solved in the approach. By analyzing intensity property of a disparity point and its neighbor points, an approach which combines stepwise hypothesis-verification strategy and Marquardt-Levenberg (M-L) algorithm is devised to extract the candidate disparity points from the epipolar images, and then aperiodic dynamic programming is employed to search the epipolar-optimal disparity function. The proposed method is tested by using the international standard image data and compared with other methods, and the experimental results show that its performance is the best among epipolar-optimal methods and worse than some excellent global-optimal approaches, but its complexity is much lower than the global-optimal approaches.
%K stereo matching
%K occlusion detection
%K epipolar-optimal
%K hypothesis-verification strategy
%K dynamic programming
%K Marquardt-Levenberg algorithm<br>立体匹配
%K 遮挡检测
%K 核线最优
%K 假设证实
%K 动态规划
%K M-L算法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=63D82EBA024CCFCF&yid=2DD7160C83D0ACED&vid=7801E6FC5AE9020C&iid=94C357A881DFC066&sid=C3BC38F6CC09E835&eid=E5ED9059DE792E50&journal_id=1000-9825&journal_name=软件学报&referenced_num=1&reference_num=17