遮挡检测/立体匹配中的分段动态规划法

Dynamic Programming in Segments for Occlusion Detection/Stereo Matching

为了显式地在视差图上标记出遮挡区域,本文在计算视差空间的基础上,利用动态规划算法搜索出最佳视差曲线.计算所得的视差曲线上有三种状态标记:匹配状态和二种遮挡状态.为了保证视差曲线通过路径控制点,提出了一种分段式动态规划算法.算法将视差空间影像划分为路径控制区和非路径控制区.在路径控制区强制路径通过路径控制点,在非路径控制区采用动态规划进行路径最佳搜索.为保证路径控制点高度可靠,提出了选择路径控制点的4个准则.实验结果表明,新算法比传统的动态规划算法在遮挡检测和匹配精度上都有一定的提高,算法可靠性强,运算量小.

In order to mark occluded regions explicitly on the disparity map, the dynamic programming is employed to search optimal disparity curve on base of the calculating disparity space at first. Each point on the optimal disparity curve must be in one of three states：matching state or other two occlusion states. To guarantee the disparity curve passing through ground control points （GCP） ,an algorithm of dynamic programming in segments is proposed, that is,the disparity space image is divided into ground control regions and non-ground control regions. In the ground control region, the searching path is forced to pass GCPs. In the non- ground control region, the optimal path searching is under dynamic programming. For the reliability of the GCP, four criterions are presented to choose a point as a GCP. Experimental results show that the new algorithm has certain enhancement in the precision of occlusion detection and matching,and is more reliable and faster than conventional dynamic algorithms.